Public report of marcoemrich/agentic_coding_lab, published 17 November 2026. It has the same score, grades and number of
findings as the full report. The details of security findings (where they are in the code, which known
vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive reportMeasured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.11.4). Assert signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey →
Signed and filed in the standard's public register, 17 November 2026, 04:34 UTC · Survey ID cd_2795cbdd8fab4332a3e79c530cfa7b0d
marcoemrich/agentic_coding_lab
Measured 17 November 2026, 04:25 UTC, at code version 8453d88
Knowledge freshness is not measured: Freshness signal contradicted by repo activity.
CAI scoreAt risk
The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.
A large codebase: 355,203 lines of product code in 200 projects, tests not counted · Estimated rebuild effort: about 5.7 person-years · Weakest lens: Production Readiness, 19.0
Findings by how serious they are
520 critical943 serious2480 minor
12 dimensions are left out of the score. For each one, we either couldn't measure it in this code, or found no evidence of the safeguard we look for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.
This survey was produced by
Canine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
17 November 2026, 04:25 UTC
A measurement, not a certificate. The Code Assurance Index records a number
together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee
the code. The standard was written by Canine Development, which also builds the Canine Code Analyzer. It is open to any tool that
implements it, and today the Canine Code Analyzer is the only one that does.
A critical security finding is open, such as a library with a known critical vulnerability or a password or key found in the code. The score itself is unchanged, but its band shows At risk until the finding is fixed. See the Security and Compliance lens.
The score is deterministic, which means the same code always gets the same score. We work it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸
71of 71 dimensions measured by tools.
3934of 3943 findings point to an exact file and line, so you can open each one in the code. The other 9 concern the repository as a whole, such as missing documentation.
71dimensions across 7 lenses, read from 355,203 lines of product code in 200 projects.
marcoemrich/agentic_coding_lab is rated At risk because critical security findings are open, most of them in the packages it uses. Its score is held back because we found no working pipeline that builds or tests changes to the code and no logging, tracing or health checks in the code. It scores 43.7 out of 100, which the At risk rating leaves unchanged. We judged it as a template or a sample, against a lower bar.
Production Readiness, at 19.0, is the weakest lens and counts most in the score. The best first step for the work it takes is making the three tests that check nothing check their results, worth about 3.0 points. Adding an automated build and test pipeline would lift Production Readiness itself, worth about 3.3 points. Raising Production Readiness to 52 would lift the score to about 58.8.
472 known security holes in the packages the code depends on can be used by attackers. Thirty-five automatic updates take new releases before a bad one can be spotted, and three weaknesses in the code could be used by an attacker. Updating the vulnerable packages, setting a waiting period for automatic updates and fixing the weaknesses the scanner points to would close these risks. The two unsafe settings in infrastructure or container files need changing to safe values. The place where the code runs text as code or as a command needs a direct call instead. The three loops of files that import each other need breaking.
The product code is 355,203 lines, about €840,000 to rebuild.
A lens is capped at Adequate while one of its dimensions scores below 4 out of 10, however well the rest of the lens does. That way a serious problem in one place always shows in the lens's rating.
How the score is built: what each lens counts forThe lenses don't count equally. The weakest lens counts most, the next weakest a little less, and so on, so a weak area pulls the score down instead of being averaged away. In the bar below, each part's width shows how much that lens counts and its colour shows its rating. Improving the widest part moves the score most, and as that lens improves, it counts for less, because another lens becomes the weakest.
If Production Readiness rose from 19.0 to 52, the lowest score rated Strong, the score would rise from 43.7 to about 58.8.
Code composition: what the lines of code are
Product code 43%Tests 57%
Rebuild cost: about €840,000 · Estimate
Cost to rebuild
€280,000 to €1,400,000, for 4,630 to 14,688 hours of work, about 5.7 person-years for 3 to 11 engineers
Difficulty of the problem
Standard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor
×0.7 at a score of 44. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
Size
Large: 355,203 lines of product code
What it is not
Not a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.
How the estimate is made: We price the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Resolve the 3 No assertions (empty test) finding(s) in Test Quality — start with quote.spec.ts (3).
Raises the score by about 3.0 points · Low effort · Test Quality
2
Resolve the 1 Test suite executes none of its 6 test cases finding(s) in Test Reliability.
Raises the score by about 3.0 points · Low effort · Test Reliability
3
Add a CI workflow that builds and runs the test suite on every push/PR.
Raises the score by about 3.3 points · Medium effort · CI/CD gates
Diagnosis: what the measurements show together
Each conclusion below combines several dimensions into one point that no single dimension shows, and lists the measurements it rests on.
Where the investment is most exposed · Value at risk
This code would cost about €840,000 to build again, about 5.7 person-years of work. Its weakest lens is Production Readiness, at 19.0 (Critical). Production Readiness is about whether the product is ready to run in production and to change without breaking. Because the weakest lens counts most in the score, work on Production Readiness also moves the score most.
Based on: the rebuild estimate · the Production Readiness grade · how much each lens counts
What to do: Start with the Production Readiness actions in Top priorities.
If you do one thing first · First action
Resolve the 3 No assertions (empty test) finding(s) in Test Quality. Of all the actions in this report, it raises the score most for the work it takes: about 3.0 points for low effort, because it clears the 3 Test Quality findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 7.0 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 3% to 6% on every change. The history of the code shows how much it changes: about 2,767,346 lines over the last 90 days, which is about 11,223,125 lines a year. At that pace, the extra work comes to an estimated 735.3 to 4411.5 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of our own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.
Architecture: which parts of the code depend on which
The code is divided into modules, groups of code that each handle one part of the product, and a module depends on another when it uses code from it. The table lists the modules both down the side and across the top, in an order where each module should only use modules listed above it. A number in a cell means the module on that row uses the module in that column, and it counts the pairs of building blocks (types) that connect them. The one thing to look for is a mark above the diagonal line. It means two or more modules use each other in a loop (a dependency cycle), so none of them can be changed, tested or released on its own.
4465 modules, with 3571 dependencies between them. One loop runs through 6 of the modules, marked above the diagonal.
The table shows the 40 modules with the most connections; 4425 more are left out to keep it readable.
Which modules use which. The module on each row uses the module in each column, and the number counts the pairs of types that connect them. A cell above the diagonal is part of a loop.
2 pairs of types, where a type in experiments.runs.2026-05-08_11-46-55_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.scenario uses a type in experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
experiments.runs.2026-05-08_11-46-55_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.scenario uses experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types, so a change to experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types can break experiments.runs.2026-05-08_11-46-55_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.scenario, while a change to experiments.runs.2026-05-08_11-46-55_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.scenario can't break experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
Position
Below the diagonal: experiments.runs.2026-05-08_11-46-55_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.scenario uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in experiments.runs.2026-05-08_16-04-50_claim-office-example-mapping_v5-exact-single-context_opus-4-7-no-thinking.src.claim-office uses a type in experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
experiments.runs.2026-05-08_16-04-50_claim-office-example-mapping_v5-exact-single-context_opus-4-7-no-thinking.src.claim-office uses experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types, so a change to experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types can break experiments.runs.2026-05-08_16-04-50_claim-office-example-mapping_v5-exact-single-context_opus-4-7-no-thinking.src.claim-office, while a change to experiments.runs.2026-05-08_16-04-50_claim-office-example-mapping_v5-exact-single-context_opus-4-7-no-thinking.src.claim-office can't break experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
Position
Below the diagonal: experiments.runs.2026-05-08_16-04-50_claim-office-example-mapping_v5-exact-single-context_opus-4-7-no-thinking.src.claim-office uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in experiments.runs.2026-05-09_08-45-16_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6.src.types uses a type in experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
experiments.runs.2026-05-09_08-45-16_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6.src.types uses experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types, so a change to experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types can break experiments.runs.2026-05-09_08-45-16_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6.src.types, while a change to experiments.runs.2026-05-09_08-45-16_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6.src.types can't break experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
Position
Below the diagonal: experiments.runs.2026-05-09_08-45-16_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6.src.types uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in experiments.runs.2026-05-09_08-52-55_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6.src.types uses a type in experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
experiments.runs.2026-05-09_08-52-55_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6.src.types uses experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types, so a change to experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types can break experiments.runs.2026-05-09_08-52-55_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6.src.types, while a change to experiments.runs.2026-05-09_08-52-55_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6.src.types can't break experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
Position
Below the diagonal: experiments.runs.2026-05-09_08-52-55_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6.src.types uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in experiments.runs.2026-05-09_09-02-47_claim-office-example-mapping_v3-basic-tdd_haiku-4-5.src.cli uses a type in experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
experiments.runs.2026-05-09_09-02-47_claim-office-example-mapping_v3-basic-tdd_haiku-4-5.src.cli uses experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types, so a change to experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types can break experiments.runs.2026-05-09_09-02-47_claim-office-example-mapping_v3-basic-tdd_haiku-4-5.src.cli, while a change to experiments.runs.2026-05-09_09-02-47_claim-office-example-mapping_v3-basic-tdd_haiku-4-5.src.cli can't break experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
Position
Below the diagonal: experiments.runs.2026-05-09_09-02-47_claim-office-example-mapping_v3-basic-tdd_haiku-4-5.src.cli uses a module listed above it, which is the healthy direction.
3 pairs of types, where a type in experiments.runs.2026-05-09_14-02-30_claim-office-example-mapping_v3-basic-tdd_haiku-4-5-no-thinking.src.types uses a type in experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
experiments.runs.2026-05-09_14-02-30_claim-office-example-mapping_v3-basic-tdd_haiku-4-5-no-thinking.src.types uses experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types, so a change to experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types can break experiments.runs.2026-05-09_14-02-30_claim-office-example-mapping_v3-basic-tdd_haiku-4-5-no-thinking.src.types, while a change to experiments.runs.2026-05-09_14-02-30_claim-office-example-mapping_v3-basic-tdd_haiku-4-5-no-thinking.src.types can't break experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
Position
Below the diagonal: experiments.runs.2026-05-09_14-02-30_claim-office-example-mapping_v3-basic-tdd_haiku-4-5-no-thinking.src.types uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in experiments.runs.2026-05-09_14-12-06_claim-office-example-mapping_v3-basic-tdd_haiku-4-5-no-thinking.src.claim uses a type in experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.claim.
experiments.runs.2026-05-09_14-12-06_claim-office-example-mapping_v3-basic-tdd_haiku-4-5-no-thinking.src.claim uses experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.claim, so a change to experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.claim can break experiments.runs.2026-05-09_14-12-06_claim-office-example-mapping_v3-basic-tdd_haiku-4-5-no-thinking.src.claim, while a change to experiments.runs.2026-05-09_14-12-06_claim-office-example-mapping_v3-basic-tdd_haiku-4-5-no-thinking.src.claim can't break experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.claim.
Position
Below the diagonal: experiments.runs.2026-05-09_14-12-06_claim-office-example-mapping_v3-basic-tdd_haiku-4-5-no-thinking.src.claim uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in experiments.runs.2026-05-09_14-12-06_claim-office-example-mapping_v3-basic-tdd_haiku-4-5-no-thinking.src.quote uses a type in experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
experiments.runs.2026-05-09_14-12-06_claim-office-example-mapping_v3-basic-tdd_haiku-4-5-no-thinking.src.quote uses experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types, so a change to experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types can break experiments.runs.2026-05-09_14-12-06_claim-office-example-mapping_v3-basic-tdd_haiku-4-5-no-thinking.src.quote, while a change to experiments.runs.2026-05-09_14-12-06_claim-office-example-mapping_v3-basic-tdd_haiku-4-5-no-thinking.src.quote can't break experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
Position
Below the diagonal: experiments.runs.2026-05-09_14-12-06_claim-office-example-mapping_v3-basic-tdd_haiku-4-5-no-thinking.src.quote uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in experiments.runs.2026-05-16_09-52-33_claim-office-prose_v2-iterative_opus-4-7-no-thinking.src.types uses a type in experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
experiments.runs.2026-05-16_09-52-33_claim-office-prose_v2-iterative_opus-4-7-no-thinking.src.types uses experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types, so a change to experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types can break experiments.runs.2026-05-16_09-52-33_claim-office-prose_v2-iterative_opus-4-7-no-thinking.src.types, while a change to experiments.runs.2026-05-16_09-52-33_claim-office-prose_v2-iterative_opus-4-7-no-thinking.src.types can't break experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
Position
Below the diagonal: experiments.runs.2026-05-16_09-52-33_claim-office-prose_v2-iterative_opus-4-7-no-thinking.src.types uses a module listed above it, which is the healthy direction.
3 pairs of types, where a type in experiments.runs.2026-05-16_09-56-09_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types uses a type in experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
experiments.runs.2026-05-16_09-56-09_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types uses experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types, so a change to experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types can break experiments.runs.2026-05-16_09-56-09_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types, while a change to experiments.runs.2026-05-16_09-56-09_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types can't break experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
Position
Below the diagonal: experiments.runs.2026-05-16_09-56-09_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in experiments.runs.2026-05-21_08-35-47_claim-office-example-mapping_v4_1-testlist-scope-fix_opus-4-7-no-thinking.src.claim-office uses a type in experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
experiments.runs.2026-05-21_08-35-47_claim-office-example-mapping_v4_1-testlist-scope-fix_opus-4-7-no-thinking.src.claim-office uses experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types, so a change to experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types can break experiments.runs.2026-05-21_08-35-47_claim-office-example-mapping_v4_1-testlist-scope-fix_opus-4-7-no-thinking.src.claim-office, while a change to experiments.runs.2026-05-21_08-35-47_claim-office-example-mapping_v4_1-testlist-scope-fix_opus-4-7-no-thinking.src.claim-office can't break experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
Position
Below the diagonal: experiments.runs.2026-05-21_08-35-47_claim-office-example-mapping_v4_1-testlist-scope-fix_opus-4-7-no-thinking.src.claim-office uses a module listed above it, which is the healthy direction.
3 pairs of types, where a type in experiments.runs.2026-05-25_16-31-57_claim-office-example-mapping_v5_1-testlist-scope-fix-oc_minimax-m2-7.src.claim-office uses a type in experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
experiments.runs.2026-05-25_16-31-57_claim-office-example-mapping_v5_1-testlist-scope-fix-oc_minimax-m2-7.src.claim-office uses experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types, so a change to experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types can break experiments.runs.2026-05-25_16-31-57_claim-office-example-mapping_v5_1-testlist-scope-fix-oc_minimax-m2-7.src.claim-office, while a change to experiments.runs.2026-05-25_16-31-57_claim-office-example-mapping_v5_1-testlist-scope-fix-oc_minimax-m2-7.src.claim-office can't break experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
Position
Below the diagonal: experiments.runs.2026-05-25_16-31-57_claim-office-example-mapping_v5_1-testlist-scope-fix-oc_minimax-m2-7.src.claim-office uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in experiments.runs.2026-05-26_11-19-00_claim-office-example-mapping_v6_2-with-why-cleaned-oc_opus-4-7-portkey-no-thinking.src.claim-office uses a type in experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.claim.
experiments.runs.2026-05-26_11-19-00_claim-office-example-mapping_v6_2-with-why-cleaned-oc_opus-4-7-portkey-no-thinking.src.claim-office uses experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.claim, so a change to experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.claim can break experiments.runs.2026-05-26_11-19-00_claim-office-example-mapping_v6_2-with-why-cleaned-oc_opus-4-7-portkey-no-thinking.src.claim-office, while a change to experiments.runs.2026-05-26_11-19-00_claim-office-example-mapping_v6_2-with-why-cleaned-oc_opus-4-7-portkey-no-thinking.src.claim-office can't break experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.claim.
Position
Below the diagonal: experiments.runs.2026-05-26_11-19-00_claim-office-example-mapping_v6_2-with-why-cleaned-oc_opus-4-7-portkey-no-thinking.src.claim-office uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in experiments.runs.2026-05-26_11-19-00_claim-office-example-mapping_v6_2-with-why-cleaned-oc_opus-4-7-portkey-no-thinking.src.claim-office uses a type in experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
experiments.runs.2026-05-26_11-19-00_claim-office-example-mapping_v6_2-with-why-cleaned-oc_opus-4-7-portkey-no-thinking.src.claim-office uses experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types, so a change to experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types can break experiments.runs.2026-05-26_11-19-00_claim-office-example-mapping_v6_2-with-why-cleaned-oc_opus-4-7-portkey-no-thinking.src.claim-office, while a change to experiments.runs.2026-05-26_11-19-00_claim-office-example-mapping_v6_2-with-why-cleaned-oc_opus-4-7-portkey-no-thinking.src.claim-office can't break experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
Position
Below the diagonal: experiments.runs.2026-05-26_11-19-00_claim-office-example-mapping_v6_2-with-why-cleaned-oc_opus-4-7-portkey-no-thinking.src.claim-office uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in experiments.runs.2026-05-29_21-10-00_claim-office-example-mapping_v6_2-with-why-cleaned_opus-4-8-no-thinking.src.claim-office uses a type in experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
experiments.runs.2026-05-29_21-10-00_claim-office-example-mapping_v6_2-with-why-cleaned_opus-4-8-no-thinking.src.claim-office uses experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types, so a change to experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types can break experiments.runs.2026-05-29_21-10-00_claim-office-example-mapping_v6_2-with-why-cleaned_opus-4-8-no-thinking.src.claim-office, while a change to experiments.runs.2026-05-29_21-10-00_claim-office-example-mapping_v6_2-with-why-cleaned_opus-4-8-no-thinking.src.claim-office can't break experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
Position
Below the diagonal: experiments.runs.2026-05-29_21-10-00_claim-office-example-mapping_v6_2-with-why-cleaned_opus-4-8-no-thinking.src.claim-office uses a module listed above it, which is the healthy direction.
4 pairs of types, where a type in experiments.runs.2026-07-26_09-57-57_claim-office-example-mapping_v4-exact-subagents_opus-5-no-thinking-3.src.claim-office uses a type in experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
experiments.runs.2026-07-26_09-57-57_claim-office-example-mapping_v4-exact-subagents_opus-5-no-thinking-3.src.claim-office uses experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types, so a change to experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types can break experiments.runs.2026-07-26_09-57-57_claim-office-example-mapping_v4-exact-subagents_opus-5-no-thinking-3.src.claim-office, while a change to experiments.runs.2026-07-26_09-57-57_claim-office-example-mapping_v4-exact-subagents_opus-5-no-thinking-3.src.claim-office can't break experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
Position
Below the diagonal: experiments.runs.2026-07-26_09-57-57_claim-office-example-mapping_v4-exact-subagents_opus-5-no-thinking-3.src.claim-office uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in experiments.runs.2026-08-05_06-44-10_claim-office-example-mapping_v6_2_1-phase-continuation-pi_opus-5-requesty-no-thinking-3.src.claim-office uses a type in experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
experiments.runs.2026-08-05_06-44-10_claim-office-example-mapping_v6_2_1-phase-continuation-pi_opus-5-requesty-no-thinking-3.src.claim-office uses experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types, so a change to experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types can break experiments.runs.2026-08-05_06-44-10_claim-office-example-mapping_v6_2_1-phase-continuation-pi_opus-5-requesty-no-thinking-3.src.claim-office, while a change to experiments.runs.2026-08-05_06-44-10_claim-office-example-mapping_v6_2_1-phase-continuation-pi_opus-5-requesty-no-thinking-3.src.claim-office can't break experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
Position
Below the diagonal: experiments.runs.2026-08-05_06-44-10_claim-office-example-mapping_v6_2_1-phase-continuation-pi_opus-5-requesty-no-thinking-3.src.claim-office uses a module listed above it, which is the healthy direction.
5 pairs of types, where a type in experiments.runs.2026-08-10_17-18-21_claim-office-example-mapping_v6_1-hybrid-testlist-scope-fix_opus-5-no-thinking.src.claim-office uses a type in experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
experiments.runs.2026-08-10_17-18-21_claim-office-example-mapping_v6_1-hybrid-testlist-scope-fix_opus-5-no-thinking.src.claim-office uses experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types, so a change to experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types can break experiments.runs.2026-08-10_17-18-21_claim-office-example-mapping_v6_1-hybrid-testlist-scope-fix_opus-5-no-thinking.src.claim-office, while a change to experiments.runs.2026-08-10_17-18-21_claim-office-example-mapping_v6_1-hybrid-testlist-scope-fix_opus-5-no-thinking.src.claim-office can't break experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
Position
Below the diagonal: experiments.runs.2026-08-10_17-18-21_claim-office-example-mapping_v6_1-hybrid-testlist-scope-fix_opus-5-no-thinking.src.claim-office uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in experiments.runs.2026-08-10_19-39-03_claim-office-example-mapping_v6_6-lab-split-cc_opus-5-no-thinking.src.coverage uses a type in experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
experiments.runs.2026-08-10_19-39-03_claim-office-example-mapping_v6_6-lab-split-cc_opus-5-no-thinking.src.coverage uses experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types, so a change to experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types can break experiments.runs.2026-08-10_19-39-03_claim-office-example-mapping_v6_6-lab-split-cc_opus-5-no-thinking.src.coverage, while a change to experiments.runs.2026-08-10_19-39-03_claim-office-example-mapping_v6_6-lab-split-cc_opus-5-no-thinking.src.coverage can't break experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
Position
Below the diagonal: experiments.runs.2026-08-10_19-39-03_claim-office-example-mapping_v6_6-lab-split-cc_opus-5-no-thinking.src.coverage uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in experiments.runs.2026-08-11_10-50-42_claim-office-prose_v6_6-lab-split-cc_opus-5-no-thinking.src.claim-office uses a type in experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.claim.
experiments.runs.2026-08-11_10-50-42_claim-office-prose_v6_6-lab-split-cc_opus-5-no-thinking.src.claim-office uses experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.claim, so a change to experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.claim can break experiments.runs.2026-08-11_10-50-42_claim-office-prose_v6_6-lab-split-cc_opus-5-no-thinking.src.claim-office, while a change to experiments.runs.2026-08-11_10-50-42_claim-office-prose_v6_6-lab-split-cc_opus-5-no-thinking.src.claim-office can't break experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.claim.
Position
Below the diagonal: experiments.runs.2026-08-11_10-50-42_claim-office-prose_v6_6-lab-split-cc_opus-5-no-thinking.src.claim-office uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in experiments.runs.2026-08-11_10-50-42_claim-office-prose_v6_6-lab-split-cc_opus-5-no-thinking.src.claim-office uses a type in experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
experiments.runs.2026-08-11_10-50-42_claim-office-prose_v6_6-lab-split-cc_opus-5-no-thinking.src.claim-office uses experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types, so a change to experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types can break experiments.runs.2026-08-11_10-50-42_claim-office-prose_v6_6-lab-split-cc_opus-5-no-thinking.src.claim-office, while a change to experiments.runs.2026-08-11_10-50-42_claim-office-prose_v6_6-lab-split-cc_opus-5-no-thinking.src.claim-office can't break experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
Position
Below the diagonal: experiments.runs.2026-08-11_10-50-42_claim-office-prose_v6_6-lab-split-cc_opus-5-no-thinking.src.claim-office uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in experiments.runs.2026-10-01_07-41-26_claim-office-example-mapping_exact-ptdd-v1_1-refactor-subagent-cc_opus-5-5-no-thinking.src.claim-settlement uses a type in experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
experiments.runs.2026-10-01_07-41-26_claim-office-example-mapping_exact-ptdd-v1_1-refactor-subagent-cc_opus-5-5-no-thinking.src.claim-settlement uses experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types, so a change to experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types can break experiments.runs.2026-10-01_07-41-26_claim-office-example-mapping_exact-ptdd-v1_1-refactor-subagent-cc_opus-5-5-no-thinking.src.claim-settlement, while a change to experiments.runs.2026-10-01_07-41-26_claim-office-example-mapping_exact-ptdd-v1_1-refactor-subagent-cc_opus-5-5-no-thinking.src.claim-settlement can't break experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
Position
Below the diagonal: experiments.runs.2026-10-01_07-41-26_claim-office-example-mapping_exact-ptdd-v1_1-refactor-subagent-cc_opus-5-5-no-thinking.src.claim-settlement uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src uses a type in experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.claim.
experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src uses experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.claim, so a change to experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.claim can break experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src, while a change to experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src can't break experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.claim.
Position
Below the diagonal: experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src uses a type in experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src uses experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types, so a change to experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types can break experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src, while a change to experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src can't break experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
Position
Below the diagonal: experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src uses a type in experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src.quote.
experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src uses experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src.quote, so a change to experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src.quote can break experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src, while a change to experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src can't break experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src.quote.
Position
Below the diagonal: experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src uses a type in experiments.runs.2026-05-08_11-46-55_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.scenario.
experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src uses experiments.runs.2026-05-08_11-46-55_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.scenario, so a change to experiments.runs.2026-05-08_11-46-55_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.scenario can break experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src, while a change to experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src can't break experiments.runs.2026-05-08_11-46-55_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.scenario.
Position
Below the diagonal: experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src uses a type in experiments.runs.2026-05-09_08-45-16_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6.src.types.
experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src uses experiments.runs.2026-05-09_08-45-16_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6.src.types, so a change to experiments.runs.2026-05-09_08-45-16_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6.src.types can break experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src, while a change to experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src can't break experiments.runs.2026-05-09_08-45-16_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6.src.types.
Position
Below the diagonal: experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src uses a type in experiments.runs.2026-05-09_08-52-55_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6.src.types.
experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src uses experiments.runs.2026-05-09_08-52-55_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6.src.types, so a change to experiments.runs.2026-05-09_08-52-55_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6.src.types can break experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src, while a change to experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src can't break experiments.runs.2026-05-09_08-52-55_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6.src.types.
Position
Below the diagonal: experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in experiments.runs.2026-07-25_01-23-55_claim-office-example-mapping_v6_2-with-why-cleaned-pi_minimax-m3-no-thinking-2.src uses a type in experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.claim.
experiments.runs.2026-07-25_01-23-55_claim-office-example-mapping_v6_2-with-why-cleaned-pi_minimax-m3-no-thinking-2.src uses experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.claim, so a change to experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.claim can break experiments.runs.2026-07-25_01-23-55_claim-office-example-mapping_v6_2-with-why-cleaned-pi_minimax-m3-no-thinking-2.src, while a change to experiments.runs.2026-07-25_01-23-55_claim-office-example-mapping_v6_2-with-why-cleaned-pi_minimax-m3-no-thinking-2.src can't break experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.claim.
Position
Below the diagonal: experiments.runs.2026-07-25_01-23-55_claim-office-example-mapping_v6_2-with-why-cleaned-pi_minimax-m3-no-thinking-2.src uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in experiments.runs.2026-07-25_01-23-55_claim-office-example-mapping_v6_2-with-why-cleaned-pi_minimax-m3-no-thinking-2.src uses a type in experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
experiments.runs.2026-07-25_01-23-55_claim-office-example-mapping_v6_2-with-why-cleaned-pi_minimax-m3-no-thinking-2.src uses experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types, so a change to experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types can break experiments.runs.2026-07-25_01-23-55_claim-office-example-mapping_v6_2-with-why-cleaned-pi_minimax-m3-no-thinking-2.src, while a change to experiments.runs.2026-07-25_01-23-55_claim-office-example-mapping_v6_2-with-why-cleaned-pi_minimax-m3-no-thinking-2.src can't break experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
Position
Below the diagonal: experiments.runs.2026-07-25_01-23-55_claim-office-example-mapping_v6_2-with-why-cleaned-pi_minimax-m3-no-thinking-2.src uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in experiments.runs.2026-07-25_01-23-55_claim-office-example-mapping_v6_2-with-why-cleaned-pi_minimax-m3-no-thinking-2.src uses a type in experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src.quote.
experiments.runs.2026-07-25_01-23-55_claim-office-example-mapping_v6_2-with-why-cleaned-pi_minimax-m3-no-thinking-2.src uses experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src.quote, so a change to experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src.quote can break experiments.runs.2026-07-25_01-23-55_claim-office-example-mapping_v6_2-with-why-cleaned-pi_minimax-m3-no-thinking-2.src, while a change to experiments.runs.2026-07-25_01-23-55_claim-office-example-mapping_v6_2-with-why-cleaned-pi_minimax-m3-no-thinking-2.src can't break experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src.quote.
Position
Below the diagonal: experiments.runs.2026-07-25_01-23-55_claim-office-example-mapping_v6_2-with-why-cleaned-pi_minimax-m3-no-thinking-2.src uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in experiments.runs.2026-07-25_01-23-55_claim-office-example-mapping_v6_2-with-why-cleaned-pi_minimax-m3-no-thinking-2.src uses a type in experiments.runs.2026-05-08_11-46-55_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.scenario.
experiments.runs.2026-07-25_01-23-55_claim-office-example-mapping_v6_2-with-why-cleaned-pi_minimax-m3-no-thinking-2.src uses experiments.runs.2026-05-08_11-46-55_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.scenario, so a change to experiments.runs.2026-05-08_11-46-55_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.scenario can break experiments.runs.2026-07-25_01-23-55_claim-office-example-mapping_v6_2-with-why-cleaned-pi_minimax-m3-no-thinking-2.src, while a change to experiments.runs.2026-07-25_01-23-55_claim-office-example-mapping_v6_2-with-why-cleaned-pi_minimax-m3-no-thinking-2.src can't break experiments.runs.2026-05-08_11-46-55_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.scenario.
Position
Below the diagonal: experiments.runs.2026-07-25_01-23-55_claim-office-example-mapping_v6_2-with-why-cleaned-pi_minimax-m3-no-thinking-2.src uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in experiments.runs.2026-07-25_01-23-55_claim-office-example-mapping_v6_2-with-why-cleaned-pi_minimax-m3-no-thinking-2.src uses a type in experiments.runs.2026-05-09_08-52-55_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6.src.types.
experiments.runs.2026-07-25_01-23-55_claim-office-example-mapping_v6_2-with-why-cleaned-pi_minimax-m3-no-thinking-2.src uses experiments.runs.2026-05-09_08-52-55_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6.src.types, so a change to experiments.runs.2026-05-09_08-52-55_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6.src.types can break experiments.runs.2026-07-25_01-23-55_claim-office-example-mapping_v6_2-with-why-cleaned-pi_minimax-m3-no-thinking-2.src, while a change to experiments.runs.2026-07-25_01-23-55_claim-office-example-mapping_v6_2-with-why-cleaned-pi_minimax-m3-no-thinking-2.src can't break experiments.runs.2026-05-09_08-52-55_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6.src.types.
Position
Below the diagonal: experiments.runs.2026-07-25_01-23-55_claim-office-example-mapping_v6_2-with-why-cleaned-pi_minimax-m3-no-thinking-2.src uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in experiments.runs.2026-07-25_01-23-55_claim-office-example-mapping_v6_2-with-why-cleaned-pi_minimax-m3-no-thinking-2.src uses a type in experiments.runs.2026-05-09_14-12-06_claim-office-example-mapping_v3-basic-tdd_haiku-4-5-no-thinking.src.claim.
experiments.runs.2026-07-25_01-23-55_claim-office-example-mapping_v6_2-with-why-cleaned-pi_minimax-m3-no-thinking-2.src uses experiments.runs.2026-05-09_14-12-06_claim-office-example-mapping_v3-basic-tdd_haiku-4-5-no-thinking.src.claim, so a change to experiments.runs.2026-05-09_14-12-06_claim-office-example-mapping_v3-basic-tdd_haiku-4-5-no-thinking.src.claim can break experiments.runs.2026-07-25_01-23-55_claim-office-example-mapping_v6_2-with-why-cleaned-pi_minimax-m3-no-thinking-2.src, while a change to experiments.runs.2026-07-25_01-23-55_claim-office-example-mapping_v6_2-with-why-cleaned-pi_minimax-m3-no-thinking-2.src can't break experiments.runs.2026-05-09_14-12-06_claim-office-example-mapping_v3-basic-tdd_haiku-4-5-no-thinking.src.claim.
Position
Below the diagonal: experiments.runs.2026-07-25_01-23-55_claim-office-example-mapping_v6_2-with-why-cleaned-pi_minimax-m3-no-thinking-2.src uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in experiments.runs.2026-08-11_01-07-01_claim-office-example-mapping_v6_6-lab-split-cc_opus-5-no-thinking.src.claim-office uses a type in experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.claim.
experiments.runs.2026-08-11_01-07-01_claim-office-example-mapping_v6_6-lab-split-cc_opus-5-no-thinking.src.claim-office uses experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.claim, so a change to experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.claim can break experiments.runs.2026-08-11_01-07-01_claim-office-example-mapping_v6_6-lab-split-cc_opus-5-no-thinking.src.claim-office, while a change to experiments.runs.2026-08-11_01-07-01_claim-office-example-mapping_v6_6-lab-split-cc_opus-5-no-thinking.src.claim-office can't break experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.claim.
Position
Below the diagonal: experiments.runs.2026-08-11_01-07-01_claim-office-example-mapping_v6_6-lab-split-cc_opus-5-no-thinking.src.claim-office uses a module listed above it, which is the healthy direction.
3 pairs of types, where a type in experiments.runs.2026-08-11_01-07-01_claim-office-example-mapping_v6_6-lab-split-cc_opus-5-no-thinking.src.claim-office uses a type in experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
experiments.runs.2026-08-11_01-07-01_claim-office-example-mapping_v6_6-lab-split-cc_opus-5-no-thinking.src.claim-office uses experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types, so a change to experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types can break experiments.runs.2026-08-11_01-07-01_claim-office-example-mapping_v6_6-lab-split-cc_opus-5-no-thinking.src.claim-office, while a change to experiments.runs.2026-08-11_01-07-01_claim-office-example-mapping_v6_6-lab-split-cc_opus-5-no-thinking.src.claim-office can't break experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
Position
Below the diagonal: experiments.runs.2026-08-11_01-07-01_claim-office-example-mapping_v6_6-lab-split-cc_opus-5-no-thinking.src.claim-office uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in experiments.runs.2026-08-11_01-07-01_claim-office-example-mapping_v6_6-lab-split-cc_opus-5-no-thinking.src.claim-office uses a type in experiments.runs.2026-05-26_11-19-00_claim-office-example-mapping_v6_2-with-why-cleaned-oc_opus-4-7-portkey-no-thinking.src.claim-office.
experiments.runs.2026-08-11_01-07-01_claim-office-example-mapping_v6_6-lab-split-cc_opus-5-no-thinking.src.claim-office uses experiments.runs.2026-05-26_11-19-00_claim-office-example-mapping_v6_2-with-why-cleaned-oc_opus-4-7-portkey-no-thinking.src.claim-office, so a change to experiments.runs.2026-05-26_11-19-00_claim-office-example-mapping_v6_2-with-why-cleaned-oc_opus-4-7-portkey-no-thinking.src.claim-office can break experiments.runs.2026-08-11_01-07-01_claim-office-example-mapping_v6_6-lab-split-cc_opus-5-no-thinking.src.claim-office, while a change to experiments.runs.2026-08-11_01-07-01_claim-office-example-mapping_v6_6-lab-split-cc_opus-5-no-thinking.src.claim-office can't break experiments.runs.2026-05-26_11-19-00_claim-office-example-mapping_v6_2-with-why-cleaned-oc_opus-4-7-portkey-no-thinking.src.claim-office.
Position
Below the diagonal: experiments.runs.2026-08-11_01-07-01_claim-office-example-mapping_v6_6-lab-split-cc_opus-5-no-thinking.src.claim-office uses a module listed above it, which is the healthy direction.
4 pairs of types, where a type in experiments.runs.2026-08-17_06-39-23_claim-office-example-mapping_v3-basic-tdd_opus-4-8-no-thinking-4.src uses a type in experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
experiments.runs.2026-08-17_06-39-23_claim-office-example-mapping_v3-basic-tdd_opus-4-8-no-thinking-4.src uses experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types, so a change to experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types can break experiments.runs.2026-08-17_06-39-23_claim-office-example-mapping_v3-basic-tdd_opus-4-8-no-thinking-4.src, while a change to experiments.runs.2026-08-17_06-39-23_claim-office-example-mapping_v3-basic-tdd_opus-4-8-no-thinking-4.src can't break experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
Position
Below the diagonal: experiments.runs.2026-08-17_06-39-23_claim-office-example-mapping_v3-basic-tdd_opus-4-8-no-thinking-4.src uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in experiments.runs.2026-08-17_06-39-23_claim-office-example-mapping_v3-basic-tdd_opus-4-8-no-thinking-4.src uses a type in experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src.quote.
experiments.runs.2026-08-17_06-39-23_claim-office-example-mapping_v3-basic-tdd_opus-4-8-no-thinking-4.src uses experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src.quote, so a change to experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src.quote can break experiments.runs.2026-08-17_06-39-23_claim-office-example-mapping_v3-basic-tdd_opus-4-8-no-thinking-4.src, while a change to experiments.runs.2026-08-17_06-39-23_claim-office-example-mapping_v3-basic-tdd_opus-4-8-no-thinking-4.src can't break experiments.runs.2026-05-09_14-18-07_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking.src.quote.
Position
Below the diagonal: experiments.runs.2026-08-17_06-39-23_claim-office-example-mapping_v3-basic-tdd_opus-4-8-no-thinking-4.src uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in experiments.runs.2026-08-17_06-39-23_claim-office-example-mapping_v3-basic-tdd_opus-4-8-no-thinking-4.src uses a type in experiments.runs.2026-05-08_11-46-55_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.scenario.
experiments.runs.2026-08-17_06-39-23_claim-office-example-mapping_v3-basic-tdd_opus-4-8-no-thinking-4.src uses experiments.runs.2026-05-08_11-46-55_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.scenario, so a change to experiments.runs.2026-05-08_11-46-55_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.scenario can break experiments.runs.2026-08-17_06-39-23_claim-office-example-mapping_v3-basic-tdd_opus-4-8-no-thinking-4.src, while a change to experiments.runs.2026-08-17_06-39-23_claim-office-example-mapping_v3-basic-tdd_opus-4-8-no-thinking-4.src can't break experiments.runs.2026-05-08_11-46-55_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.scenario.
Position
Below the diagonal: experiments.runs.2026-08-17_06-39-23_claim-office-example-mapping_v3-basic-tdd_opus-4-8-no-thinking-4.src uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in experiments.runs.2026-08-17_06-39-23_claim-office-example-mapping_v3-basic-tdd_opus-4-8-no-thinking-4.src uses a type in experiments.runs.2026-05-08_16-04-50_claim-office-example-mapping_v5-exact-single-context_opus-4-7-no-thinking.src.claim-office.
experiments.runs.2026-08-17_06-39-23_claim-office-example-mapping_v3-basic-tdd_opus-4-8-no-thinking-4.src uses experiments.runs.2026-05-08_16-04-50_claim-office-example-mapping_v5-exact-single-context_opus-4-7-no-thinking.src.claim-office, so a change to experiments.runs.2026-05-08_16-04-50_claim-office-example-mapping_v5-exact-single-context_opus-4-7-no-thinking.src.claim-office can break experiments.runs.2026-08-17_06-39-23_claim-office-example-mapping_v3-basic-tdd_opus-4-8-no-thinking-4.src, while a change to experiments.runs.2026-08-17_06-39-23_claim-office-example-mapping_v3-basic-tdd_opus-4-8-no-thinking-4.src can't break experiments.runs.2026-05-08_16-04-50_claim-office-example-mapping_v5-exact-single-context_opus-4-7-no-thinking.src.claim-office.
Position
Below the diagonal: experiments.runs.2026-08-17_06-39-23_claim-office-example-mapping_v3-basic-tdd_opus-4-8-no-thinking-4.src uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in experiments.runs.2026-08-17_06-39-23_claim-office-example-mapping_v3-basic-tdd_opus-4-8-no-thinking-4.src uses a type in experiments.runs.2026-05-25_16-31-57_claim-office-example-mapping_v5_1-testlist-scope-fix-oc_minimax-m2-7.src.claim-office.
experiments.runs.2026-08-17_06-39-23_claim-office-example-mapping_v3-basic-tdd_opus-4-8-no-thinking-4.src uses experiments.runs.2026-05-25_16-31-57_claim-office-example-mapping_v5_1-testlist-scope-fix-oc_minimax-m2-7.src.claim-office, so a change to experiments.runs.2026-05-25_16-31-57_claim-office-example-mapping_v5_1-testlist-scope-fix-oc_minimax-m2-7.src.claim-office can break experiments.runs.2026-08-17_06-39-23_claim-office-example-mapping_v3-basic-tdd_opus-4-8-no-thinking-4.src, while a change to experiments.runs.2026-08-17_06-39-23_claim-office-example-mapping_v3-basic-tdd_opus-4-8-no-thinking-4.src can't break experiments.runs.2026-05-25_16-31-57_claim-office-example-mapping_v5_1-testlist-scope-fix-oc_minimax-m2-7.src.claim-office.
Position
Below the diagonal: experiments.runs.2026-08-17_06-39-23_claim-office-example-mapping_v3-basic-tdd_opus-4-8-no-thinking-4.src uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in experiments.runs.2026-09-03_23-16-54_claim-office-example-mapping_v6_1_1-lab-split-cc_opus-5-no-thinking.src.claim-office uses a type in experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.claim.
experiments.runs.2026-09-03_23-16-54_claim-office-example-mapping_v6_1_1-lab-split-cc_opus-5-no-thinking.src.claim-office uses experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.claim, so a change to experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.claim can break experiments.runs.2026-09-03_23-16-54_claim-office-example-mapping_v6_1_1-lab-split-cc_opus-5-no-thinking.src.claim-office, while a change to experiments.runs.2026-09-03_23-16-54_claim-office-example-mapping_v6_1_1-lab-split-cc_opus-5-no-thinking.src.claim-office can't break experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.claim.
Position
Below the diagonal: experiments.runs.2026-09-03_23-16-54_claim-office-example-mapping_v6_1_1-lab-split-cc_opus-5-no-thinking.src.claim-office uses a module listed above it, which is the healthy direction.
6 pairs of types, where a type in experiments.runs.2026-09-03_23-16-54_claim-office-example-mapping_v6_1_1-lab-split-cc_opus-5-no-thinking.src.claim-office uses a type in experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
experiments.runs.2026-09-03_23-16-54_claim-office-example-mapping_v6_1_1-lab-split-cc_opus-5-no-thinking.src.claim-office uses experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types, so a change to experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types can break experiments.runs.2026-09-03_23-16-54_claim-office-example-mapping_v6_1_1-lab-split-cc_opus-5-no-thinking.src.claim-office, while a change to experiments.runs.2026-09-03_23-16-54_claim-office-example-mapping_v6_1_1-lab-split-cc_opus-5-no-thinking.src.claim-office can't break experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
Position
Below the diagonal: experiments.runs.2026-09-03_23-16-54_claim-office-example-mapping_v6_1_1-lab-split-cc_opus-5-no-thinking.src.claim-office uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in experiments.runs.2026-09-03_23-16-54_claim-office-example-mapping_v6_1_1-lab-split-cc_opus-5-no-thinking.src.claim-office uses a type in experiments.runs.2026-08-10_17-18-21_claim-office-example-mapping_v6_1-hybrid-testlist-scope-fix_opus-5-no-thinking.src.claim-office.
experiments.runs.2026-09-03_23-16-54_claim-office-example-mapping_v6_1_1-lab-split-cc_opus-5-no-thinking.src.claim-office uses experiments.runs.2026-08-10_17-18-21_claim-office-example-mapping_v6_1-hybrid-testlist-scope-fix_opus-5-no-thinking.src.claim-office, so a change to experiments.runs.2026-08-10_17-18-21_claim-office-example-mapping_v6_1-hybrid-testlist-scope-fix_opus-5-no-thinking.src.claim-office can break experiments.runs.2026-09-03_23-16-54_claim-office-example-mapping_v6_1_1-lab-split-cc_opus-5-no-thinking.src.claim-office, while a change to experiments.runs.2026-09-03_23-16-54_claim-office-example-mapping_v6_1_1-lab-split-cc_opus-5-no-thinking.src.claim-office can't break experiments.runs.2026-08-10_17-18-21_claim-office-example-mapping_v6_1-hybrid-testlist-scope-fix_opus-5-no-thinking.src.claim-office.
Position
Below the diagonal: experiments.runs.2026-09-03_23-16-54_claim-office-example-mapping_v6_1_1-lab-split-cc_opus-5-no-thinking.src.claim-office uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in experiments.runs.2026-09-04_23-11-22_claim-office-example-mapping_v6_1-hybrid-testlist-scope-fix_opus-5-no-thinking-4.src.claim-office uses a type in experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.claim.
experiments.runs.2026-09-04_23-11-22_claim-office-example-mapping_v6_1-hybrid-testlist-scope-fix_opus-5-no-thinking-4.src.claim-office uses experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.claim, so a change to experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.claim can break experiments.runs.2026-09-04_23-11-22_claim-office-example-mapping_v6_1-hybrid-testlist-scope-fix_opus-5-no-thinking-4.src.claim-office, while a change to experiments.runs.2026-09-04_23-11-22_claim-office-example-mapping_v6_1-hybrid-testlist-scope-fix_opus-5-no-thinking-4.src.claim-office can't break experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.claim.
Position
Below the diagonal: experiments.runs.2026-09-04_23-11-22_claim-office-example-mapping_v6_1-hybrid-testlist-scope-fix_opus-5-no-thinking-4.src.claim-office uses a module listed above it, which is the healthy direction.
5 pairs of types, where a type in experiments.runs.2026-09-04_23-11-22_claim-office-example-mapping_v6_1-hybrid-testlist-scope-fix_opus-5-no-thinking-4.src.claim-office uses a type in experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
experiments.runs.2026-09-04_23-11-22_claim-office-example-mapping_v6_1-hybrid-testlist-scope-fix_opus-5-no-thinking-4.src.claim-office uses experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types, so a change to experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types can break experiments.runs.2026-09-04_23-11-22_claim-office-example-mapping_v6_1-hybrid-testlist-scope-fix_opus-5-no-thinking-4.src.claim-office, while a change to experiments.runs.2026-09-04_23-11-22_claim-office-example-mapping_v6_1-hybrid-testlist-scope-fix_opus-5-no-thinking-4.src.claim-office can't break experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.
Position
Below the diagonal: experiments.runs.2026-09-04_23-11-22_claim-office-example-mapping_v6_1-hybrid-testlist-scope-fix_opus-5-no-thinking-4.src.claim-office uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in experiments.runs.2026-09-04_23-11-22_claim-office-example-mapping_v6_1-hybrid-testlist-scope-fix_opus-5-no-thinking-4.src.claim-office uses a type in experiments.runs.2026-05-08_15-43-45_claim-office-example-mapping_v5-exact-single-context_opus-4-7-no-thinking.src.claim-office.
experiments.runs.2026-09-04_23-11-22_claim-office-example-mapping_v6_1-hybrid-testlist-scope-fix_opus-5-no-thinking-4.src.claim-office uses experiments.runs.2026-05-08_15-43-45_claim-office-example-mapping_v5-exact-single-context_opus-4-7-no-thinking.src.claim-office, so a change to experiments.runs.2026-05-08_15-43-45_claim-office-example-mapping_v5-exact-single-context_opus-4-7-no-thinking.src.claim-office can break experiments.runs.2026-09-04_23-11-22_claim-office-example-mapping_v6_1-hybrid-testlist-scope-fix_opus-5-no-thinking-4.src.claim-office, while a change to experiments.runs.2026-09-04_23-11-22_claim-office-example-mapping_v6_1-hybrid-testlist-scope-fix_opus-5-no-thinking-4.src.claim-office can't break experiments.runs.2026-05-08_15-43-45_claim-office-example-mapping_v5-exact-single-context_opus-4-7-no-thinking.src.claim-office.
Position
Below the diagonal: experiments.runs.2026-09-04_23-11-22_claim-office-example-mapping_v6_1-hybrid-testlist-scope-fix_opus-5-no-thinking-4.src.claim-office uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in experiments.runs.2026-09-04_23-11-22_claim-office-example-mapping_v6_1-hybrid-testlist-scope-fix_opus-5-no-thinking-4.src.claim-office uses a type in experiments.runs.2026-05-26_11-19-00_claim-office-example-mapping_v6_2-with-why-cleaned-oc_opus-4-7-portkey-no-thinking.src.claim-office.
experiments.runs.2026-09-04_23-11-22_claim-office-example-mapping_v6_1-hybrid-testlist-scope-fix_opus-5-no-thinking-4.src.claim-office uses experiments.runs.2026-05-26_11-19-00_claim-office-example-mapping_v6_2-with-why-cleaned-oc_opus-4-7-portkey-no-thinking.src.claim-office, so a change to experiments.runs.2026-05-26_11-19-00_claim-office-example-mapping_v6_2-with-why-cleaned-oc_opus-4-7-portkey-no-thinking.src.claim-office can break experiments.runs.2026-09-04_23-11-22_claim-office-example-mapping_v6_1-hybrid-testlist-scope-fix_opus-5-no-thinking-4.src.claim-office, while a change to experiments.runs.2026-09-04_23-11-22_claim-office-example-mapping_v6_1-hybrid-testlist-scope-fix_opus-5-no-thinking-4.src.claim-office can't break experiments.runs.2026-05-26_11-19-00_claim-office-example-mapping_v6_2-with-why-cleaned-oc_opus-4-7-portkey-no-thinking.src.claim-office.
Position
Below the diagonal: experiments.runs.2026-09-04_23-11-22_claim-office-example-mapping_v6_1-hybrid-testlist-scope-fix_opus-5-no-thinking-4.src.claim-office uses a module listed above it, which is the healthy direction.
At a glance — Code Health · 58.5 · Adequate · gated by D2, R10 ·
Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).
OWASP category
Findings
Severity
A03:2025 — Software Supply Chain Failures
743
High / Critical
A05:2025 — Injection
45
High / Critical
A02:2025 — Security Misconfiguration
8
High / Critical
Roadmap
Top priorities: Add a CI workflow that builds and runs the test suite on every push/PR; Adopt pino (or winston) and log at meaningful points in the services you run; Resolve the 1 finding(s) in DR & Backup.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Resolve the 3 No assertions (empty test) finding(s) in Test Quality — start with quote.spec.ts (3).
Your ecosystem's static analyzer is declared as a dependency but is not wired into CI — run it as a required step on push/PR (e.g. `composer phpstan` / `mix sobelow` / `bundle exec brakeman` / the spotbugs Gradle task / `sbt scalafixAll --check` / `golangci-lint run` / `rebar3 lint`) so a regression fails the build instead of relying on someone running it locally.
Act on each finding's own remediation rather than one rule: the move depends on what recurs. Where the copies are executable blocks, give the shared part one home and call it from each site; where they are declarations, a listing, a specialisation already delegating to its base, or one shape repeated per entity, there is no call site and the move is a shared type, a generated set or a factory — sometimes there is nothing to extract.
Every finding carries one of four grades. Three say how serious it is. The fourth says this
survey could not settle it — and it is a grade, not a gap.
Critical — 520
A definite problem that already costs you something and drags the score down: a
missing authorisation check, a dependency with a known exploit, a build that does not reproduce. Failure here
tends to cause failures elsewhere.
Serious — 943
Likely wrong, but not failing yet. It degrades
the codebase over a longer horizon and can cause failures elsewhere — not urgent this week, not something to
carry for two years either.
Minor — 2480
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 12
Something this survey could not settle
from the outside, and which could be critical or serious. Either a control was required and no
positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves
nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean
result. These are excluded from the score rather than awarded a pass, so the number on the cover neither
rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each
one is named under Limitations.
Methodology & how to trust this report
This survey is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. All 71 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.9, the weighted average across measured dimensions.
Every figure here is one of two kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10.
What we checked — 71 dimensions across the health lenses
Each chip is a dimension scored from real signals across architecture, testing, dependencies, security & compliance, documentation, git-history and code quality — in one coherent pass. A surface report typically covers a handful.
How to trust any code-health report — three questions
Can you open the finding? Real findings cite a repo-relative file and line you can open at the cited line — never an absolute scratch path. Here, 3934 of 3943 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it: Roslyn, git or a scanner, not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
This report answers yes to all three. That's the bar to hold any assessment to.
Tools & methods
The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.
D10 Test Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The 47,843 test(s) behind this row are the ones the JavaScript/TypeScript census could read, and this repository also carries at least 269 test source file(s) (.py, .java, .rs) that it cannot: it reads JavaScript/TypeScript test declarations off disk, so a JUnit/pytest-style suite is invisible to it. Skipped tests, zero-assertion tests and the other quality signals on this row are UNMEASURED in that suite — their absence from the counts above is a gap in this analyzer's language coverage, not a finding that those tests are sound.
D12 Dependency Hygiene — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Not scored — a Maven build resolved 11 artifact(s) (9 behind a shipped release, reported), but the build resolved only part of the graph, so this dimension's own question is only partly answered. NOT a finding that these dependencies are current or healthy.
D14 License Compliance — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares a Python REDACTED/requirements.txt (pip/uv/Poetry), but the licence verdict published here was taken over its crate dependencies. Nothing was read about its Python dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
D14 License Compliance — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares package.json, but the licence verdict published here was taken over its crate dependencies. Nothing was read about its npm dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
D16 Bus Factor — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. Single-maintainer repository — bus factor is not applicable (2 contributor(s) across 752 commit(s) sampled, automation and bot accounts excluded). One of them holds 100% of the history; the other 1 hold 0% each on average, below the 5% at which there is somebody to hand the work to. That is a single maintainer with drive-by contributors, not a team whose knowledge has concentrated — so the bus factor is not applicable and there is nothing here for the owner to act on.
D19 Documentation Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Each ecosystem's manifests (what makes a folder runnable or a published package) need their own proof before D19 judges its units. Until then those folders' READMEs are judged only as documents (boilerplate, structure), never counted as complete.
D21 Naming Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D21's naming rules read C# through Roslyn and every other language through its sidecar model; these languages are left out (PHP's reading is its own change, a Roslyn-loaded VB or F# project has no population builder yet). Their declarations carry no naming verdict this run — this says nothing about whether their names are consistent.
D22 Internal API Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22's deterministic call-shape rules are gated per language (docs/plans/deterministic-engine.md, P5; C# and each NeutralApiArms arm pass): each other language is switched on only after its own concept suite and A/B gate pass. This says nothing about whether that surface is consistent.
D24 Comment Value — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Each source language's comment syntax, and the code a comment annotates in it, needs its own proof before D24 judges it. Until then those comments are left unread, not counted as clean.
D28 Secrets (history) — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `gitleaks` TIMED OUT after 146.1s against a 146.1s budget, so we killed its process tree. The budget is ours; the work may simply be larger than it allows. Nothing about this repository is asserted by the absence of a result; the budget is ours to raise, and raising it is our backlog item, not an action for this repository's owner.
D32 Data Compliance (PII/GDPR) — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `experiments/runs/2026-05-12_04-33-35_claim-office-prose_v5-exact-single-context_sonnet-4-6-portkey-no-thinking/bin/claim-office.js`, `misc/qwen3-tampering-2026-08-05/refactor.js` produced a parse error, so every rule in this engine's `gdpr.yml` was absent there. That absence is NOT a clean result: these rules detect personal data crossing a boundary into a log sink, a URL or browser storage, and a file that was never parsed cannot report any of the three. The rest of the tree analysed normally and its rows above stand; only these files are unaccounted for. You can widen what we reach: fix the syntax error (or exclude the file deliberately) and re-scan to cover it.
D34 Knowledge Freshness — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. File-level freshness contradicts repo activity: 292 commits in the last 90 days, yet 1435 of 1456 significant files carry no living knowledge. Those two readings cannot both be true, so the per-file recency signal is treated as unreliable here and freshness is not scored for this run.
AXB2 Runtime readiness — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `npm run` found no package.json in the folder where our sandbox ran it. This is a limit of our sandbox, not of your repository. (rule: no-root-manifest). The renderer reported: the dev server (`npm run dev`) exited before it served a page. Likely cause (our sandbox): `npm run` found no package.json in the folder where our sandbox ran it. This is a limit of our sandbox, not of your repository. Last output: "npm error code ENOENT / npm error syscall open / npm error path <repo>/package.json / npm error errno -2 / npm error enoent Could not read package.json: Error: ENOENT: no such file or directory, open '<repo>/package.json' / npm error enoent This is related to npm not being able to find a file. / npm error enoent / npm error A complete log of this run can be found in: <path>" No runtime evidence was gathered.
AXR1 Runtime accessibility — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Render strategy: boot via DevServer (dev). the dev server (`npm run dev`) exited before it served a page. Likely cause (our sandbox): `npm run` found no package.json in the folder where our sandbox ran it. This is a limit of our sandbox, not of your repository. Last output: "npm error code ENOENT / npm error syscall open / npm error path <repo>/package.json / npm error errno -2 / npm error enoent Could not read package.json: Error: ENOENT: no such file or directory, open '<repo>/package.json' / npm error enoent This is related to npm not being able to find a file. / npm error enoent / npm error A complete log of this run can be found in: <path>" No runtime evidence was gathered.
C1 Data Protection — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
C2 Access Controls — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These authorization controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks authorization controls.
C3 Audit Trail — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These audit controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks audit controls.
C4 Data Retention — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These retention controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks retention controls.
C5 Data-Subject Rights — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These data-subject rights controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks data-subject rights controls.
DM9 Scattered domain decisions — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Arm two tells a construction that PRODUCES a measurement from one that merely passes it along, and this repository's frontend does not compute that fact. A measurement built independently in two places would not appear above.
DM9 Scattered domain decisions — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Some of this repository's production types come from a frontend that does not bind comparison operands to the members they read, which arm one needs, and those types were not walked for this dimension. The counts above speak for the languages that declare it.
M4 Documentation accuracy — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9), and artefact counts an order of magnitude off. Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
R10 Code Duplication — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 2351 further occurrence(s) are not listed individually; the score already reflects all 2391.
R2 Cyclomatic Complexity — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 390 further occurrence(s) are not listed individually; the score already reflects all 430.
R4 Test Coverage — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 1231 further occurrence(s) are not listed individually; the score already reflects all 1271.
R7 Dead Code — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 947 further occurrence(s) are not listed individually; the score already reflects all 987.
S1 Web-Security Posture — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These web-security controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks web-security controls.
SC1 Supply-chain hygiene — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 1140 further occurrence(s) are not listed individually; the score already reflects all 1180.
X10 Duplicated predicate — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 164 further occurrence(s) are not listed individually; the score already reflects all 204.
X27 Collection changed while being enumerated — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
X3 Exception handling — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 47 further occurrence(s) are not listed individually; the score already reflects all 87.
X7 Silent fallback defaults — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 138 further occurrence(s) are not listed individually; the score already reflects all 178.
Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.
Limitations & what we did not check
We assess the repository exactly as committed, and only the repository. By design we do not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.
D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
D8 Code Coverage: Coverage is measured by building and running the test suite inside our isolated image — the target repo is never modified, and nothing on your systems runs. So coverage exists only when the suite builds and runs within the inline time budget; one that needs external services, can't build, or exceeds the budget yields no coverage (D8 then degrades to not-measured, not a low score). Line coverage also says nothing about assertion quality.
D10 Test Quality: Assertion density is structural — it cannot tell a meaningful behavioural assertion from a trivial one, only that an assertion is present.
D11 Test Reliability: Flakiness is inferred from history/markers — we run the suite once (for coverage), not the repeated runs under varied conditions that reveal nondeterminism, so a flaky test never recorded as failing is invisible here.
D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
D19 Documentation Quality: Documentation quality publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
D24 Comment Value: Comment value is measured as redundancy only: a comment that repeats its code's words is found, but a paraphrase in other words, a vague comment, or one the code contradicts is not, and whether a comment is valuable is not claimed. Comments in other scripts or languages, and outside C#, are not judged.
D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
D27 Navigability: Indirection/navigability is structural — it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
D31 IaC & Container Security: IaC scanning checks Dockerfiles/Terraform/Kubernetes against best-practice rules — it cannot see the live cloud account, runtime configuration, or drift between the committed config and what is actually deployed.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a REDACTED (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
AC2 Forms & labels: Label association is read from static markup — a label wired up at runtime (JS-set aria-labelledby, framework-injected ids) reads as missing, a present label says nothing about whether its text is correct. A known UI-library field component (e.g. a JSX <TextField>) is now checked conservatively — flagged only when it carries NO label/aria-label/aria-labelledby/id/name — but wrapper/context-labelled libraries (Chakra/Radix FormControl+FormLabel) aren't statically visible (possible false positive) and non-JSX lowercased components are still skipped. A click handler on a plain element is now asked for a name too (it is a control the author declared), but the subtree test that answers it is deliberately generous: any DYNAMIC text expression in the subtree counts as a name, so an icon chosen by a ternary ({cond ? <IconA/> : <IconB/>}) reads as named, and a glyph component from a library the icon-import list does not know still names its parent. A clean result is "no unlabelled control found", not a labelling proof.
AC3 Page structure: Page structure is read from the static markup tree — landmarks, headings and lang injected at runtime aren't seen, heading ORDER is checked structurally (not against the rendered visual hierarchy), and lang/title/main fire only on full documents, never partials, and the data-table check sees header-cell presence (a <th> exists), not whether each header correctly associates with its cells. Static readiness, not conformance.
AC5 ARIA correctness: ARIA correctness is checked against the static role/attribute shape — roles/attributes set dynamically aren't seen, a valid role says nothing about whether it matches the element's real behaviour, and required-state checks are suppressed when a JSX spread could supply them. The two-branch toggle check (a control whose state is conveyed only by which of two mutually exclusive branches renders) reads CONDITIONALS THAT ARE ATTRIBUTES — Vue v-if/v-else/v-show and Alpine x-if/x-show — so the same toggle written as a Svelte {#if} block or a JSX ternary is control flow the markup model never projects as a branch and is not seen at all.
AC6 Visual & motion safety: Contrast and motion safety are PARTIAL by construction — literal colours (hex/rgb/hsl/named) in inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS top-level declarations are read (same-rule/same-element colour+background pairs only); computed/runtime/theme colour, external-CDN stylesheets, CSS-in-JS dynamic (${…}) and nested-selector colours, cross-element pairs and image contrast stay out of reach, so a clean result is bounded by what the static CSS itself shows.
AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
AX9 CQS / query purity: Handlers are found by interface/name convention — a query handler using neither is not seen. Mutation is a resolved write/publish invocation (SaveChanges/repository/bus), so a write hidden behind a hand-rolled wrapper, reflection, or a string-keyed service locator resolves to a non-persistence type and isn't flagged; it detects that a query writes state, not whether the write is a legitimate read-side cache update. Clean means "no resolved write/publish in a query body", not a proof of CQS purity.
M4 Documentation accuracy: Documentation accuracy checks links, versions and artefact counts against the tree: other claims (paths, commands, settings, routes) are read but not checked, and it cannot run the onboarding or measure how long a real new joiner takes.
P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
P5 DR & Backup: Backup/restore and disaster-recovery readiness is judged from in-repo evidence — a config that exists is not a tested restore, so the absence of positive evidence is reported as "not evidenced", never scored as present.
P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.
What it measures: How tangled the control flow is — methods with many branches are hard to test and change.
Method: Cyclomatic complexity per method (1 + decision points), computed exhaustively across production source; test projects separated by convention. Deterministic.
+ 29 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 1 body over 60 down to 60 or less in Cyclomatic Complexity — start with parse_pi_transcript.main (cyclomatic 68). — Refactoring it lifts Cyclomatic Complexity from 6.4 to about 6.5/10.
Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How hard the code is for a person to follow, beyond raw branching.
Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.
+ 69 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 4 bodies over 60 down to 60 or less in Cognitive Complexity — start with parse_pi_transcript.main (cognitive 135), analyze_transcript.aggregate_main_session (cognitive 111), export-sol.validate (cognitive 95). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 4 together lifts Cognitive Complexity from 2.0 to about 3.8/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes9.9 / 10Stronggated by 4 serious findings✓ Tool-verified
What it measures: Over-large classes that try to do too much ("god classes").
Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.
4 over-large unit(s) detected — types, modules or files that carry too much.
FileTooLong: REDACTED · ×4REDACTED
What to do
Resolve the 4 FileTooLong finding(s) in God Classes — start with REDACTED, analyze_transcript.py, aggregate-by-query.py. — One of this dimension's main actionable groups (4 warning-level).
Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How much of the production code is copy-pasted: the share of production lines inside a reported copy (every copy of a duplicated block or of an edited member, each line once), 10 at none and 0 at a quarter of the lines.
Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), scored on the share of production lines inside a reported copy (each line once; 10 at none, 0 at a quarter). Deterministic.
90 duplicated block group(s) detected. 1.5 % of the production lines (5,353 of 355,203) are in a reported copy. A further 162 rows report members as variants of one another; the share counts each copied line once, however many rows cite it. 233 of the 252 are in trees this repository does not ship — vendored, example/demo, project-template, fixture and benchmark code — and are ranked below the shipped groups rather than excluded from them: the duplication there is real and is still counted in this dimension's score. The dimensions that publish a production-file census leave those trees out of theirs, so this count is deliberately drawn over the wider population. Measured on part of this repository only: .ts (85% of production source) was not exposed to THIS dimension's token comparison and is not in this count; duplication there is measured by R10 Code Duplication, the frontend lens's card running the same clone algorithm over the JS/TS token stream.
Edited copy of a member (7 corresponding lines) · ×16experiments/runs/2026-09-20_06-40-05_game-of-life-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLifeCli.java:12
Edited copy of a member (10 corresponding lines) · ×15experiments/rq-status.py:44
Edited copy of a member (9 corresponding lines) · ×11experiments/runs/2026-09-20_07-18-54_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/ScenarioRunner.java:92
+ 88 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 16 Edited copy of a member (7 corresponding lines) finding(s) in Code Duplication — start with GameOfLifeCli.java (3), ClaimOfficeCli.java (2), lib.rs (2). — One of this dimension's main actionable groups (16 warning-level).
Resolve the 15 Edited copy of a member (10 corresponding lines) finding(s) in Code Duplication — start with lib.rs (2), PremiumCalculator.java (2), quote.rs (2). — One of this dimension's main actionable groups (15 warning-level).
Resolve the 11 Edited copy of a member (9 corresponding lines) finding(s) in Code Duplication — start with GameOfLife.java (2), ScenarioRunner.java, GameOfLifeCli.java. — One of this dimension's main actionable groups (11 warning-level).
Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D5 · Coupling10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether volatile projects sit underneath others that depend on them (so their churn ripples upward), and whether project dependencies form cycles. A widely-depended-on but stable shared/kernel project is healthy, not penalised.
Method: Dependency cycles via elementary-DFS over real .csproj references, plus Martin instability (afferent/efferent) per project. Exhaustive over the reference graph, deterministic.
Coverage: Exhaustive · type-level: afferent/efferent coupling + cycles computed over every production type — the population is all types, not a name convention.
17 production modules (Cargo+npm+Python), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; 0 module(s) off the main sequence, with abstractness counted on 15 of the 17 (the rest declare no modelled class or interface, export only macros, declare types in source no model reads, or have no source directory of their own).
What it measures: Whether a class's methods are focused on a single responsibility.
Method: LCOM4 cohesion per production class with at least two methods: connected components of methods sharing state or calls, computed syntactically. Deterministic, not a proxy.
Coverage: Exhaustive · type-level: LCOM4 cohesion computed over every production class — the population is all types, not a name convention.
What it measures: How much of the code is actually exercised by tests.
Method: Coverage from the analyzer's own run of the suite, computed per-file with structured exclusions for generated, trivial, and glue code. A coverage report found in the repository is never read. When the suite can't be built/run in-image, coverage is reported NOT-MEASURED (excluded from the score) with the precondition to make it measurable — never a LoC-ratio proxy folded in as if measured. Deterministic.
Line coverage 100.0%. Measured from the JavaScript/TypeScript suite (vitest + @vitest/coverage-v8 via `npm install --ignore-scripts` (no lockfile) in experiments/runs/2026-05-03_04-15-52_mars-rover-prose_v5-exact-single-context_haiku-4-5/, the 3 run(s) test reliability made; vitest + @vitest/coverage-v8 via `npm install --ignore-scripts` (no lockfile) in experiments/runs/2026-05-03_05-13-45_game-of-life-prose_v5-exact-single-context_opus-4-7/, the 3 run(s) test reliability made; vitest + @vitest/coverage-v8 via `npm install --ignore-scripts` (no lockfile) in experiments/runs/2026-05-03_05-19-00_game-of-life-prose_v5-exact-single-context_opus-4-7-no-thinking/, the 3 run(s) test reliability made; vitest + @vitest/coverage-v8 via `npm install --ignore-scripts` (no lockfile) in experiments/runs/2026-05-03_05-23-01_game-of-life-prose_v5-exact-single-context_sonnet-4-6/, the 3 run(s) test reliability made; vitest in experiments/runs/2026-05-03_05-33-40_game-of-life-prose_v5-exact-single-context_haiku-4-5/: not run; vitest + @vitest/coverage-v8 via `npm install --ignore-scripts` (no lockfile) in experiments/runs/2026-05-03_05-43-31_mars-rover-prose_v3-basic-tdd_sonnet-4-6/, the 3 run(s) test reliability made; vitest + @vitest/coverage-v8 via `npm install --ignore-scripts` (no lockfile) in experiments/runs/2026-05-03_05-45-04_game-of-life-prose_v3-basic-tdd_sonnet-4-6/, the 3 run(s) test reliability made; vitest + @vitest/coverage-v8 via `npm install --ignore-scripts` (no lockfile) in experiments/runs/2026-05-03_10-59-43_game-of-life-prose_v3-basic-tdd_opus-4-7-no-thinking/, the 3 run(s) test reliability made; vitest + @vitest/coverage-v8 via `npm install --ignore-scripts` (no lockfile) in experiments/runs/2026-05-03_11-00-37_game-of-life-prose_v3-basic-tdd_opus-4-7-no-thinking/, the 3 run(s) test reliability made; vitest + @vitest/coverage-v8 via `npm install --ignore-scripts` (no lockfile) in experiments/runs/2026-05-03_11-01-33_game-of-life-prose_v3-basic-tdd_opus-4-7-no-thinking/, the 3 run(s) test reliability made; vitest + @vitest/coverage-v8 via `npm install --ignore-scripts` (no lockfile) in experiments/runs/2026-05-03_13-07-14_game-of-life-user-story_v3-basic-tdd_opus-4-7-no-thinking/, the 3 run(s) test reliability made). Taken over 3 runs of the suite: a line counts as covered only when every run executed it.
✓ On the Gold path — maintain.
Detailed fixes: d8_recommendation.md.
Do you agree with this assessment?
D10 · Test Quality10.0 / 10Adequategated by 3 critical findings✓ Tool-verified
What it measures: Whether the tests truly assert behaviour rather than just running the code.
Method: Per-test assertions, skips, and mock references analyzed via Roslyn; structured skip-reason tags (BUG:/ENV:) separate documented deferrals from debt. Deterministic.
2222 skipped (2222 with a documented reason), 12 zero-assertion, no mocking-framework packages referenced (hand-written doubles or no mocking) across 47843 tests (1 harness-style project(s) excluded from the assertion penalty). Measured on the JavaScript/TypeScript suite only — at least 269 test source file(s) (.py, .java, .rs) went unread, so its test quality is unmeasured and is not in these counts.
No assertions (empty test): a premium calculation that yields 197.5 G is rounded UP to 198 G final (satisfied by the 7-runes case) · ×3experiments/runs/2026-10-23_04-12-26_claim-office-example-mapping_exact-ptdd-v1-pi_minimax-m3/src/quote.spec.ts:240
No direct assertions: should return an empty grid for an empty grid — [] → [] · ×9experiments/runs/2026-08-10_16-37-38_game-of-life-example-mapping_v5.1-testlist-scope-fix_opus-5-no-thinking/src/game-of-life.spec.ts:14
Test project verifies nothing: experiments/runs/2026-08-10_16-37-38_game-of-life-example-mapping_v5.1-testlist-scope-fix_opus-5-no-thinkingexperiments/runs/2026-08-10_16-37-38_game-of-life-example-mapping_v5.1-testlist-scope-fix_opus-5-no-thinking/src/game-of-life.spec.ts:14
Skipped (documented): more damages of a type than insured -> non-zero exit, whole claim rejected · ×2222experiments/runs/_archive/2026-09-23_16-10-32_claim-office-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-5-no-thinking/src/claim-office.spec.ts:274
What to do
Resolve the 3 No assertions (empty test) finding(s) in Test Quality — start with quote.spec.ts (3). — One of this dimension's main actionable groups (3 issue-level).
Resolve the 9 No direct assertions finding(s) in Test Quality — start with game-of-life.spec.ts (9). — One of this dimension's main actionable groups (9 recommendation-level).
Resolve the 1 Test project verifies nothing finding(s) in Test Quality — start with game-of-life.spec.ts. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d10_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D11 · Test Reliability10.0 / 10Adequategated by 1 critical finding✓ Tool-verified
What it measures: Whether the tests pass reliably, with no flakiness.
Method: Suite re-run N times within tiered wall-clock budgets (unit to e2e); tests failing non-deterministically across runs flagged; guarded tests retried when #if guards detected.
0 flaky across 1 measured tier(s). JavaScript/TypeScript (vitest via `npm ci --ignore-scripts` in .claude/skills/exact-coding-baseline-export/distribution-root/templates/typescript-vitest/files/ (1 tests); vitest via `npm install --ignore-scripts` (no lockfile) in experiments/runs/2026-05-03_04-15-52_mars-rover-prose_v5-exact-single-context_haiku-4-5/ (10 tests); vitest via `npm install --ignore-scripts` (no lockfile) in experiments/runs/2026-05-03_05-13-45_game-of-life-prose_v5-exact-single-context_opus-4-7/ (9 tests); vitest via `npm install --ignore-scripts` (no lockfile) in experiments/runs/2026-05-03_05-19-00_game-of-life-prose_v5-exact-single-context_opus-4-7-no-thinking/ (9 tests); vitest via `npm install --ignore-scripts` (no lockfile) in experiments/runs/2026-05-03_05-23-01_game-of-life-prose_v5-exact-single-context_sonnet-4-6/ (7 tests); vitest via `npm install --ignore-scripts` (no lockfile) in experiments/runs/2026-05-03_05-33-40_game-of-life-prose_v5-exact-single-context_haiku-4-5/ (0 tests); vitest via `npm install --ignore-scripts` (no lockfile) in experiments/runs/2026-05-03_05-43-31_mars-rover-prose_v3-basic-tdd_sonnet-4-6/ (17 tests); vitest via `npm install --ignore-scripts` (no lockfile) in experiments/runs/2026-05-03_05-45-04_game-of-life-prose_v3-basic-tdd_sonnet-4-6/ (10 tests); vitest via `npm install --ignore-scripts` (no lockfile) in experiments/runs/2026-05-03_10-59-43_game-of-life-prose_v3-basic-tdd_opus-4-7-no-thinking/ (11 tests); vitest via `npm install --ignore-scripts` (no lockfile) in experiments/runs/2026-05-03_11-00-37_game-of-life-prose_v3-basic-tdd_opus-4-7-no-thinking/ (11 tests); vitest via `npm install --ignore-scripts` (no lockfile) in experiments/runs/2026-05-03_11-01-33_game-of-life-prose_v3-basic-tdd_opus-4-7-no-thinking/ (11 tests); vitest via `npm install --ignore-scripts` (no lockfile) in experiments/runs/2026-05-03_13-07-14_game-of-life-user-story_v3-basic-tdd_opus-4-7-no-thinking/ (13 tests)): measured (0 flaky).
Test suite executes none of its 6 test cases: experiments/runs/2026-05-03_05-33-40_game-of-life-prose_v5-exact-single-context_haiku-4-5/
What to do
Resolve the 1 Test suite executes none of its 6 test cases finding(s) in Test Reliability. — One of this dimension's main actionable groups (1 issue-level).
Detailed fixes: d11_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any secrets (keys, tokens, passwords) have leaked into the code.
Method: In-process native secret scanner (entropy plus signature patterns) across all tracked files; no external tool. A clean result is a measured 10, not no-data zero. Deterministic.
What it measures: Whether the licenses of third-party packages are compatible with your policy.
Method: Third-party package licenses resolved from declared package metadata and checked against the configured policy (allow/deny/copyleft). Deterministic; clean = no incompatible license found at metadata depth.
0 of 11 shipped crate(s) use a banned license. Licences were resolved from crates.io over the crates a consumer compiles — this repository's Cargo.lock closed over its manifests' `[dependencies]` and `[build-dependencies]`. Crates it asks for ONLY under `[dev-dependencies]` are excluded: they are not compiled by anything that depends on this repository. ★ COVERAGE OF THIS VERDICT: it grades this repository's crate dependencies and nothing else. The repository also declares a Python REDACTED/requirements.txt (pip/uv/Poetry) and package.json, and the licences of those dependency graphs were NOT read by this pass — a gap in this engine's coverage, not a statement about them. So this result says the graded closure carries no banned licence; it does NOT say this repository's licensing is clear.
What it measures: Files that change often and are also complex — the riskiest hotspots.
Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.
Resolve the 6 Hotspot finding(s) in Churn × Complexity Hotspots — start with export-sol.py, REDACTED, tdd-report.py. — One of this dimension's main actionable groups (6 warning-level).
Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Acknowledged debt left in the code — TODOs, dead code, suppressed warnings.
Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.
5 deducted task-comment markers across 316386 LoC (0.0/KLoC) → score 10.0. Task comments only: this repository's language is read without a compiler, so D17's suppression, dead-code and commented-out-code arms did not run and this score counts fewer marker kinds than a .NET repository's would.
Resolve the 5 TodoComment finding(s) in Explicit Debt — start with claim-office.ts (3), claim-office-mapping.ts, gameOfLife.ts. — One of this dimension's main actionable groups (5 warning-level).
Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the project's documentation is clear, complete, and useful.
Method: Every README, docs/ document and root guide parsed by its markup and measured in Unicode letters. Published: a runnable or packaged .NET project whose README (or a document it links, or a root guide) shows no example, and a root README naming none of three or more projects. Overview, licence, boilerplate, wall-of-text, empty-section and XML-doc rows are measured and withheld (counted in gaps) after adjudication. Deterministic, exhaustive, advisory.
What it measures: Whether comments are worth it — explaining WHY (valuable) rather than WHAT (redundant).
Method: Every inline C# comment compared word by word with the identifiers, literals and constructs of the code it annotates (taken from the syntax); a comment whose words that code already contains is redundant, as are closing-brace labels and generator template text. Comments giving a reason or a reference are kept; other scripts and languages are not judged. Deterministic, exhaustive, advisory.
doc comments repeat the namesexperiments/runs/2026-05-09_14-24-02_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking/src/claim-office.ts:92
What to do
Resolve the 118 redundant comment finding(s) in Comment Value — start with claim-office.spec.ts (50), claim-office.ts (21), cli.ts (13). — One of this dimension's main actionable groups (118 recommendation-level).
Detailed fixes: d24_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How far you must trace to follow a call — low indirection and co-located slices read easier.
Method: Call indirection (interface hops, cross-namespace calls, slice-locality scaled) over a sampled set of method invocations, size-aware baseline. Sampled; confidence discounted by symbol-resolution gaps. C# also names each pass-through layer (a class whose every public method only forwards its own parameters to one collaborator) as a located finding; the score is not affected.
Coverage: Slice locality from the first namespace segments, SAMPLED (≤400 methods) — not exhaustive.
1 % of calls cross a namespace and 0 % go through an interface, but 100 % of collaborators are co-located — so a call's collaborators sit together and tracing stays easy. Baseline: small — navigation cost is tolerated.
What it measures: Real static-analysis (SAST) findings — likely security bugs in the code, any language.
Method: Polyglot static analysis via semgrep across the repo using the pinned, image-baked p/security-audit + p/owasp-top-ten rulesets (no scan-time registry fetch); severity rules (ERROR/WARNING/INFO) map to a full-band severity-weighted score. Exhaustive, deterministic; degrades on parse failure.
Coverage: semgrep pattern rules over all files — exhaustive for the rule set, blind to classes of bug without a rule (clean = no rule matched).
45 finding(s): 0 critical, 39 high, 6 medium, 0 low. semgrep hit a parse error in 63 file(s) — `experiments/analyze-run.sh` (line 2020, line 2040), `experiments/docker/watch-batch.sh` (line 456), `experiments/runs/2026-05-12_04-33-35_claim-office-prose_v5-exact-single-context_sonnet-4-6-portkey-no-thinking/bin/claim-office.js` (line 2), `experiments/runs/2026-05-25_06-43-28_claim-office-prose_v1-oneshot-oc_opus-4-7-portkey/transcript-opencode.json`, `experiments/runs/2026-05-25_15-30-40_claim-office-example-mapping_v5.1-testlist-scope-fix-oc_kimi-k2-6/transcript-opencode.json`, … (+58 more) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them.
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
+ 3 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 35 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (35). — One of this dimension's main actionable groups (35 issue-level).
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir and Erlang via Hex, Go modules, Java and Kotlin via Maven/Gradle, JavaScript/npm, .NET/NuGet, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift.
Method: Dependency-CVE scan across every ecosystem the repository declares, scored ONCE. Three sources are unioned and deduplicated by advisory identity (rule id + alias closure, CVE<->GHSA) scoped to package+version, keeping the worst severity: `osv-scanner --recursive` over osv.dev for Dart pub, Elixir/Hex (and Erlang, whose `rebar.lock` syft first converts to a CycloneDX SBOM the scanner reads, with rows attributed back to the lock), Go, Java and Kotlin via Maven/Gradle (and Scala, whose sbt build's pinned direct declarations are written into a CycloneDX SBOM the scanner reads, with rows attributed back to the build file), npm, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift; `trivy fs --scanners vuln` for npm lockfiles; and `dotnet list package --vulnerable --include-transitive` for NuGet (with per-advisory collapse of the project x target-framework fan-out), plus a DECLARED-dependency arm that resolves a published gem's gemspec against rubygems.org where no Gemfile.lock is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05. Advisory since rubric-2026.11.2 (CAI decision 0006): every row is a match against a vulnerability database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.
+ 1 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 392 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (227), REDACTED (122), REDACTED (43). — One of this dimension's main actionable groups (392 issue-level).
Resolve the 194 Medium CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (178), REDACTED (15), REDACTED. — One of this dimension's main actionable groups (194 warning-level).
Resolve the 80 Critical CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (72), REDACTED (8). — One of this dimension's main actionable groups (80 issue-level).
Detailed fixes: d30_recommendation.md · top locations in Appendix A, every location in findings.md.
Resolve the 2 High IaC finding(s) in IaC & Container Security — start with REDACTED (2). — One of this dimension's main actionable groups (2 issue-level).
Resolve the 6 Medium IaC finding(s) in IaC & Container Security — start with REDACTED (6). — One of this dimension's main actionable groups (6 warning-level).
Detailed fixes: d31_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.
Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.
Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.
What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Reported apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.
Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. Advisory since rubric-2026.11.2 (CAI decision 0006): the malicious-package feed is a database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.
What it measures: Whether anyone still ships security patches for the platform this repository RUNS ON — the runtime it pins and the framework majors its own constraints hold it to. Separate from D12 because the question differs: a current Django on an end-of-life Python is perfectly up to date and completely unsupported, and the fix is a migration rather than a version bump. What the repository says it merely SUPPORTS is never charged.
Method: End-of-life PLATFORM read from the repository's own declarations and graded against a FROZEN, dated table of vendor support dates — no network, no feed, no API, so this dimension answers identically inside a closed scan fence. Two subjects: a RUNTIME the project pins (a single or all-end-of-life TargetFramework, a .nvmrc or .python-version, a requires-python CAP) and a FRAMEWORK major a dependency constraint cannot move off (a caret, tilde or exact version; `vue@^2.7.16` pins Vue 2). A FLOOR is deliberately never charged — `requires-python = ">=3.8"` states what a package SUPPORTS, not what it runs on — and a multi-target project is charged only when EVERY target is out of support. Runtime 4.0/product capped 8.0, framework 1.5 capped 4.5. The table is safe to freeze because a statement about support that ended in the past cannot become false: it loses recall as it ages, never precision, and a test asserts every entry predates the freeze date. Disjoint from D31 (a container image's OS layer) and D29 (the toolchain a CI workflow installs). Abstains when the repository declares no platform this pass reads — never scores it clean.
0 end-of-life runtime(s) and 0 end-of-life framework(s), read from 63 platform declaration(s) and 133 dependency declaration(s). This dimension reads what the repository says about ITSELF — a pinned target framework, a version file, a capped requires-python, a Rust toolchain pin, a framework major a constraint cannot move off. A FLOOR is deliberately never charged: `requires-python = ">=3.8"` states what the package SUPPORTS, not what it runs on, and a well-maintained library declares exactly that while running its own CI on a current release. The end-of-life facts are FROZEN and dated, so this dimension needs no network and answers identically inside a closed scan fence; as the table ages it loses recall and never precision, because a statement about support that ended in the past cannot become false. The OS layer of a container image is D31's question and the toolchain a CI workflow installs is D29's; this row is neither.
✓ On the Gold path — maintain.
Detailed fixes: d44_recommendation.md.
Do you agree with this assessment?
Frontend & cross-cutting dimensions
R = React/JS · M = Maturity · P = Readiness.
AC2 · Forms & labels10.0 / 10Exemplary○ Nothing flagged
Other · Accessibility — Whether form controls have a programmatic label (an associated label, aria-label or aria-labelledby), buttons have text, links have an accessible name, a click handler on a plain element names the control it declares, fieldsets have a non-empty legend, known UI-library field components carry a label prop, and a placeholder isn't used as the only label. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: inputs/selects/textareas checked for an associated label[for]/wrapping label/aria-label/aria-labelledby (per document), buttons for accessible text, fieldsets for a legend; placeholder-only labelling flagged. Deterministic, hard fact per control.
Coverage: Population: form controls, buttons, links, fieldsets and known UI-library field components in the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and spread/dynamic-attribute elements are skipped, so a control whose label arrives through a spread or a runtime expression is deliberately not judged. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
Do you agree with this assessment?
AC3 · Page structure6.2 / 10Strong✓ Tool-verified
Other · Accessibility — Whether pages declare a language (well-formed BCP-47) and a non-empty title, expose exactly one main landmark and a sane heading order with non-empty headings, keep zoom enabled, title their iframes, give data tables header cells, and avoid meta-refresh. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: html lang, document <title>, a main landmark and heading order on full documents only, plus zoom-disabling viewports, untitled iframes and meta-refresh anywhere. Deterministic, per structural checkpoint.
Coverage: Population: the PARSED MARKUP documents (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx). The page-level checks — lang, title, single main landmark — fire ONCE PER FULL DOCUMENT (an <html> root) and never on a partial or component fragment, so a repo of fragments is assessed only on the per-element checks (heading order, table headers, iframe titles, meta-refresh, zoom). Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope). — site/src/ResultTable.tsx:155
What to do
Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.
Other · Accessibility — Whether ARIA is used correctly — valid non-abstract roles, the ARIA state a role requires, valid (non-misspelled) aria-* attribute names, in-enum values for token-typed aria-* attributes, and no aria-hidden on (or wrapping) a focusable element. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: role values checked against the WAI-ARIA role set (abstract/invalid flagged), required ARIA state for a role, and aria-hidden on a focusable element. Deterministic, role/attribute level.
Coverage: Population: elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx) that carry a role or an aria-* attribute; roles and token values are checked against the ARIA enums exhaustively within that set. An expression-valued (dynamic) role or aria-* value is skipped rather than guessed, and markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
Other · Accessibility — Whether focus outlines aren't removed without a replacement, motion respects prefers-reduced-motion, and literal CSS colour pairs meet contrast — PARTIAL: inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS literals are read (hex/rgb/hsl/named), never computed/runtime/external-CDN colour. Static markup readiness, not a WCAG conformance claim.
Method: Static markup/CSS scan: inline outline:none/0, literal inline colour/background contrast against the 4.5:1 AA floor, and <style>-block animation without a prefers-reduced-motion guard. Deterministic but PARTIAL — only inline styles and in-repo CSS literals are visible.
Coverage: Population: styled elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx), plus in-repo <style> blocks, in-repo .css files and CSS-in-JS literals. Colour contrast is computed from LITERAL colour pairs only (hex/rgb/hsl/named, including var() tokens and Tailwind neutral utilities) — computed, runtime-themed and external-CDN colour is never resolved, so this is a partial read of contrast by construction. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.
Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.
Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.
Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).
Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.
Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.
Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.
Other · Architecture — Whether interfaces stay focused rather than fat — the Interface-Segregation principle (SOLID 'I').
Method: Roslyn scan: public interface declared-member counts (accessors fold into their property/event); fat-interface threshold (over 15 declared members) flagged per type. Each finding also reports the distinct-OPERATION count — members counted by name, so an overload group counts once — which decides whether it states the caller-side ISP harm or the implementer-side burden of an overload set. TypeScript: exported interfaces that declare behaviour, counted over their REQUIRED operations (method signatures and function-typed properties with no `?`, once per signature) — data-shape interfaces and ambient .d.ts declarations are outside the population; JavaScript declares no interfaces and is not applicable. Deterministic, type-level.
Do you agree with this assessment?
AX8 · Test isolation10.0 / 10Exemplary✓ Tool-verified
Other · Architecture — Whether production projects stay free of references to test projects — tests may depend on production, never the reverse.
Method: Csproj graph: each production project checked for references to test projects (identified by test-framework presence, not name). Zero violations is clean. Deterministic.
Other · Architecture — Whether read (query) handlers stay side-effect-free — a query that writes persistent state or raises events breaks CQS and makes reads unsafe to retry, cache, or route to a read replica.
Method: Roslyn scan: CQRS handlers classified query-vs-command by interface (IQueryHandler/ICommandHandler/IRequestHandler<TQuery,TResult>) and name convention (*Query/Get*/Find* vs *Command); each query handler's body checked for persistent-state writes (SaveChanges/repository Add-Update) or event publishes by resolved invocation. Deterministic, type-level, exhaustive over the detected handlers.
Coverage: Population: CQRS handlers identified by IQueryHandler/ICommandHandler/IRequestHandler interface + *Query/Get*/Find*/*Command NAME convention; query purity then checked exhaustively within that set — a query handler using neither convention is invisible, and mutation is a resolved persistence/publish CALL, not full dataflow.
Other · Domain Modelling — Whether one domain rule is decided — or one measurement produced — in more than one place, rather than living on the type that owns it.
Method: Neutral body surface plus Roslyn (DDD-gated), two arms. DECISION (Roslyn only): a predicate over a domain type's members judged in two or more types, where none of those decisions live on the owning type — operands of comparisons and relational property patterns only, so a member merely passed as an argument is not judged. DERIVATION: a plain all-numeric carrier of ≥2 members, with no base type and exactly one constructor, CONSTRUCTED as the result of a method (returned or assigned, never inline as an argument) in two or more types other than its own — the same measurement produced twice, which centralising the judgement does not fix. DERIVATION runs on every language whose frontend declares the produced-or-passed fact per construction (Roslyn and the Java sidecar today); a target with only the derivation arm carries an engine gap naming the decision arm as not assessed, and a frontend that declares nothing keeps the dimension not measured rather than clean. Single-member rules, test code and generated code are out of population for both. Advisory.
experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.Item's [enchantment, material] are judged in experiments.runs.2026-05-09_09-02-47_claim-office-example-mapping_v3-basic-tdd_haiku-4-5.src.engine.Engine, experiments.runs.2026-05-09_09-08-31_claim-office-example-mapping_v3-basic-tdd_haiku-4-5.src.core, experiments.runs.2026-05-11_23-09-36_claim-office-prose_v5-exact-single-context_opus-4-6-portkey.src.claim-office, experiments.runs.2026-05-12_01-06-17_claim-office-user-story_v5-exact-single-context_opus-4-6-portkey-2.src.claim-office, experiments.runs.2026-05-12_01-06-46_claim-office-user-story_v5-exact-single-context_opus-4-6-portkey-no-thinking.src.claim-office, experiments.runs.2026-05-12_01-37-27_claim-office-user-story_v5-exact-single-context_opus-4-6-portkey-no-thinking.src.claim-office, experiments.runs.2026-05-12_01-37-28_claim-office-user-story_v5-exact-single-context_opus-4-6-portkey.src.claim-office, experiments.runs.2026-07-25_09-45-21_claim-office-example-mapping_v6_2_1-phase-continuation-pi_qwen3-235b.src.claim-office, experiments.runs.2026-08-10_06-39-55_claim-office-example-mapping_v4_1-testlist-scope-fix-pi_gpt-5-6-sol-4.src.claim-office — the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it.
What to do
Move each repeated judgement onto the type that owns the members it reads, so the rule has one home and cannot drift.
Other · Code Health — Unreviewed-generation residue in this repository's JavaScript/TypeScript: functions whose whole body still throws a "not implemented" error, and placeholder text (lorem ipsum, changeme/replace_me…) left in strings and JSX of non-test, non-generated code. Scored as a quality signature, never as a claim about authorship.
Method: Roslyn syntax scan: NotImplementedException throws and placeholder string literals in non-test, non-generated shipped code. Deterministic, code-shape signature.
A shipped function's whole body still throws a "not implemented" error — generated scaffolding that was never completed. Implement it or remove the dead surface. (×2) — experiments/runs/2026-05-12_23-56-27_game-of-life-cli-user-story_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/game.ts:1, experiments/runs/2026-05-13_06-12-21_game-of-life-cli-user-story_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/game-of-life.ts:5
What to do
Finish or delete the functions that still throw "not implemented", and replace placeholder text before shipping.
Other · Code Health — Unfinished work detected by code SHAPE, not keywords, in this repository's JavaScript/TypeScript: functions that only throw a "not implemented" error, functions that take inputs and return a constant or do nothing, async functions that never await, dead `if (false)` branches, and skeleton classes most of whose methods are holes.
Method: Roslyn syntax scan: incompleteness by code shape (constant-returning methods, async-never-await, #if false branches, guards that return what the code already falls through to, tests an earlier guard already decided, comparisons against NaN, skeleton types), not keyword-gated. Deterministic, code-shape heuristic.
`advanceGeneration` throws an exception whose message says it isn't finished — a not-implemented stub wearing an ordinary exception. Implement it or remove it. — experiments/runs/2026-05-12_23-56-27_game-of-life-cli-user-story_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/game.ts:1
`step` looks like it should compute a result but its body just returns a constant — a placeholder return that was never filled in. — experiments/runs/2026-05-13_06-11-48_game-of-life-cli-prose_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/gameOfLife.ts:6
`step` throws an exception whose message says it isn't finished — a not-implemented stub wearing an ordinary exception. Implement it or remove it. — experiments/runs/2026-05-13_06-12-21_game-of-life-cli-user-story_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/game-of-life.ts:5
`processClaim` has an empty body — confirm it's an intentional no-op and not an unfinished method. — experiments/runs/2026-05-12_08-47-44_claim-office-user-story_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/claim-office.ts:6
What to do
Finish or delete the unfinished stubs (functions that throw "not implemented", or whose body is empty or a bare constant) — they are dead surface that looks live.
Clear the softer debt: re-enable or delete skipped tests, decide whether each empty function is a deliberate no-op (and say so in a comment), and replace blanket `eslint-disable` / `@ts-nocheck` with targeted, justified suppressions.
Maturity · Maturity — Whether the repository and its projects have a README, and whether it is substantive.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.
Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.
No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
What to do
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Maturity · Maturity — Whether the repository is organised deliberately: production code and tests are set apart in a way its ecosystem or the repository itself declares.
Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.
Maturity · Maturity — Whether the project's current-state documentation describes the code that exists.
Method: Every current-state document's checkable claims looked up in the tree (links, versions, and artefact counts an order of magnitude off), plus two README checks: an advertised infrastructure product with no footprint, and a module the CHANGELOG records as removed. Deterministic, no model. Advisory.
README.md links to `site/docs/README.md`, but `site/docs/README.md` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — README.md:385
README.md links to `experiments/workflows/MARKERS.md`, but `experiments/workflows/MARKERS.md` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — README.md:942
README.md links to `HUMAN-IN-THE-LOOP.md`, but `HUMAN-IN-THE-LOOP.md` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — README.md:1321
What to do
Reconcile the README with reality: README.md links to `site/docs/README.md`, but `site/docs/README.md` does not exist; README.md links to `experiments/workflows/MARKERS.md`, but `experiments/workflows/MARKERS.md` does not exist; README.md links to `HUMAN-IN-THE-LOOP.md`, but `HUMAN-IN-THE-LOOP.md` does not exist.
Do you agree with this assessment?
P1 · CI/CD gates0.0 / 10Critical✓ Tool-verified
Readiness · Readiness — Whether an automated pipeline builds and tests every change.
Method: Filesystem scan: CI workflow files (.github/workflows, .gitlab-ci.yml, etc.) for build and test stages. Exhaustive, deterministic.
No CI workflow found (.github/workflows, azure-pipelines.yml, .gitlab-ci.yml, …) — changes aren't gated by an automated build/test.
What to do
Add a CI workflow that builds and runs the test suite on every push/PR.
Do you agree with this assessment?
P10 · Library API & versioning10.0 / 10Exemplary○ Nothing flagged
Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.
Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language's code model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.
Do you agree with this assessment?
P2 · Observability0.0 / 10Critical✓ Tool-verified
Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.
No logging call was found in the 5294 Python, JavaScript/TypeScript, Rust, JVM production file(s) this check read across 2015 module(s). Each was searched for its ecosystem's logging libraries (JVM: SLF4J, Log4j2, java.util.logging, Logback, kotlin-logging, scala-logging; Python: logging, structlog, loguru; JavaScript/TypeScript: pino, winston, bunyan, log4js, loglevel, consola, the NestJS Logger; Rust: the log and tracing crates (info!/warn!/error!, #[instrument]), slog, env_logger) and for a call on a receiver named `log`/`logger` (or ending in `Logger`/`_logger`) with a level verb. It cannot see logging through a repo-local wrapper named otherwise, or in source it did not read — this is 'no logging found by this walk', not a verdict that nothing here logs. If it is right, production issues will be hard to diagnose.
What to do
Adopt pino (or winston) and log at meaningful points in the services you run.
Add a health-check endpoint (@godaddy/terminus or a /health route) so orchestrators and load balancers can probe liveness/readiness.
Readiness · Readiness — Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).
Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step — in this repository's own ecosystem. Exhaustive, deterministic.
`.claude/skills/exact-coding-baseline-export/distribution-root/templates/typescript-vitest/files/package.json` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`. — .claude/skills/exact-coding-baseline-export/distribution-root/templates/typescript-vitest/files/package.json:11
What to do
Your ecosystem's static analyzer is declared as a dependency but is not wired into CI — run it as a required step on push/PR (e.g. `composer phpstan` / `mix sobelow` / `bundle exec brakeman` / the spotbugs Gradle task / `sbt scalafixAll --check` / `golangci-lint run` / `rebar3 lint`) so a regression fails the build instead of relying on someone running it locally.
Enable Dependabot/Renovate or a dependency-review gate.
Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
Readiness · Readiness — Whether releases are automated and safely reversible (probes, rolling updates, approval gates) — from manifests/pipeline files, not the live environment.
Method: Filesystem scan: deployment manifests/IaC (K8s YAML, Helm, Terraform) for rolling updates, probes, approval gates, migration hooks. Exhaustive, deterministic.
Deployment is orchestrated by compose, but no service declares a `healthcheck:` and nothing pins a previous image to fall back to — the runtime can tell that the container is up, not that it is serving, so a bad release is harder to detect and reverse.
What to do
Add a `healthcheck:` to the served compose service — probing the endpoint it already answers on where it has one — with `depends_on: condition: service_healthy` on whatever waits for it, and keep the deployed image tag immutable and recorded so rolling back is re-pointing at the previous tag rather than rebuilding.
Add an approval/environment gate (required reviewers / protection rules) before production promotion.
Do you agree with this assessment?
P5 · DR & Backup0.0 / 10Critical✓ Tool-verified
Readiness · Readiness — Whether disaster recovery is planned and codified — backups, geo-recovery, RTO/RPO, persistence guarantees — from IaC + container manifests + docs, never the live cloud.
Method: Filesystem scan: disaster recovery, backup, geo-recovery, RTO/RPO, persistence guarantees from IaC, manifests, and docs. Exhaustive, deterministic, never a live environment.
A persistence guard (data volume / purge-protection) was found, but no backup, geo-recovery or RTO/RPO controls were evidenced — a volume that survives a container recreate is not a tested restore from catastrophic loss.
Readiness · Readiness — Whether releases are traceable — a maintained changelog and explicit version stamping.
Method: Filesystem scan: changelog file presence and version tags in csproj or git tags. Exhaustive, deterministic.
The changelog this check read carries 2 versioned entries, against a bar of 3. Counted as either the distinct `x.y.z` versions it names (a link's target is not counted) or its version-shaped section headings (`## [1.2.0]`, `## V14.x.x`, `## Updates in 8.0.x`), whichever is the larger — so a log sectioned by minor series counts its sections, not its individual patch numbers. Entries recorded somewhere this check does not read — release notes generated at tag time from a generator config it did not recognise, or a log kept outside the repository — are not counted here, and this row is about what is re-findable in the tree rather than about how often you release.
What to do
Keep the changelog current — add a versioned entry (Keep-a-Changelog ## [x.y.z]) for each release so the history isn't a stub.
Readiness · Performance — Whether asynchronous code stays responsive — it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.
Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from each language's code model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin, Swift, Dart) or inside a Java method returning a Reactor Mono/Flux or a Scala method returning a Future or effect — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.
Do you agree with this assessment?
R1 · Type Safety9.7 / 10Exemplary✓ Tool-verified
React / JS · Code Health — How much of the frontend is typed TypeScript vs untyped JavaScript.
Method: Frontend file inventory: the share of typed TypeScript vs untyped JavaScript across the source tree. Deterministic, exhaustive over frontend files.
Do you agree with this assessment?
R10 · Code Duplication2.4 / 10Weak✓ Tool-verified
React / JS · Code Health — The share of the scored frontend lines inside a near-exact copy-pasted block of substantial extent (the D4 clone algorithm over JS/TS tokens, D-386; each line once, 10 at none and 0 at a quarter of the lines, as D4): a block is reported only where its copies still agree on most of their own identifiers and literals, or were renamed as they were pasted but kept most of their constants, and where the copies carry enough code to stand on their own or the copied extent reaches 30 lines — so a re-implementation sharing neither names nor values, and a small pasted declaration, are both found and deliberately not reported, and a clean R10 is not a claim that nothing was copied.
Method: Near-exact copy-pasted blocks of substantial extent across the frontend (the D4 clone algorithm run over JS/TS tokens). Masking finds the candidates; a block is reported when its copies still agree on most of their own identifiers and literals, or when a renamed copy still agrees on most of its constants, AND the copies carry enough code to stand on their own — or when the copied extent reaches 30 lines. So a re-implementation sharing neither names nor values, and a small pasted declaration, are deliberately not counted. Scored on the share of the scored frontend lines inside a reported copy, on the same curve as D4. Deterministic.
experiments/docker/pi-config/ and experiments/docker/pi-config-noreason/ are near-verbatim copies of each other: 5 files are byte-identical under the same relative paths (~225 lines; the trees hold 6 and 6 files). That is one structural fact, not 5 local ones: every edit made to one tree and not the other drifts silently, which is the failure whole-tree forks guarantee. Pick one tree as the single source and produce the other from it (generated, copied at build or release time, or re-exported) — or, if the copy is a stale snapshot nothing produces any more, delete it. Check first whether the copy is a deliberately published deliverable (a template consumers copy verbatim, a released sample frozen at a version); where it is, keep it produced from the source tree rather than edited in place. — experiments/docker/pi-config/README.md:1
experiments/docker/pi-config/ and experiments/docker/pi-config-reasoning/ are near-verbatim copies of each other: 5 files are byte-identical under the same relative paths (~225 lines; the trees hold 6 and 6 files). That is one structural fact, not 5 local ones: every edit made to one tree and not the other drifts silently, which is the failure whole-tree forks guarantee. Pick one tree as the single source and produce the other from it (generated, copied at build or release time, or re-exported) — or, if the copy is a stale snapshot nothing produces any more, delete it. Check first whether the copy is a deliberately published deliverable (a template consumers copy verbatim, a released sample frozen at a version); where it is, keep it produced from the source tree rather than edited in place. — experiments/docker/pi-config/README.md:1
experiments/docker/pi-config-noreason/ and experiments/docker/pi-config-reasoning/ are near-verbatim copies of each other: 5 files are byte-identical under the same relative paths (~225 lines; the trees hold 6 and 6 files). That is one structural fact, not 5 local ones: every edit made to one tree and not the other drifts silently, which is the failure whole-tree forks guarantee. Pick one tree as the single source and produce the other from it (generated, copied at build or release time, or re-exported) — or, if the copy is a stale snapshot nothing produces any more, delete it. Check first whether the copy is a deliberately published deliverable (a template consumers copy verbatim, a released sample frozen at a version); where it is, keep it produced from the source tree rather than edited in place. — experiments/docker/pi-config-noreason/README.md:1
3127 duplicated blocks under experiments/runs/ have copies in at least two of the sibling directories 2026-05-03_04-15-52_mars-rover-prose_v5-exact-single-context_haiku-4-5, 2026-05-03_05-13-45_game-of-life-prose_v5-exact-single-context_opus-4-7, 2026-05-03_05-19-00_game-of-life-prose_v5-exact-single-context_opus-4-7-no-thinking, 2026-05-03_05-23-01_game-of-life-prose_v5-exact-single-context_sonnet-4-6, 2026-05-03_05-33-40_game-of-life-prose_v5-exact-single-context_haiku-4-5, 2026-05-03_05-43-31_mars-rover-prose_v3-basic-tdd_sonnet-4-6 (+1281 more sibling(s) not listed) — 2360 of them are reported below, and 767 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 3127 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 3127 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 3127 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — experiments/runs/2026-05-25_18-49-39_claim-office-example-mapping_v8b-delayed-refactor-native_opus-4-7-portkey-no-thinking/src/claim-office.ts:3
experiments/runs/2026-05-25_18-49-39_claim-office-example-mapping_v8b-delayed-refactor-native_opus-4-7-portkey-no-thinking/src/claim-office.ts:3 · experiments/runs/2026-05-25_18-54-44_claim-office-example-mapping_v8b-delayed-refactor-native_opus-4-7-portkey-no-thinking/src/claim-office.ts:3 — the two spans are one implementation copied and then locally edited — 653 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — experiments/runs/2026-05-25_18-49-39_claim-office-example-mapping_v8b-delayed-refactor-native_opus-4-7-portkey-no-thinking/src/claim-office.ts:3
experiments/runs/2026-07-24_15-48-37_claim-office-example-mapping_v6.2-with-why-cleaned-pi_opus-4-8-no-thinking/src/claim-office.ts:1 · experiments/runs/2026-07-25_19-11-36_claim-office-example-mapping_v6.2-with-why-cleaned-oc_opus-4-8-requesty/src/claim-office.ts:1 — the two spans are one implementation copied and then locally edited — 620 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — experiments/runs/2026-07-24_15-48-37_claim-office-example-mapping_v6.2-with-why-cleaned-pi_opus-4-8-no-thinking/src/claim-office.ts:1
experiments/runs/2026-05-21_10-49-45_claim-office-example-mapping_v3-basic-tdd_opus-4-6-portkey-no-thinking-2/src/claim-office.ts:18 · experiments/runs/2026-05-21_10-56-34_claim-office-example-mapping_v3-basic-tdd_opus-4-6-portkey-no-thinking/src/claim-office.ts:25 — the two spans are one implementation copied and then locally edited — 379 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — experiments/runs/2026-05-21_10-49-45_claim-office-example-mapping_v3-basic-tdd_opus-4-6-portkey-no-thinking-2/src/claim-office.ts:18
experiments/runs/2026-07-26_00-13-47_claim-office-example-mapping_v4-exact-subagents_opus-5-no-thinking-2/src/claim-office.ts:4 · experiments/runs/2026-08-10_18-13-18_claim-office-example-mapping_v6.6-lab-split-cc_opus-5-no-thinking/src/claim-office.ts:8 — the two spans are one implementation copied and then locally edited — 462 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — experiments/runs/2026-07-26_00-13-47_claim-office-example-mapping_v4-exact-subagents_opus-5-no-thinking-2/src/claim-office.ts:4
experiments/runs/2026-08-11_00-48-46_claim-office-example-mapping_v6.1-hybrid-testlist-scope-fix_opus-5-no-thinking/src/claim-office.ts:38 · experiments/runs/2026-08-17_07-16-10_claim-office-example-mapping_v6.2-with-why-cleaned_opus-5-no-thinking/src/claim-office.ts:70 — the two spans are one implementation copied and then locally edited — 581 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — experiments/runs/2026-08-11_00-48-46_claim-office-example-mapping_v6.1-hybrid-testlist-scope-fix_opus-5-no-thinking/src/claim-office.ts:38
experiments/runs/2026-08-17_06-45-48_claim-office-example-mapping_basic-sol-tdd-cc_opus-4-8-no-thinking/src/claim-office.ts:47 · experiments/runs/2026-08-17_06-46-12_claim-office-example-mapping_basic-sol-tdd-cc_opus-4-8-no-thinking/src/claim-office.ts:57 — the two spans are one implementation copied and then locally edited — 360 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — experiments/runs/2026-08-17_06-45-48_claim-office-example-mapping_basic-sol-tdd-cc_opus-4-8-no-thinking/src/claim-office.ts:47
experiments/runs/2026-08-17_07-00-06_claim-office-example-mapping_basic-sol-tdd-cc_opus-5-no-thinking/src/claim-office.ts:57 · experiments/runs/2026-08-17_07-04-36_claim-office-example-mapping_basic-sol-tdd-cc_opus-5-no-thinking/src/claim-office.ts:77 — the two spans are one implementation copied and then locally edited — 599 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — experiments/runs/2026-08-17_07-00-06_claim-office-example-mapping_basic-sol-tdd-cc_opus-5-no-thinking/src/claim-office.ts:57
experiments/runs/2026-08-10_08-17-05_claim-office-example-mapping_v5.1-testlist-scope-fix-pi_gpt-5-6-sol/src/claim-office.ts:5 · experiments/runs/2026-08-17_15-02-41_claim-office-example-mapping_basic-sol-tdd-app-measured-tool-pi_gpt-5-6-sol-codex/src/claim-office.ts:10 — the two spans are one implementation copied and then locally edited — 496 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — experiments/runs/2026-08-10_08-17-05_claim-office-example-mapping_v5.1-testlist-scope-fix-pi_gpt-5-6-sol/src/claim-office.ts:5
experiments/runs/2026-08-10_15-38-59_claim-office-example-mapping_v5.1-testlist-scope-fix_opus-5-no-thinking/src/claim-office.ts:65 · experiments/runs/2026-08-17_06-59-21_claim-office-example-mapping_basic-sol-tdd-cc_opus-5-no-thinking/src/claim-office.ts:78 — the two spans are one implementation copied and then locally edited — 530 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — experiments/runs/2026-08-10_15-38-59_claim-office-example-mapping_v5.1-testlist-scope-fix_opus-5-no-thinking/src/claim-office.ts:65
experiments/runs/2026-05-08_15-43-45_claim-office-example-mapping_v5-exact-single-context_opus-4-7-no-thinking/src/claim-office.ts:63 · experiments/runs/2026-05-08_16-04-50_claim-office-example-mapping_v5-exact-single-context_opus-4-7-no-thinking/src/claim-office.ts:104 — the two spans are one implementation copied and then locally edited — 488 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — experiments/runs/2026-05-08_15-43-45_claim-office-example-mapping_v5-exact-single-context_opus-4-7-no-thinking/src/claim-office.ts:63
experiments/runs/2026-08-05_02-03-30_claim-office-example-mapping_v6.2.1-phase-continuation-pi_opus-5-requesty-3/src/claim-office.ts:87 · experiments/runs/2026-09-04_06-20-44_claim-office-example-mapping_v6.1.1-lab-split-cc_opus-5-no-thinking/src/claim-office.ts:97 — the two spans are one implementation copied and then locally edited — 582 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — experiments/runs/2026-08-05_02-03-30_claim-office-example-mapping_v6.2.1-phase-continuation-pi_opus-5-requesty-3/src/claim-office.ts:87
experiments/runs/2026-08-16_21-17-00_claim-office-example-mapping_v3-basic-tdd-pi_gpt-5-6-sol-codex-3/src/claim-office.ts:25 · experiments/runs/2026-08-16_21-17-00_claim-office-example-mapping_v3-basic-tdd-pi_gpt-5-6-sol-codex/src/claim-office.ts:21 — the two spans are one implementation copied and then locally edited — 372 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — experiments/runs/2026-08-16_21-17-00_claim-office-example-mapping_v3-basic-tdd-pi_gpt-5-6-sol-codex-3/src/claim-office.ts:25
experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/src/scopes.ts:35 · experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/src/scopes.ts:129 — the two spans are one implementation copied and then locally edited — 432 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/src/scopes.ts:35
experiments/runs/2026-05-30_01-30-14_claim-office-example-mapping_v6.4-metric-driven-refactor_opus-4-8-no-thinking/src/claim-office.ts:33 · experiments/runs/2026-05-30_06-28-45_claim-office-example-mapping_v6.5-end-refactor_opus-4-8-no-thinking/src/claim-office.ts:32 — the two spans are one implementation copied and then locally edited — 417 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — experiments/runs/2026-05-30_01-30-14_claim-office-example-mapping_v6.4-metric-driven-refactor_opus-4-8-no-thinking/src/claim-office.ts:33
experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/src/async.js:1 · experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/src/sync.js:1 — these 2 files are line-for-line copies of one another — 60 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done. — experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/src/async.js:1
experiments/runs/2026-08-10_09-45-55_claim-office-example-mapping_v3-basic-tdd-pi_gpt-5-6-sol/src/claim-office.ts:4 · experiments/runs/2026-08-10_09-46-02_claim-office-example-mapping_v3-basic-tdd-pi_gpt-5-6-sol/src/claim-office.ts:1 — the two spans are one implementation copied and then locally edited — 596 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — experiments/runs/2026-08-10_09-45-55_claim-office-example-mapping_v3-basic-tdd-pi_gpt-5-6-sol/src/claim-office.ts:4
experiments/runs/2026-08-17_06-44-43_claim-office-example-mapping_basic-sol-tdd-cc_opus-4-8-no-thinking/src/claim-office.ts:172 · experiments/runs/2026-08-17_06-44-58_claim-office-example-mapping_basic-sol-tdd-cc_opus-4-8-no-thinking/src/claimOffice.ts:163 — the two spans are one implementation copied and then locally edited — 479 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — experiments/runs/2026-08-17_06-44-43_claim-office-example-mapping_basic-sol-tdd-cc_opus-4-8-no-thinking/src/claim-office.ts:172
experiments/runs/2026-07-24_15-24-24_claim-office-example-mapping_v6.2-with-why-cleaned-pi_opus-4-8-3/src/claim-office.ts:20 · experiments/runs/2026-08-17_07-16-10_claim-office-example-mapping_v6.2-with-why-cleaned_opus-5-no-thinking/src/claim-office.ts:89 — the two spans are one implementation copied and then locally edited — 472 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — experiments/runs/2026-07-24_15-24-24_claim-office-example-mapping_v6.2-with-why-cleaned-pi_opus-4-8-3/src/claim-office.ts:20
experiments/runs/2026-08-10_07-58-09_claim-office-example-mapping_v5.1-testlist-scope-fix-pi_gpt-5-6-sol/src/claim-office.ts:38 · experiments/runs/2026-08-10_08-17-05_claim-office-example-mapping_v5.1-testlist-scope-fix-pi_gpt-5-6-sol/src/claim-office.ts:28 — the two spans are one implementation copied and then locally edited — 481 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — experiments/runs/2026-08-10_07-58-09_claim-office-example-mapping_v5.1-testlist-scope-fix-pi_gpt-5-6-sol/src/claim-office.ts:38
experiments/runs/2026-05-25_18-36-34_claim-office-example-mapping_v8a-delayed-refactor-agent_opus-4-7-portkey-no-thinking/src/claim-office.ts:5 · experiments/runs/2026-05-25_18-58-01_claim-office-example-mapping_v8b-delayed-refactor-native_opus-4-7-portkey-no-thinking/src/claim-office.ts:3 — the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are. — experiments/runs/2026-05-25_18-36-34_claim-office-example-mapping_v8a-delayed-refactor-agent_opus-4-7-portkey-no-thinking/src/claim-office.ts:5
experiments/katas/game-of-life-cli-verification/adapter.ts:8 · experiments/katas/game-of-life-verification/adapter.ts:8 · experiments/runs/2026-05-12_22-34-20_game-of-life-cli-prose_v5-exact-single-context_haiku-4-5-portkey-no-thinking/.verification-adapter.ts:8 · experiments/runs/2026-05-12_22-43-03_game-of-life-cli-prose_v5-exact-single-context_opus-4-6-portkey-no-thinking-2/.verification-adapter.ts:8 · +499 more site(s) not listed — the 503 copies are spread across 503 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 503 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete. — experiments/katas/game-of-life-cli-verification/adapter.ts:8
experiments/runs/2026-08-10_15-38-59_claim-office-example-mapping_v5.1-testlist-scope-fix_opus-5-no-thinking/src/claim-office.ts:90 · experiments/runs/2026-08-17_07-03-06_claim-office-example-mapping_basic-sol-tdd-cc_opus-5-no-thinking/src/claim-office.ts:44 — the two spans are one implementation copied and then locally edited — 397 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — experiments/runs/2026-08-10_15-38-59_claim-office-example-mapping_v5.1-testlist-scope-fix_opus-5-no-thinking/src/claim-office.ts:90
experiments/runs/2026-05-27_03-39-46_claim-office-example-mapping_v6.4-metric-driven-refactor_opus-4-7-no-thinking/src/claim-office.ts:125 · experiments/runs/2026-07-24_15-24-24_claim-office-example-mapping_v6.2-with-why-cleaned-pi_opus-4-8-5/src/claim-office.ts:109 — the two spans are one implementation copied and then locally edited — 381 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — experiments/runs/2026-05-27_03-39-46_claim-office-example-mapping_v6.4-metric-driven-refactor_opus-4-7-no-thinking/src/claim-office.ts:125
experiments/runs/2026-05-22_19-29-21_claim-office-example-mapping_v6.1-hybrid-testlist-scope-fix_opus-4-7-portkey-no-thinking/src/claim-office.ts:1 · experiments/runs/2026-05-23_21-09-13_claim-office-example-mapping_v6.1-no-pep_opus-4-7-portkey-no-thinking-5/src/claim-office.ts:27 — the two spans are one implementation copied and then locally edited — 332 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — experiments/runs/2026-05-22_19-29-21_claim-office-example-mapping_v6.1-hybrid-testlist-scope-fix_opus-4-7-portkey-no-thinking/src/claim-office.ts:1
experiments/runs/2026-08-17_07-03-06_claim-office-example-mapping_basic-sol-tdd-cc_opus-5-no-thinking/src/claim-office.ts:29 · experiments/runs/2026-08-17_07-04-36_claim-office-example-mapping_basic-sol-tdd-cc_opus-5-no-thinking/src/claim-office.ts:89 — the two spans are one implementation copied and then locally edited — 418 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — experiments/runs/2026-08-17_07-03-06_claim-office-example-mapping_basic-sol-tdd-cc_opus-5-no-thinking/src/claim-office.ts:29
experiments/runs/2026-05-16_09-21-15_claim-office-prose_v1-oneshot_opus-4-7-no-thinking/src/types.ts:3 · experiments/runs/2026-05-16_09-38-15_claim-office-prose_v2-iterative_opus-4-7-no-thinking/src/types.ts:2 · experiments/runs/2026-05-16_09-42-34_claim-office-prose_v2-iterative_opus-4-7-no-thinking/src/types.ts:2 — the 3 copies are spread across 3 files, and the CITED SPAN is a run of DECLARATIONS inside a construct — the members of a type, or the entries of an object or array literal — with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal's entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or — where the copies are a literal's entries rather than a type's members — one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared — a decorator and its options, an annotation, a registration table's keys — the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases. — experiments/runs/2026-05-16_09-21-15_claim-office-prose_v1-oneshot_opus-4-7-no-thinking/src/types.ts:3
experiments/runs/2026-08-05_06-44-10_claim-office-example-mapping_v6.2.1-phase-continuation-pi_opus-5-requesty-no-thinking-2/src/claim-office.ts:1 · experiments/runs/2026-08-17_06-59-21_claim-office-example-mapping_basic-sol-tdd-cc_opus-5-no-thinking/src/claim-office.ts:1 — the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct — the members of a type, or the entries of an object or array literal — with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal's entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or — where the copies are a literal's entries rather than a type's members — one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared — a decorator and its options, an annotation, a registration table's keys — the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases. — experiments/runs/2026-08-05_06-44-10_claim-office-example-mapping_v6.2.1-phase-continuation-pi_opus-5-requesty-no-thinking-2/src/claim-office.ts:1
experiments/runs/2026-08-10_09-47-13_claim-office-example-mapping_v3-basic-tdd-pi_gpt-5-6-sol/src/claim-office.ts:36 · experiments/runs/2026-08-16_21-17-00_claim-office-example-mapping_v3-basic-tdd-pi_gpt-5-6-sol-codex-2/src/claim-office.ts:38 — the two spans are one implementation copied and then locally edited — 475 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — experiments/runs/2026-08-10_09-47-13_claim-office-example-mapping_v3-basic-tdd-pi_gpt-5-6-sol/src/claim-office.ts:36
experiments/runs/2026-09-04_06-20-44_claim-office-example-mapping_v6.1.1-lab-split-cc_opus-5-no-thinking-2/src/claim-office.ts:51 · experiments/runs/2026-09-04_06-20-44_claim-office-example-mapping_v6.1.1-lab-split-cc_opus-5-no-thinking-3/src/claim-office.ts:43 — the two spans are one implementation copied and then locally edited — 274 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — experiments/runs/2026-09-04_06-20-44_claim-office-example-mapping_v6.1.1-lab-split-cc_opus-5-no-thinking-2/src/claim-office.ts:51
experiments/runs/2026-05-24_23-18-18_claim-office-example-mapping_v6.2-with-why-cleaned_opus-4-7-portkey-no-thinking/src/claim-office.ts:12 · experiments/runs/2026-05-26_20-41-14_claim-office-example-mapping_v6.2-with-why-cleaned-pi_opus-4-7-portkey-no-thinking-3/src/claim-office.ts:11 — the two spans are one implementation copied and then locally edited — 198 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — experiments/runs/2026-05-24_23-18-18_claim-office-example-mapping_v6.2-with-why-cleaned_opus-4-7-portkey-no-thinking/src/claim-office.ts:12
experiments/runs/2026-05-25_00-20-13_claim-office-example-mapping_v6.2-with-why-cleaned_opus-4-7-portkey-no-thinking/src/claim-office.ts:1 · experiments/runs/2026-05-26_20-41-14_claim-office-example-mapping_v6.2-with-why-cleaned-pi_opus-4-7-portkey-no-thinking-2/src/claim-office.ts:1 — the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct — the members of a type, or the entries of an object or array literal — with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal's entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or — where the copies are a literal's entries rather than a type's members — one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared — a decorator and its options, an annotation, a registration table's keys — the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases. — experiments/runs/2026-05-25_00-20-13_claim-office-example-mapping_v6.2-with-why-cleaned_opus-4-7-portkey-no-thinking/src/claim-office.ts:1
experiments/runs/2026-07-25_19-51-19_claim-office-example-mapping_v6.2-with-why-cleaned-oc_opus-4-8-requesty/src/cli.ts:26 · experiments/runs/2026-07-27_15-46-00_claim-office-example-mapping_v6.6-lab-split-oc_opus-4-8-requesty-no-thinking/src/cli.ts:27 — the two spans are one implementation copied and then locally edited — 336 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — experiments/runs/2026-07-25_19-51-19_claim-office-example-mapping_v6.2-with-why-cleaned-oc_opus-4-8-requesty/src/cli.ts:26
experiments/runs/2026-05-08_16-04-50_claim-office-example-mapping_v5-exact-single-context_opus-4-7-no-thinking/src/claim-office.ts:1 · experiments/runs/2026-08-10_16-14-18_claim-office-example-mapping_v5.1-testlist-scope-fix_opus-5-no-thinking/src/claim-office.ts:1 — the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct — the members of a type, or the entries of an object or array literal — with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal's entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or — where the copies are a literal's entries rather than a type's members — one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared — a decorator and its options, an annotation, a registration table's keys — the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases. — experiments/runs/2026-05-08_16-04-50_claim-office-example-mapping_v5-exact-single-context_opus-4-7-no-thinking/src/claim-office.ts:1
experiments/runs/2026-05-26_11-19-00_claim-office-example-mapping_v6.2-with-why-cleaned-oc_opus-4-7-portkey-no-thinking/src/claim-office.ts:1 · experiments/runs/2026-05-27_03-39-46_claim-office-example-mapping_v6.4-metric-driven-refactor_opus-4-7-no-thinking/src/claim-office.ts:1 — the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct — the members of a type, or the entries of an object or array literal — with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal's entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or — where the copies are a literal's entries rather than a type's members — one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared — a decorator and its options, an annotation, a registration table's keys — the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases. — experiments/runs/2026-05-26_11-19-00_claim-office-example-mapping_v6.2-with-why-cleaned-oc_opus-4-7-portkey-no-thinking/src/claim-office.ts:1
experiments/runs/2026-08-17_06-44-43_claim-office-example-mapping_basic-sol-tdd-cc_opus-4-8-no-thinking/src/claim-office.ts:70 · experiments/runs/2026-08-17_06-45-48_claim-office-example-mapping_basic-sol-tdd-cc_opus-4-8-no-thinking/src/claim-office.ts:55 · experiments/runs/2026-08-17_06-46-12_claim-office-example-mapping_basic-sol-tdd-cc_opus-4-8-no-thinking/src/claim-office.ts:65 — the 3 copies are spread across 3 files, and the CITED SPAN is a run of DECLARATIONS inside a construct — the members of a type, or the entries of an object or array literal — with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal's entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or — where the copies are a literal's entries rather than a type's members — one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared — a decorator and its options, an annotation, a registration table's keys — the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases. — experiments/runs/2026-08-17_06-44-43_claim-office-example-mapping_basic-sol-tdd-cc_opus-4-8-no-thinking/src/claim-office.ts:70
experiments/runs/2026-08-05_06-44-10_claim-office-example-mapping_v6.2.1-phase-continuation-pi_opus-5-requesty-no-thinking-3/src/claim-office.ts:1 · experiments/runs/2026-08-17_06-44-43_claim-office-example-mapping_basic-sol-tdd-cc_opus-4-8-no-thinking/src/claim-office.ts:73 — the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct — the members of a type, or the entries of an object or array literal — with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal's entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or — where the copies are a literal's entries rather than a type's members — one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared — a decorator and its options, an annotation, a registration table's keys — the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases. — experiments/runs/2026-08-05_06-44-10_claim-office-example-mapping_v6.2.1-phase-continuation-pi_opus-5-requesty-no-thinking-3/src/claim-office.ts:1
What to do
Act on each finding's own remediation rather than one rule: the move depends on what recurs. Where the copies are executable blocks, give the shared part one home and call it from each site; where they are declarations, a listing, a specialisation already delegating to its base, or one shape repeated per entity, there is no call site and the move is a shared type, a generated set or a factory — sometimes there is nothing to extract.
React / JS · Architecture — Conformance to the detected frontend architecture layout (feature-sliced / layered src) plus cross-package deep-import rules (D-386).
Method: Conformance to the detected frontend layout (feature-sliced / layered src) plus cross-package deep-import rules, over the module graph. Deterministic.
experiments/runs/2026-08-10_15-25-37_claim-office-example-mapping_v3-basic-tdd_opus-5-no-thinking-2/bin/claim-office.mjs:8 reaches into another package with a relative path (../node_modules/tsx/dist/cli.mjs) — import the package by name instead. — experiments/runs/2026-08-10_15-25-37_claim-office-example-mapping_v3-basic-tdd_opus-5-no-thinking-2/bin/claim-office.mjs:8
React / JS · Code Health — Per-function cyclomatic/cognitive complexity from the token-level function scanner (D-386) — real branching, not a regex heuristic.
Method: Per-function cyclomatic/cognitive complexity from a token-level function scanner (real branching, not a regex heuristic), computed over every frontend function. Deterministic.
parse has cyclomatic complexity 216 and cognitive complexity 402; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/lib/parse.js:356
scan has cyclomatic complexity 92 and cognitive complexity 203; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/lib/scan.js:49
parse has cyclomatic complexity 88 and cognitive complexity 102; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/lexer.js:44
runCLI has cyclomatic complexity 44 and cognitive complexity 110; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — experiments/runs/2026-05-26_09-03-22_claim-office-example-mapping_v5.1-testlist-scope-fix-oc_mistral-medium-3-5/src/cli.ts:1
processScenario has cyclomatic complexity 39 and cognitive complexity 99; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — experiments/runs/2026-05-26_10-32-44_claim-office-example-mapping_v5.1-testlist-scope-fix-oc_mistral-medium-3-5/src/claim-office.ts:1
(anonymous) has cyclomatic complexity 39 and cognitive complexity 83; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — experiments/runs/2026-05-25_17-00-27_claim-office-example-mapping_v5.1-testlist-scope-fix-oc_gemini-3-5-flash/src/claim-office.ts:92
(anonymous) has cyclomatic complexity 38 and cognitive complexity 71; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — experiments/runs/2026-05-25_16-53-53_claim-office-example-mapping_v5.1-testlist-scope-fix-oc_gemini-3-5-flash/src/claim-office.ts:28
nextGeneration has cyclomatic complexity 34 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — experiments/runs/2026-08-05_00-01-18_game-of-life-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/src/game-of-life.ts:1
(anonymous) has cyclomatic complexity 32 and cognitive complexity 65; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — experiments/runs/2026-05-26_07-28-08_claim-office-example-mapping_v5.1-testlist-scope-fix-oc_mistral-medium-3-5-2/src/cli.ts:12
(anonymous) has cyclomatic complexity 31 and cognitive complexity 65; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — experiments/runs/2026-05-26_07-28-08_claim-office-example-mapping_v5.1-testlist-scope-fix-oc_mistral-medium-3-5/src/cli.ts:36
processScenario has cyclomatic complexity 30 and cognitive complexity 68; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — experiments/runs/2026-05-22_08-52-17_claim-office-example-mapping_v4.1-testlist-scope-fix_opus-4-7-portkey-no-thinking/src/claim-office.ts:30
(anonymous) has cyclomatic complexity 29 and cognitive complexity 76; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — experiments/runs/2026-07-25_03-40-48_claim-office-example-mapping_v6.2-with-why-cleaned-pi_deepseek-v4-pro-no-thinking/src/claim-office.ts:52
(anonymous) has cyclomatic complexity 29 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — experiments/runs/2026-05-15_07-33-51_claim-office-example-mapping_v5-exact-single-context_opus-4-7-no-thinking/src/claim-office.ts:65
tryParseExportStatement has cyclomatic complexity 28 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/lexer.js:334
(anonymous) has cyclomatic complexity 26 and cognitive complexity 65; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — experiments/runs/2026-07-25_03-22-18_claim-office-example-mapping_v6.2-with-why-cleaned-pi_deepseek-v4-pro/src/claim-office.ts:65
(anonymous) has cyclomatic complexity 26 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — experiments/runs/2026-05-16_22-34-24_claim-office-example-mapping_v7-hybrid-green-refactor_opus-4-7-no-thinking/src/claim-office.ts:38
processScenario has cyclomatic complexity 26 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — experiments/runs/2026-05-26_06-48-59_claim-office-example-mapping_v5.1-testlist-scope-fix-oc_mistral-medium-3-5/src/claim-office.ts:93
claimOffice has cyclomatic complexity 24 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — experiments/runs/2026-05-21_15-29-15_claim-office-example-mapping_v4.1-testlist-scope-fix_opus-4-6-portkey-no-thinking-2/src/claim-office.ts:35
(anonymous) has cyclomatic complexity 24 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — experiments/runs/2026-07-25_03-18-36_claim-office-example-mapping_v6.2-with-why-cleaned-pi_deepseek-v4-pro-no-thinking/src/claim-office.ts:110
(anonymous) has cyclomatic complexity 24 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — experiments/runs/2026-05-11_23-37-46_claim-office-example-mapping_v5-exact-single-context_opus-4-6-portkey-no-thinking/src/claim-office.ts:52
main has cyclomatic complexity 23 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — experiments/runs/2026-05-09_09-02-47_claim-office-example-mapping_v3-basic-tdd_haiku-4-5/src/cli.ts:43
processClaim has cyclomatic complexity 22 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — experiments/runs/2026-05-16_09-56-09_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking/src/claim.ts:49
processClaim has cyclomatic complexity 22 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — experiments/runs/2026-05-25_09-28-06_claim-office-example-mapping_v5.1-testlist-scope-fix-oc_kimi-k2-6/src/engine.ts:180
tryParseImportStatement has cyclomatic complexity 22 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/lexer.js:246
computeClaim has cyclomatic complexity 22 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — experiments/runs/2026-10-20_04-41-17_claim-office-example-mapping_exact-subagents-v1-cc_opus-4-6-requesty-no-thinking/src/claim-office.ts:114
isExpressionKeyword has cyclomatic complexity 22 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/lexer.js:878
run has cyclomatic complexity 21 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — experiments/runs/2026-10-19_06-21-05_claim-office-example-mapping_exact-single-context-v2-testlist-fix-oc_deepseek-v4-pro-requesty/src/cli.ts:75
extglobClose has cyclomatic complexity 21 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/lib/parse.js:539
readEscapedChar has cyclomatic complexity 21 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/lexer.js:526
runScenario has cyclomatic complexity 20 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — experiments/runs/2026-09-24_04-50-54_claim-office-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex-5/src/office.ts:10
_encodeGeneratedRanges has cyclomatic complexity 20 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/src/scopes.ts:243
processClaim has cyclomatic complexity 20 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — experiments/runs/2026-05-25_09-15-01_claim-office-example-mapping_v5.1-testlist-scope-fix-oc_gemini-3-5-flash/src/claim-office.ts:125
visit has cyclomatic complexity 19 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. (×2) — experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/src/async.js:55, experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/src/sync.js:55
main has cyclomatic complexity 19 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — experiments/runs/2026-05-19_00-48-02_claim-office-example-mapping_v4-exact-subagents_opus-4-6-portkey-no-thinking-2/src/cli.ts:51
processScenario has cyclomatic complexity 19 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — experiments/runs/2026-05-21_10-56-34_claim-office-example-mapping_v3-basic-tdd_opus-4-6-portkey-no-thinking/src/claim-office.ts:177
parseRepeatedExtglob has cyclomatic complexity 19 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/lib/parse.js:164
(anonymous) has cyclomatic complexity 19 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — experiments/runs/2026-08-16_21-17-00_claim-office-example-mapping_v3-basic-tdd-pi_gpt-5-6-sol-codex-2/src/claim-office.ts:103
handleClaim has cyclomatic complexity 19 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — experiments/runs/2026-05-25_16-40-46_claim-office-example-mapping_v5.1-testlist-scope-fix-oc_gemini-3-5-flash/src/claim-office.ts:131
nextGeneration has cyclomatic complexity 19 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — experiments/runs/2026-07-25_12-20-43_game-of-life-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/src/game-of-life.ts:24
Do you agree with this assessment?
R3 · Large Files9.9 / 10Exemplary✓ Tool-verified
React / JS · Code Health — How many source files exceed the large-file threshold.
Method: Components/modules exceeding the large-file threshold, counted exhaustively across the frontend source tree. Deterministic.
experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/lib/parse.js has 1140 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/lib/parse.js:1
experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/lexer.js has 932 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/lexer.js:1
experiments/runs/2026-10-19_00-53-39_claim-office-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking-2/src/claim-office.ts has 496 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — experiments/runs/2026-10-19_00-53-39_claim-office-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking-2/src/claim-office.ts:1
experiments/runs/2026-08-11_01-07-01_claim-office-example-mapping_v6.6-lab-split-cc_opus-5-no-thinking/src/claim-office.ts has 489 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — experiments/runs/2026-08-11_01-07-01_claim-office-example-mapping_v6.6-lab-split-cc_opus-5-no-thinking/src/claim-office.ts:1
experiments/runs/2026-08-10_18-13-18_claim-office-example-mapping_v6.6-lab-split-cc_opus-5-no-thinking/src/claim-office.ts has 451 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — experiments/runs/2026-08-10_18-13-18_claim-office-example-mapping_v6.6-lab-split-cc_opus-5-no-thinking/src/claim-office.ts:1
experiments/runs/2026-09-04_14-03-39_claim-office-example-mapping_v6.1.4-continuation-guard-cc_opus-5-no-thinking/src/claim-office.ts has 449 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — experiments/runs/2026-09-04_14-03-39_claim-office-example-mapping_v6.1.4-continuation-guard-cc_opus-5-no-thinking/src/claim-office.ts:1
experiments/runs/2026-09-03_23-16-54_claim-office-example-mapping_v6.1.1-lab-split-cc_opus-5-no-thinking/src/claim-office.ts has 448 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — experiments/runs/2026-09-03_23-16-54_claim-office-example-mapping_v6.1.1-lab-split-cc_opus-5-no-thinking/src/claim-office.ts:1
experiments/runs/2026-09-12_23-52-37_claim-office-example-mapping_exact-hybrid-v2.9-stack-profile-cc_opus-5-no-thinking/src/claim-office.ts has 444 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — experiments/runs/2026-09-12_23-52-37_claim-office-example-mapping_exact-hybrid-v2.9-stack-profile-cc_opus-5-no-thinking/src/claim-office.ts:1
experiments/runs/2026-09-17_00-24-43_claim-office-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking-4/src/claim-office.ts has 438 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — experiments/runs/2026-09-17_00-24-43_claim-office-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking-4/src/claim-office.ts:1
experiments/runs/2026-08-17_07-30-11_claim-office-example-mapping_v6.2-with-why-cleaned_opus-5-no-thinking/src/claim-office.ts has 430 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — experiments/runs/2026-08-17_07-30-11_claim-office-example-mapping_v6.2-with-why-cleaned_opus-5-no-thinking/src/claim-office.ts:1
experiments/runs/2026-08-17_08-46-28_claim-office-example-mapping_v6.2-with-why-cleaned_opus-5-no-thinking/src/claim-office.ts has 425 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — experiments/runs/2026-08-17_08-46-28_claim-office-example-mapping_v6.2-with-why-cleaned_opus-5-no-thinking/src/claim-office.ts:1
experiments/runs/2026-09-05_09-40-45_claim-office-example-mapping_v6.1.5-pure-split-cc_opus-5-no-thinking/src/claim-office.ts has 425 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — experiments/runs/2026-09-05_09-40-45_claim-office-example-mapping_v6.1.5-pure-split-cc_opus-5-no-thinking/src/claim-office.ts:1
experiments/runs/2026-08-11_01-43-28_claim-office-example-mapping_v6.6-lab-split-cc_opus-5-no-thinking/src/claim-office.ts has 404 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — experiments/runs/2026-08-11_01-43-28_claim-office-example-mapping_v6.6-lab-split-cc_opus-5-no-thinking/src/claim-office.ts:1
What to do
Split each oversized file along the responsibilities already in it, into smaller focused modules in the same package.
Do you agree with this assessment?
R4 · Test Coverage6.6 / 10Strong✓ Tool-verified
React / JS · Readiness — Static test reachability (D-386): the share of production files reachable from any test via the import graph — measured without running anything.
Method: Static test reachability: the share of production files reachable from any test via the import graph — measured without running anything. Deterministic.
experiments/runs/2026-05-12_04-33-35_claim-office-prose_v5-exact-single-context_haiku-4-5-portkey/src/claim-office.spec.ts:2 imports './claim-office.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing. — experiments/runs/2026-05-12_04-33-35_claim-office-prose_v5-exact-single-context_haiku-4-5-portkey/src/claim-office.spec.ts:2
experiments/runs/2026-05-12_04-59-28_claim-office-example-mapping_v5-exact-single-context_haiku-4-5-portkey/src/mhpco.spec.ts:2 imports './mhpco.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing. — experiments/runs/2026-05-12_04-59-28_claim-office-example-mapping_v5-exact-single-context_haiku-4-5-portkey/src/mhpco.spec.ts:2
experiments/runs/2026-05-12_04-59-54_claim-office-prose_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/mhpco.spec.ts:2 imports './mhpco.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing. — experiments/runs/2026-05-12_04-59-54_claim-office-prose_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/mhpco.spec.ts:2
experiments/runs/2026-05-12_05-00-21_claim-office-example-mapping_v5-exact-single-context_haiku-4-5-portkey/src/claims-office.spec.ts:2 imports './claims-office.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing. — experiments/runs/2026-05-12_05-00-21_claim-office-example-mapping_v5-exact-single-context_haiku-4-5-portkey/src/claims-office.spec.ts:2
experiments/runs/2026-05-12_05-05-25_claim-office-prose_v5-exact-single-context_haiku-4-5-portkey/src/quote.spec.ts:2 imports './quote.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing. — experiments/runs/2026-05-12_05-05-25_claim-office-prose_v5-exact-single-context_haiku-4-5-portkey/src/quote.spec.ts:2
experiments/runs/2026-05-12_05-26-27_claim-office-example-mapping_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/claim-office.spec.ts:2 imports './claim-office.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing. — experiments/runs/2026-05-12_05-26-27_claim-office-example-mapping_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/claim-office.spec.ts:2
experiments/runs/2026-05-12_05-26-56_claim-office-user-story_v5-exact-single-context_haiku-4-5-portkey/src/premium.spec.ts:2 imports './premium.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing. — experiments/runs/2026-05-12_05-26-56_claim-office-user-story_v5-exact-single-context_haiku-4-5-portkey/src/premium.spec.ts:2
experiments/runs/2026-05-12_05-35-05_claim-office-example-mapping_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/mhpco.spec.ts:2 imports './mhpco.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing. — experiments/runs/2026-05-12_05-35-05_claim-office-example-mapping_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/mhpco.spec.ts:2
experiments/runs/2026-05-12_05-40-02_claim-office-example-mapping_v5-exact-single-context_haiku-4-5-portkey/src/claim-office.spec.ts:2 imports './claim-office.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing. — experiments/runs/2026-05-12_05-40-02_claim-office-example-mapping_v5-exact-single-context_haiku-4-5-portkey/src/claim-office.spec.ts:2
experiments/runs/2026-05-12_06-23-47_claim-office-user-story_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/claim-office.spec.ts:2 imports './claim-office.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing. — experiments/runs/2026-05-12_06-23-47_claim-office-user-story_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/claim-office.spec.ts:2
experiments/runs/2026-05-12_07-46-30_claim-office-prose_v5-exact-single-context_haiku-4-5-portkey/src/claim-office.spec.ts:2 imports './quote.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either (1 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing. — experiments/runs/2026-05-12_07-46-30_claim-office-prose_v5-exact-single-context_haiku-4-5-portkey/src/claim-office.spec.ts:2
experiments/runs/2026-05-12_07-47-45_claim-office-prose_v5-exact-single-context_haiku-4-5-portkey/src/claim-office.spec.ts:2 imports './claim-office.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing. — experiments/runs/2026-05-12_07-47-45_claim-office-prose_v5-exact-single-context_haiku-4-5-portkey/src/claim-office.spec.ts:2
experiments/runs/2026-05-12_07-51-23_claim-office-prose_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/mhpco.spec.ts:2 imports './mhpco.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing. — experiments/runs/2026-05-12_07-51-23_claim-office-prose_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/mhpco.spec.ts:2
experiments/runs/2026-05-12_08-28-35_claim-office-example-mapping_v5-exact-single-context_haiku-4-5-portkey/src/claim-office.spec.ts:2 imports './claim-office.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing. — experiments/runs/2026-05-12_08-28-35_claim-office-example-mapping_v5-exact-single-context_haiku-4-5-portkey/src/claim-office.spec.ts:2
experiments/runs/2026-05-12_08-52-11_claim-office-example-mapping_v5-exact-single-context_haiku-4-5-portkey/src/claim-office.spec.ts:2 imports './claim-office.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing. — experiments/runs/2026-05-12_08-52-11_claim-office-example-mapping_v5-exact-single-context_haiku-4-5-portkey/src/claim-office.spec.ts:2
experiments/runs/2026-05-12_09-04-49_claim-office-user-story_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/claim-office.spec.ts:2 imports './claim-office.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing. — experiments/runs/2026-05-12_09-04-49_claim-office-user-story_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/claim-office.spec.ts:2
experiments/runs/2026-05-12_09-36-31_claim-office-user-story_v5-exact-single-context_haiku-4-5-portkey/src/claim-office.spec.ts:2 imports './claim-office.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing. — experiments/runs/2026-05-12_09-36-31_claim-office-user-story_v5-exact-single-context_haiku-4-5-portkey/src/claim-office.spec.ts:2
experiments/runs/2026-05-12_23-12-53_game-of-life-cli-prose_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/gameOfLife.spec.ts:2 imports './gameOfLife.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing. — experiments/runs/2026-05-12_23-12-53_game-of-life-cli-prose_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/gameOfLife.spec.ts:2
experiments/runs/2026-05-23_21-38-24_claim-office-example-mapping_v6.1-no-emoji_opus-4-7-portkey-no-thinking/src/claim-office.spec.ts:2 imports './claim-office.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing. — experiments/runs/2026-05-23_21-38-24_claim-office-example-mapping_v6.1-no-emoji_opus-4-7-portkey-no-thinking/src/claim-office.spec.ts:2
experiments/runs/2026-09-13_10-54-15_claim-office-example-mapping_exact-hybrid-v2.9-stack-profile-cc_opus-5-no-thinking/src/claim-office.spec.ts:2 imports './claim-office.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing. — experiments/runs/2026-09-13_10-54-15_claim-office-example-mapping_exact-hybrid-v2.9-stack-profile-cc_opus-5-no-thinking/src/claim-office.spec.ts:2
No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one. (×20) — experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/lib/parse.js:1, experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/lexer.js:1, experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/lib/scan.js:1, …
What to do
Add tests that import the unreached modules (directly or through their public entry).
React / JS · Readiness — How outdated the npm dependencies are (a maturity signal). JS/npm CVEs are scored separately in D30 (JS/npm Dependency Vulnerabilities).
Method: npm dependency staleness from manifest/registry metadata (a maturity signal; JS/npm CVEs are scored separately in D30, which answers dependency vulnerabilities for every ecosystem). Deterministic.
Do you agree with this assessment?
R6 · Tooling10.0 / 10Exemplary✓ Tool-verified
React / JS · Readiness — Whether the project wires up test, lint and typecheck — detected from each package.json script's COMMAND (eslint / tsc / vitest / jest / playwright), not just its name, and corroborated against CI-workflow invocations so a tool run only in CI still counts.
Method: package.json scanned for test/lint/typecheck script wiring. Deterministic presence check.
This repository declares test tooling, and the ✓ above records that declaration — but experiments/runs/2026-05-12_04-33-35_claim-office-prose_v5-exact-single-context_haiku-4-5-portkey/src/claim-office.spec.ts and 19 other test file(s) in this workspace cannot be loaded at all: it imports a module that names no file in this repository, so the runner throws while collecting it and none of its cases execute. The wiring is present and the suite it points at does not run as written, which is why the tooling tick must not be read as a statement that the tests pass. Fix the unloadable file(s) — each one is reported with its failing import under Test Coverage — then the declared script exercises what it claims to. — experiments/runs/2026-05-12_04-33-35_claim-office-prose_v5-exact-single-context_haiku-4-5-portkey/src/claim-office.spec.ts:2
Do you agree with this assessment?
R7 · Dead Code7.7 / 10Strong✓ Tool-verified
React / JS · Code Health — Files unreachable from every application/tooling/test entry point, and exports nothing imports (module-graph reachability, D-386).
Method: Dead code: files unreachable from every application/tooling/test entry point plus exports nothing imports, via module-graph reachability. Deterministic, exhaustive over the import graph.
6 file(s) (~317 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package.
4 file(s) (~210 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — experiments/runs/2026-05-09_14-35-40_claim-office-example-mapping_v4-exact-subagents_haiku-4-5
4 file(s) (~333 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — experiments/runs/2026-05-09_15-02-58_claim-office-example-mapping_v4-exact-subagents_haiku-4-5
4 file(s) (~365 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — experiments/runs/2026-05-09_15-46-10_claim-office-example-mapping_v4-exact-subagents_haiku-4-5
4 file(s) (~395 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. (×2) — experiments/runs/2026-05-09_17-39-40_claim-office-example-mapping_v4-exact-subagents_haiku-4-5-no-thinking, experiments/runs/2026-05-10_07-09-01_claim-office-example-mapping_v4-exact-subagents_sonnet-4-6
4 file(s) (~435 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — experiments/runs/2026-05-09_18-25-01_claim-office-example-mapping_v4-exact-subagents_haiku-4-5-no-thinking
4 file(s) (~196 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — experiments/runs/2026-05-09_23-33-37_claim-office-example-mapping_v4-exact-subagents_haiku-4-5-no-thinking
4 file(s) (~722 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — experiments/runs/2026-05-09_23-53-39_claim-office-example-mapping_v4-exact-subagents_opus-4-7
5 file(s) (~292 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — experiments/runs/2026-05-10_09-28-12_claim-office-example-mapping_v4-exact-subagents_haiku-4-5-no-thinking
4 file(s) (~665 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — experiments/runs/2026-05-12_01-37-27_claim-office-user-story_v5-exact-single-context_opus-4-6-portkey-no-thinking
4 file(s) (~512 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — experiments/runs/2026-05-12_01-37-28_claim-office-user-story_v5-exact-single-context_opus-4-6-portkey
2 file(s) (~307 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — experiments/runs/2026-05-12_01-37-28_claim-office-user-story_v5-exact-single-context_opus-4-6-portkey-2
2 file(s) (~432 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — experiments/runs/2026-05-12_01-37-28_claim-office-user-story_v5-exact-single-context_opus-4-6-portkey-no-thinking
2 file(s) (~525 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — experiments/runs/2026-05-12_01-37-57_claim-office-user-story_v5-exact-single-context_opus-4-6-portkey-no-thinking
4 file(s) (~212 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. (×2) — experiments/runs/2026-05-12_04-00-43_claim-office-example-mapping_v5-exact-single-context_haiku-4-5-portkey-no-thinking, experiments/runs/2026-05-12_05-08-40_claim-office-prose_v5-exact-single-context_haiku-4-5-portkey
3 file(s) (~98 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — experiments/runs/2026-05-12_04-33-35_claim-office-prose_v5-exact-single-context_haiku-4-5-portkey
3 file(s) (~95 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — experiments/runs/2026-05-12_04-59-28_claim-office-example-mapping_v5-exact-single-context_haiku-4-5-portkey
3 file(s) (~94 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — experiments/runs/2026-05-12_04-59-54_claim-office-prose_v5-exact-single-context_haiku-4-5-portkey-no-thinking
3 file(s) (~99 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — experiments/runs/2026-05-12_05-00-21_claim-office-example-mapping_v5-exact-single-context_haiku-4-5-portkey
3 file(s) (~119 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — experiments/runs/2026-05-12_05-05-25_claim-office-prose_v5-exact-single-context_haiku-4-5-portkey
4 file(s) (~216 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — experiments/runs/2026-05-12_05-11-21_claim-office-prose_v5-exact-single-context_haiku-4-5-portkey-no-thinking
3 file(s) (~108 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — experiments/runs/2026-05-12_05-26-27_claim-office-example-mapping_v5-exact-single-context_haiku-4-5-portkey-no-thinking
3 file(s) (~87 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. (×2) — experiments/runs/2026-05-12_05-26-56_claim-office-user-story_v5-exact-single-context_haiku-4-5-portkey, experiments/runs/2026-05-12_08-52-11_claim-office-example-mapping_v5-exact-single-context_haiku-4-5-portkey
3 file(s) (~114 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — experiments/runs/2026-05-12_05-35-05_claim-office-example-mapping_v5-exact-single-context_haiku-4-5-portkey-no-thinking
4 file(s) (~222 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — experiments/runs/2026-05-12_05-35-37_claim-office-user-story_v5-exact-single-context_haiku-4-5-portkey
3 file(s) (~137 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — experiments/runs/2026-05-12_05-40-02_claim-office-example-mapping_v5-exact-single-context_haiku-4-5-portkey
3 file(s) (~110 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — experiments/runs/2026-05-12_06-23-47_claim-office-user-story_v5-exact-single-context_haiku-4-5-portkey-no-thinking
4 file(s) (~238 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — experiments/runs/2026-05-12_06-27-47_claim-office-user-story_v5-exact-single-context_haiku-4-5-portkey-no-thinking
4 file(s) (~110 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — experiments/runs/2026-05-12_06-37-20_claim-office-user-story_v5-exact-single-context_haiku-4-5-portkey-no-thinking
3 file(s) (~105 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — experiments/runs/2026-05-12_07-46-30_claim-office-prose_v5-exact-single-context_haiku-4-5-portkey
3 file(s) (~90 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — experiments/runs/2026-05-12_07-47-45_claim-office-prose_v5-exact-single-context_haiku-4-5-portkey
3 file(s) (~127 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — experiments/runs/2026-05-12_07-51-23_claim-office-prose_v5-exact-single-context_haiku-4-5-portkey-no-thinking
4 file(s) (~143 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — experiments/runs/2026-05-12_07-52-17_claim-office-prose_v5-exact-single-context_haiku-4-5-portkey-no-thinking
3 file(s) (~101 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — experiments/runs/2026-05-12_08-28-35_claim-office-example-mapping_v5-exact-single-context_haiku-4-5-portkey
4 file(s) (~240 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — experiments/runs/2026-05-12_08-36-07_claim-office-example-mapping_v5-exact-single-context_haiku-4-5-portkey-no-thinking
4 file(s) (~103 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — experiments/runs/2026-05-12_08-47-44_claim-office-user-story_v5-exact-single-context_haiku-4-5-portkey-no-thinking
4 file(s) (~219 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — experiments/runs/2026-05-12_08-48-35_claim-office-user-story_v5-exact-single-context_haiku-4-5-portkey
What to do
Delete the dead files and unused exports — every line is maintenance cost and rebuild-estimate inflation with zero runtime value.
React / JS · Readiness — npm dependency truthfulness (D-386): unused dependencies, imports not declared anywhere, and type-/test-only packages shipped as production deps.
Method: npm dependency truthfulness: unused dependencies, imports declared nowhere, and type-/test-only packages shipped as production deps — from the manifest + import graph. Deterministic.
Imported only as a TYPE and declared in no reachable package.json. The import is erased at compile time, so nothing is installed and no runtime resolution depends on it — but type-checking a clean clone will fail. Declare the typings it resolves through (or the package itself) in the owning package.json. — experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/types/internal/lightningcssOptions.d.ts:4
Declared in experiments/runs/2026-05-12_06-07-32_claim-office-user-story_v5-exact-single-context_sonnet-4-6-portkey/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it. — experiments/runs/2026-05-12_06-07-32_claim-office-user-story_v5-exact-single-context_sonnet-4-6-portkey/package.json:26
Declared in experiments/runs/2026-05-12_07-22-03_claim-office-prose_v5-exact-single-context_sonnet-4-6-portkey-no-thinking-2/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it. — experiments/runs/2026-05-12_07-22-03_claim-office-prose_v5-exact-single-context_sonnet-4-6-portkey-no-thinking-2/package.json:25
Declared in experiments/runs/2026-05-13_00-24-43_game-of-life-cli-example-mapping_v5-exact-single-context_haiku-4-5-portkey-no-thinking/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it. — experiments/runs/2026-05-13_00-24-43_game-of-life-cli-example-mapping_v5-exact-single-context_haiku-4-5-portkey-no-thinking/package.json:25
Declared in experiments/runs/2026-05-27_23-24-13_game-of-life-example-mapping_v5.1-testlist-scope-fix-oc_deepseek-v4-flash/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it. — experiments/runs/2026-05-27_23-24-13_game-of-life-example-mapping_v5.1-testlist-scope-fix-oc_deepseek-v4-flash/package.json:26
Declared in experiments/runs/2026-07-25_01-23-55_claim-office-example-mapping_v6.2-with-why-cleaned-pi_minimax-m3-no-thinking-4/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it. — experiments/runs/2026-07-25_01-23-55_claim-office-example-mapping_v6.2-with-why-cleaned-pi_minimax-m3-no-thinking-4/package.json:26
Declared in experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it. (×3) — experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package.json:21, experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package.json:22, experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package.json:23
Declared in experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it. (×5) — experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/package.json:52, experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/package.json:54, experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/package.json:55, …
Declared in experiments/runs/2026-08-17_00-17-09_sphinx-score-example-mapping_basic-sol-tdd-subagent-pi_gpt-5-3-codex-spark-2/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it. — experiments/runs/2026-08-17_00-17-09_sphinx-score-example-mapping_basic-sol-tdd-subagent-pi_gpt-5-3-codex-spark-2/package.json:25
Declared in experiments/runs/2026-08-17_00-37-28_sphinx-score-example-mapping_basic-sol-tdd-pi_gpt-5-3-codex-spark-3/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it. — experiments/runs/2026-08-17_00-37-28_sphinx-score-example-mapping_basic-sol-tdd-pi_gpt-5-3-codex-spark-3/package.json:25
Declared in experiments/runs/2026-08-17_00-43-42_sphinx-score-example-mapping_basic-sol-tdd-subagent-pi_gpt-5-3-codex-spark/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it. — experiments/runs/2026-08-17_00-43-42_sphinx-score-example-mapping_basic-sol-tdd-subagent-pi_gpt-5-3-codex-spark/package.json:26
What to do
Remove unused dependencies, declare unlisted imports explicitly, and demote type-/test-only packages to devDependencies.
React / JS · Architecture — Import cycles in the module graph (D-386) — files that can only be understood and changed together.
Method: Import cycles in the module graph, detected exhaustively over JS/TS imports (the same cycle detection as the .NET coupling dimension). Deterministic.
Other · Code Health — Whether the code avoids sync-over-async (deadlock-prone blocking on tasks) and async void.
Method: Roslyn syntax scan: async methods scanned for .Wait()/.GetAwaiter().GetResult() and async-void outside event handlers. Deterministic, hard fact per invocation.
Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.
Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X13 · Undrained process stream10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a child process that has BOTH standard streams redirected drains both — reading one to the end while the other is never read deadlocks once the child fills the unread pipe.
Method: Roslyn syntax + semantics: ProcessStartInfo launches with both streams redirected, checked for a drain of each stream across the enclosing type. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `spawn` imported from `child_process` whose stdout and stderr are both pipes (no options, no `stdio`, or `stdio` of `'pipe'`), bound to a local that never leaves its scope, where exactly one of the two streams is read, the other never, and the child’s `close`/`exit` (or the read stream’s end) is awaited; a shell redirect in the call’s arguments or a `kill` of the child suppresses it. The same rule reads Python’s `subprocess.Popen`, Dart’s `Process.start`, Ruby’s `Open3.popen3`, and Scala’s JDK process starts (`new ProcessBuilder(…).start()` with no `redirectErrorStream`/`redirectError`/`redirectOutput`/`inheritIO`, `Runtime.getRuntime.exec`) where one of `getInputStream`/`getErrorStream` is read and the other never while `waitFor()` is called or the read stream is read to its end. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a loop that shortens a string until it fits a length budget has a floor — one with none grinds the value down to the empty string, or past it into a negative-length `Substring`.
Method: Roslyn syntax + semantics: while/do loops whose body's only effect on a string is to drop its last character, checked for whether anything — a direct comparison on the length, a body guard, a break — bounds that length below. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `while`/`do` loop whose body’s one assignment to a value is `x = x.slice(0, -1)` or `x = x.slice|substring|substr(0, x.length - 1)`, driven by a condition that reads `x.length` only as a term of a larger expression — never compared directly, never tested for truthiness, and with no other read of `x` — and whose body has no `break`, `return`, `throw` or `if` naming `x`. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a method that temporarily changes state belonging to the whole process — the working directory, an environment variable — puts it back on EVERY path: a restore reached only when nothing throws leaks the change to the rest of the process.
Method: Roslyn syntax + semantics: method bodies that write the process working directory or an environment variable and write it back in the same body, checked for whether that restore sits in a `finally`/`catch` or only on the straight-line path. On a repository with no .NET source the same rule reads production JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not): `process.chdir`, `process.env.NAME =`/`["NAME"] =` and `delete process.env.NAME`, and Deno’s `Deno.chdir`/`Deno.env.set`/`Deno.env.delete`, paired per function body (a nested function or arrow is its own body, and module top-level code is none), where the last write puts back a local the body captured from the same global or deletes a variable the first write set, with at least one statement between them; a write in a `catch`/`finally` of that body silences it. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X24 · Document value interpolated into markup unescaped10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether text read out of the document being converted is escaped before it is written into generated markup — a value the document's author chose, interpolated into an attribute the surrounding literal delimits, can close that attribute and open another.
Method: Roslyn semantic model over the whole compilation: a string-typed `Value`/`InnerText`/`InnerXml`/`Text` member declared inside `DocumentFormat.OpenXml` or `System.Xml` is a taint SOURCE, propagated through assignments, returns, arguments, tuple elements and string composition to its transitive closure, then read at interpolated-string holes that sit in a markup position the surrounding literal itself delimits. Escaper/encoder calls and enclosing validator conditions cut the flow. Flow- and container-insensitive by construction. A second arm needs no provenance at all and reports a type that CONTRADICTS ITSELF — the same expression escaped at one delimited markup hole and interpolated raw at another hole in the same markup position of the same type, which the type's own escaping proves is a defect without knowing where the value came from. On a repository with no .NET source it reads JavaScript/TypeScript off the token stream with the same rule: a DOM read of raw document text (`getAttribute`, `textContent`, `innerText`, `nodeValue`) is the source, propagated through local bindings and string composition, and judged at template-literal and concatenation holes in the same two delimited markup positions; escapers and validating conditions cut it, and documentation-site, test, vendored and minified scripts are not read. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a value the caller is invited to supply is the value the type actually uses — a constructor parameter stored in a private field that nothing ever reads while the default it was given is spelled out a second time at the site that should have read it, a keyed lookup that falls back to a different setting than the one its key names while the same type falls back to the matching one for that same key, or a culture-sensitive parse given no format provider by a type that feeds its own settable culture to the same kind of parse elsewhere, or a number an entry point writes to standard output under the host's culture while the same entry point formats with the invariant culture elsewhere. Either way, every caller who supplies a value silently gets something else.
Method: Roslyn syntax: private instance fields of a non-partial type assigned in a constructor from one of its own parameters with a `??` fallback, checked for whether anything in the type body reads the field and whether that same fallback expression is spelled out again outside the constructor; and `??` fallbacks onto a member access from a lookup call carrying exactly one string literal, grouped by that key across the type and checked for a fallback member whose folded name disagrees with the key while a sibling site for the same key agrees with it. On a repository with no .NET source the first two arms read JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `#x`, `private` or `private` parameter-property instance field filled in the constructor from a parameter (or one member of one) through `??`/`||` or a parameter default, never read anywhere in the file by name, whose constructed default is spelled again in the class body; and `lookup("key") ?? s.member` grouped by key per class, or per module outside every class. The culture arm has no JavaScript counterpart: its parses take no locale. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a condition that tests a value for emptiness indexes that same value only where the test holds — an `||` written one parenthesis too far to the left leaves an index access outside the guard beside it, so the empty case the guard exists to anticipate reaches the index and throws.
Method: Roslyn syntax only, no semantic model: the OUTERMOST `&&`/`||` of every boolean condition, read for a symbol the condition tests for emptiness (`string.IsNullOrEmpty`/`IsNullOrWhiteSpace`, a `Length`/`Count` comparison against a literal, `Any()`, a `Length`/`Count` pattern, or a comparison against `""`) and ALSO indexes. Each `symbol[...]` access is placed by a boolean-reachability walk from the access up to the outermost connective: an access is COVERED when some enclosing step has it in the right operand and the left operand, under the truth value that step forces, proves the symbol non-empty — a recursion over `&&`/`||` whose true- and false-directions are asymmetric. A finding needs BOTH an uncovered access and a covered one on the same symbol in the same condition, which is the agreeing twin that separates a misplaced parenthesis from an unrelated length test. Bare index accesses with no emptiness test in the condition are neither counted nor reported; a non-identifier receiver and a lambda nested inside the condition are outside the population. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X29 · Per-element action decided by a fixed element10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a decision taken once per element is taken ABOUT that element — a test inside a counted loop that reads a fixed subscript of the very collection its guarded statement indexes by the loop variable applies element zero's answer to all of them, so the elements that differ from it are all handled wrongly, and in the same direction.
Method: Roslyn syntax only, no semantic model: every `for` statement declaring exactly ONE loop variable, and every `if` inside its body that is not under a nested loop or a lambda. A site enters the population when the `if`’s condition never mentions the loop variable while the statement it guards indexes some collection by that variable ALONE (`c[i]`; `c[i + 1]` and `c[i, j]` are outside it). A finding additionally needs the AGREEING TWIN at the same-collection grain: the condition must read THAT SAME collection at a subscript that does not move — written into the condition, or reached through a local declared BEFORE the loop, so an alias bound inside the body is not followed. Both collection expressions must be simple identifiers. On a repository with no .NET source the same rule reads JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `for (let|var|const x = …; …; …)` with one declarator and a braced body, an alias followed only when it is declared before the loop in a block that encloses it and never assigned inside the loop. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether exceptions are handled rather than silently swallowed or rethrown with lost stack traces.
Method: Roslyn syntax scan: every catch clause counted; empty catches and bare rethrows flagged. Population is all catch clauses, not estimated. Deterministic, hard fact.
`except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. (×12) — experiments/aggregate-by-query.py:617, experiments/check-pi-model-wiring.py:131, experiments/compute-cost.py:335, …
An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it. (×12) — REDACTED:613, experiments/stacks/typescript-vitest/tdd-reporter.mjs:58, experiments/stacks/typescript-vitest/tdd-reporter.mjs:69, …
`catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (`catch (e) { if (!(e instanceof SyntaxError)) throw e; … }`, or test `e.name`), because a JavaScript catch takes every exception, programming errors included. (×16) — experiments/runs/2026-09-16_22-18-02_game-of-life-prose_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/.verification-adapter.ts:19, experiments/runs/2026-09-16_21-58-58_game-of-life-prose_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/.verification-adapter.ts:19, experiments/runs/2026-09-16_20-41-05_game-of-life-prose_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex/.verification-adapter.ts:19, …
What to do
Swallowed exception (caught, then discarded)
Do you agree with this assessment?
X30 · Support guard that admits what it rejects10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a guard written as a NEGATED `||` says what its author meant — `!(a || b || x != k)` is `!a && !b && x == k` by De Morgan, so a bail-out that mixes capabilities the code needs with a fault it refuses turns inside out: it fires only where the capabilities are ABSENT, and lets every value the fault term names walk straight into the body that cannot handle it.
Method: Roslyn syntax only, no semantic model: every logical-not whose operand is a parenthesised `||` chain of two or more disjuncts, flattened (a left-nested `a || b || c` read once would see `(a || b)` as one disjunct). A site enters the population on that shape alone. A finding additionally needs the disjuncts to DISAGREE in polarity: at least one bare boolean read — an identifier or member access, never an invocation, which is a predicate rather than a capability flag — and at least one `x != <constant>`, the only form that negates into an exact-value pin (`== null` negates into a looser requirement and is outside the fault set). Consistently-polarised disjunctions, all-fault or all-capability, are counted and never reported; a negated `&&` is outside the population entirely. No same-receiver gate: it was measured to cost a real defect and remove no false positive. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether strict null checking is enabled and not undermined by heavy `!` assertion — TypeScript's `strictNullChecks` (which `strict` turns on) is what makes `string` exclude `null` and `undefined`, and the postfix `!` is the operator that silences it.
Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.
~2.1 `!` null assertions per 1k TypeScript source lines — 59 assertion(s) across the 27559 source line(s) of the 469 TypeScript file(s) read, which is the only code the operator asserts anything in (a `!` in a `.js` file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: site/src/trophy.ts (17), experiments/runs/2026-05-12_05-53-15_claim-office-user-story_v5-exact-single-context_sonnet-4-6-portkey/src/claim-office.ts (6), experiments/runs/2026-05-11_23-09-36_claim-office-prose_v5-exact-single-context_opus-4-6-portkey/src/claim-office.ts (5). Each one tells the compiler to trust the author about null, suppressing the very diagnostic `strictNullChecks` exists to produce. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first.
What to do
The findings name the configuration each number was taken from and, for the assertions, the files that hold them. Turn null checking on where it is off — `"strict": true` in the base tsconfig that the others extend switches `strictNullChecks` on with the rest of the family — and then resolve the assertions rather than adding to them. A `!` on a value the checker could show to be null is a promise the author cannot check from where they are standing, and each one is a `TypeError: Cannot read properties of null` waiting for the path that makes it true; where the value genuinely cannot be null, say something the checker can see instead (narrow it with a test, make the property required, drop the `?`).
Do you agree with this assessment?
WCAG coverage — what static analysis assessed
Statically assessed 10 of 55 WCAG 2.2 Level A/AA success criteria (18%; ≈20% of the 50 WCAG 2.1 AA criteria for EN 301 549). The other 45 require runtime or manual evaluation. Partial signal only (a clean result is necessary, not sufficient; static analysis fully verifies none). This is accessibility readiness, not a conformance claim — a WCAG conformance claim requires manual evaluation (WCAG-EM 1.0).
The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.
Unscored — 3 check(s) recorded observations but carry no score
These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.
SC1 Supply-chain hygiene — 40 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X10 Duplicated predicate — 40 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X7 Silent fallback defaults — 40 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 3 control(s) we could not find positive evidence for
These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.
C3 Audit Trail — Not assessed: these audit controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks audit controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C4 Data Retention — Not assessed: these retention controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks retention controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C5 Data-Subject Rights — Not assessed: these data-subject rights controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks data-subject rights controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
Not included — 61 check(s) not relevant to this codebase
These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.
AC1 Text alternatives — No image/media element found in the parsed markup — AC1 not applicable here.
AC4 Keyboard semantics — No interactive element found in the parsed markup — AC4 not applicable here.
AX1 Captive dependencies — Not applicable: this repository's JavaScript imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; this repository's Java imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; this repository's Python imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; Rust with no dependency-injection crate has no container to hand one lifetime's instance to another — every value is owned by the code that builds it, and the borrow checker rejects a longer-lived value keeping a borrow of a shorter-lived one; this repository's TypeScript imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's.
AX2 Stateful singletons — No container singleton was found, so there is no shared instance for concurrent requests to race on. No class in this Java code is a Spring, JSR-330 or CDI singleton bean. No function in this Python code is served by a threaded web framework (a Flask, Bottle or FastAPI route, a Django or Pyramid view), so no module is shared between request threads. Rust's compiler refuses unsynchronised shared mutation — a value shared across threads must be Sync — so the race this check looks for cannot be written. TypeScript/JavaScript runs each process's requests on one event loop, so no two requests write a shared object at the same instant (interleaving across an await is a different defect).
AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
AXR1 Runtime accessibility — the dev server (`npm run dev`) exited before it served a page. Likely cause (our sandbox): `npm run` found no package.json in the folder where our sandbox ran it. This is a limit of our sandbox, not of your repository. Last output: "npm error code ENOENT / npm error syscall open / npm error path <repo>/package.json / npm error errno -2 / npm error enoent Could not read package.json: Error: ENOENT: no such file or directory, open '<repo>/package.json' / npm error enoent This is related to npm not being able to find a file. / npm error enoent / npm error A complete log of this run can be found in: <path>" No runtime evidence was gathered. This is a statement about this run, not a statement about your application: nothing here says the surface is inaccessible, only that it was never rendered.
C1 Data Protection — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C2 Access Controls — Not assessed: these authorization controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks authorization controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
D12 Dependency Hygiene — Not scored — a Maven build resolved 11 artifact(s) (9 behind a shipped release, reported), but the build resolved only part of the graph, so this dimension's own question is only partly answered. NOT a finding that these dependencies are current or healthy.
D16 Bus Factor — single-maintainer repository — bus factor is not applicable
D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
D20 ADR Quality — N/A — this repo declares itself a template / kata / sample / demo; a formal ADR log is deferred to a real application built from it.
D21 Naming Consistency — Naming consistency does not read html yet; not measured.
D22 Internal API Consistency — API consistency is measured on C#, TypeScript, Go only; the exposed JavaScript surface was not measured.
D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ sibling projects each declaring an entity of their own or taking another project's integration events. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
D25 ADR Conformance — no ADRs to check
D28 Secrets (history) — gitleaks killed before it finished — this repository's working tree not scanned
D32 Data Compliance (PII/GDPR) — 2 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
D34 Knowledge Freshness — knowledge concentrated in recent work — freshness signal contradicted by repo activity
D36 Supply-chain Provenance & Signing — No CI/build pipeline found (.github/.forgejo/.gitea workflows, .circleci, .buildkite, .woodpecker, .teamcity, .gitlab-ci.yml, .travis.yml, bitbucket-pipelines.yml, .drone.yml, .cirrus.yml, .woodpecker.yml, appveyor.yml, azure-pipelines*.yml, .pipelines/, .vsts-ci/, .azuredevops/, Jenkinsfile); there is no build to attest provenance for.
D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
DM1 Aggregate boundaries — no aggregates detected — aggregate-boundary check not applicable
DM10 One transaction, one aggregate — no repository writes detected — no operation to judge against the one-aggregate rule
DM11 Constructible invalid state — no entities detected — construction-time invariants not assessable
DM2 Strongly-typed ids — no id-bearing domain types detected — strongly-typed-id adoption not assessable
DM3 Integration-event coupling — no integration events detected — coupling check not applicable
DM4 Rich vs anemic model — no data-bearing entities detected — rich-vs-anemic model not assessable
DM5 Encapsulated state — no domain entities found — DM5 grades how entities protect their state, and this repository declares none
DM6 Domain ↔ infrastructure boundary — this TypeScript/JavaScript repository maps no type to a persistence framework (TypeORM/Prisma/MikroORM/Sequelize/Mongoose), so DM6's domain↔infrastructure fusion read has no population to be taken over
DM7 Repository granularity — no repository abstraction detected (e.g. uses a document session)
ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, and a call made through an inferred or generic receiver has no resolvable owner in the source. Reported as guidance rather than measured
ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
P12 CI test-gate honesty — no CI workflow found
P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the JVM, JavaScript/TypeScript, Python, Rust source, so there is no service whose uptime a failing dependency could take down
P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
P9 Domain vs controller coverage — coverage data present for 10 file(s), but no domain-layer files were identified: no covered file's path contains any of the markers this check keys on (/domain/, /aggregates/, /valueobjects/, /domainmodel/, .domain/, /entities/), which are matched case-insensitively anywhere in the path. With no domain partition there is nothing to compare the web/controller layer against — if this repository keeps its business rules under a folder named none of those, that naming is what the check cannot see, not the domain logic.
PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for tinybench, mitata, benchmark.js, benny or vitest `bench(...)` calls in files that import them (or `*.bench.*` files), or one of those in a package.json, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
PF2 Allocation hygiene — Not scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
S1 Web-Security Posture — Not assessed: these web-security controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks web-security controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
X14 Bypassable address classification — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X15 Unvalidated length from an untrusted reader — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X17 Uncapped recursion over a caller-supplied document — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X18 Disposal-pattern correctness — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X2 Cancellation propagation — no C# was loaded; this repository's Java, Python and Rust were read, and no request in it can be cancelled by a caller — a Java request off Android takes no token: it is cancelled through the handle it returns (Future.cancel, Call.cancel, a Disposable), ambiently (io.grpc.Context) or by interrupting its thread, not through a parameter; a Python request takes no token: asyncio cancels the task and trio or anyio the scope that made it, from outside the call, and requests, httpx, aiohttp and gRPC take a timeout, not a cancellation; a Rust request takes no token: a future is cancelled by dropping it, from outside the call (select!, a timeout, an aborted task), and reqwest, hyper and tonic take none
X20 Mistyped argument guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X21 Side-effecting pattern guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X22 Contradicted release guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X23 Unguarded diagnostic materialisation — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X26 Unsynchronised callback handoff — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X27 Collection changed while being enumerated — X27 reached only 14% of this repository's production lines — typescript (267,758 lines), javascript (28,480 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X4 Structured logging — This check asks whether log calls keep a message's values apart from its text, which needs a logger that can carry them as fields. This repository's Rust was read, and it logs through none: the `log` crate's macros take one finished message (as log4net does in C#; its `kv` values are an opt-in its backends mostly drop), `println!`/`eprintln!` are not loggers, or it makes no log call outside its tests and examples at all. Calls through `tracing` (`tracing::info!`, or `info!` imported from it) would be judged.
X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
Appendix A — Findings (grouped)
The findings behind the scores, grouped by severity, then by dimension and kind. The high-severity issues are enumerated in full below; items per group are capped at 25 with any overflow stated explicitly per group, never silently truncated. The complete machine-readable list of every finding (all severities) is the companion findings.md in this report's bundle.
D10 · Test Quality· No assertions (empty test) · ×3
No assertions (empty test): a premium calculation that yields 197.5 G is rounded UP to 198 G final (satisfied by the 7-runes case) experiments/runs/2026-10-23_04-12-26_claim-office-example-mapping_exact-ptdd-v1-pi_minimax-m3/src/quote.spec.ts:240— Test method has an empty body — it asserts nothing and exercises no code.
No assertions (empty test): intermediate amounts during the calculation stay as fractions; only the final premium is rounded experiments/runs/2026-10-23_04-12-26_claim-office-example-mapping_exact-ptdd-v1-pi_minimax-m3/src/quote.spec.ts:243— Test method has an empty body — it asserts nothing and exercises no code.
No assertions (empty test): rounds up in MHPCO favor (premium 197.5 → 198) experiments/runs/2026-05-21_10-49-45_claim-office-example-mapping_v3-basic-tdd_opus-4-6-portkey-no-thinking/src/quote.spec.ts:150— Test method has an empty body — it asserts nothing and exercises no code.
D11 · Test Reliability· Test suite executes none of its 6 test cases · ×1
Test suite executes none of its 6 test cases: experiments/runs/2026-05-03_05-33-40_game-of-life-prose_v5-exact-single-context_haiku-4-5/ — The vitest suite in experiments/runs/2026-05-03_05-33-40_game-of-life-prose_v5-exact-single-context_haiku-4-5/ was launched successfully and reported 6 test case(s), every one of them skipped or pending — zero passed and zero failed. The suite is declared and committed but exercises none of the code it covers, so it cannot detect a regression and its presence overstates how much of this repository is tested. This is not a report that the tests FAIL: the runner never executed them.
.verification-adapter.loadEvolve (cognitive 17) experiments/runs/2026-05-12_22-34-20_game-of-life-cli-prose_v5-exact-single-context_haiku-4-5-portkey-no-thinking/.verification-adapter.ts:8— .verification-adapter.loadEvolve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
.verification-adapter.loadEvolve (cognitive 17) experiments/runs/2026-05-12_22-43-03_game-of-life-cli-prose_v5-exact-single-context_opus-4-6-portkey-no-thinking-2/.verification-adapter.ts:8— .verification-adapter.loadEvolve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
.verification-adapter.loadEvolve (cognitive 17) experiments/runs/2026-05-12_22-43-03_game-of-life-cli-prose_v5-exact-single-context_opus-4-6-portkey-no-thinking/.verification-adapter.ts:8— .verification-adapter.loadEvolve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
.verification-adapter.loadEvolve (cognitive 17) experiments/runs/2026-05-12_22-53-00_game-of-life-cli-prose_v5-exact-single-context_opus-4-6-portkey-no-thinking/.verification-adapter.ts:8— .verification-adapter.loadEvolve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
.verification-adapter.loadEvolve (cognitive 17) experiments/runs/2026-05-12_22-56-10_game-of-life-cli-prose_v5-exact-single-context_sonnet-4-6-portkey-no-thinking/.verification-adapter.ts:8— .verification-adapter.loadEvolve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
.verification-adapter.loadEvolve (cognitive 17) experiments/runs/2026-05-12_23-01-51_game-of-life-cli-prose_v5-exact-single-context_sonnet-4-6-portkey-no-thinking/.verification-adapter.ts:8— .verification-adapter.loadEvolve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
.verification-adapter.loadEvolve (cognitive 17) experiments/runs/2026-05-12_23-04-47_game-of-life-cli-prose_v5-exact-single-context_sonnet-4-6-portkey-no-thinking/.verification-adapter.ts:8— .verification-adapter.loadEvolve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
.verification-adapter.loadEvolve (cognitive 17) experiments/runs/2026-05-12_23-10-28_game-of-life-cli-prose_v5-exact-single-context_haiku-4-5-portkey-no-thinking/.verification-adapter.ts:8— .verification-adapter.loadEvolve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
.verification-adapter.loadEvolve (cognitive 17) experiments/runs/2026-05-12_23-12-53_game-of-life-cli-prose_v5-exact-single-context_haiku-4-5-portkey-no-thinking/.verification-adapter.ts:8— .verification-adapter.loadEvolve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
.verification-adapter.loadEvolve (cognitive 17) experiments/runs/2026-05-12_23-13-18_game-of-life-cli-user-story_v5-exact-single-context_opus-4-6-portkey-no-thinking/.verification-adapter.ts:8— .verification-adapter.loadEvolve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
.verification-adapter.loadEvolve (cognitive 17) experiments/runs/2026-05-12_23-16-59_game-of-life-cli-prose_v5-exact-single-context_haiku-4-5-portkey-no-thinking/.verification-adapter.ts:8— .verification-adapter.loadEvolve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
.verification-adapter.loadEvolve (cognitive 17) experiments/runs/2026-05-12_23-17-33_game-of-life-cli-user-story_v5-exact-single-context_opus-4-6-portkey-no-thinking/.verification-adapter.ts:8— .verification-adapter.loadEvolve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
.verification-adapter.loadEvolve (cognitive 17) experiments/runs/2026-05-12_23-26-22_game-of-life-cli-user-story_v5-exact-single-context_opus-4-6-portkey-no-thinking/.verification-adapter.ts:8— .verification-adapter.loadEvolve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
.verification-adapter.loadEvolve (cognitive 17) experiments/runs/2026-05-12_23-26-53_game-of-life-cli-user-story_v5-exact-single-context_sonnet-4-6-portkey-no-thinking/.verification-adapter.ts:8— .verification-adapter.loadEvolve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
.verification-adapter.loadEvolve (cognitive 17) experiments/runs/2026-05-12_23-39-06_game-of-life-cli-user-story_v5-exact-single-context_sonnet-4-6-portkey-no-thinking/.verification-adapter.ts:8— .verification-adapter.loadEvolve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
.verification-adapter.loadEvolve (cognitive 17) experiments/runs/2026-05-12_23-40-50_game-of-life-cli-user-story_v5-exact-single-context_sonnet-4-6-portkey-no-thinking/.verification-adapter.ts:8— .verification-adapter.loadEvolve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
.verification-adapter.loadEvolve (cognitive 17) experiments/runs/2026-05-12_23-50-11_game-of-life-cli-user-story_v5-exact-single-context_haiku-4-5-portkey-no-thinking/.verification-adapter.ts:8— .verification-adapter.loadEvolve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
.verification-adapter.loadEvolve (cognitive 17) experiments/runs/2026-05-12_23-56-27_game-of-life-cli-user-story_v5-exact-single-context_haiku-4-5-portkey-no-thinking/.verification-adapter.ts:8— .verification-adapter.loadEvolve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
.verification-adapter.loadEvolve (cognitive 17) experiments/runs/2026-05-12_23-57-05_game-of-life-cli-user-story_v5-exact-single-context_haiku-4-5-portkey-no-thinking/.verification-adapter.ts:8— .verification-adapter.loadEvolve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
.verification-adapter.loadEvolve (cognitive 17) experiments/runs/2026-05-13_05-43-50_game-of-life-cli-user-story_v5-exact-single-context_opus-4-6-portkey-no-thinking/.verification-adapter.ts:8— .verification-adapter.loadEvolve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
.verification-adapter.loadEvolve (cognitive 17) experiments/runs/2026-05-13_05-43-51_game-of-life-cli-user-story_v5-exact-single-context_haiku-4-5-portkey-no-thinking/.verification-adapter.ts:8— .verification-adapter.loadEvolve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
.verification-adapter.loadEvolve (cognitive 17) experiments/runs/2026-05-13_05-43-51_game-of-life-cli-user-story_v5-exact-single-context_sonnet-4-6-portkey-no-thinking/.verification-adapter.ts:8— .verification-adapter.loadEvolve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
.verification-adapter.loadEvolve (cognitive 17) experiments/runs/2026-05-13_05-58-56_game-of-life-cli-prose_v5-exact-single-context_opus-4-6-portkey-no-thinking-2/.verification-adapter.ts:8— .verification-adapter.loadEvolve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
.verification-adapter.loadEvolve (cognitive 17) experiments/runs/2026-05-13_05-58-56_game-of-life-cli-prose_v5-exact-single-context_opus-4-6-portkey-no-thinking/.verification-adapter.ts:8— .verification-adapter.loadEvolve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
.verification-adapter.loadEvolve (cognitive 17) experiments/runs/2026-05-13_05-58-56_game-of-life-cli-prose_v5-exact-single-context_sonnet-4-6-portkey-no-thinking/.verification-adapter.ts:8— .verification-adapter.loadEvolve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
+ 36 more in this group — see findings.md.
SC1 · Supply-chain hygiene· JavaScript dependencies are not locked · ×40
JavaScript dependencies are not locked experiments/runs/2026-05-26_09-54-55_game-of-life-example-mapping_v6.2.1-refactor-vocab_opus-4-7-portkey-no-thinking/package.json:10— experiments/runs/2026-05-26_09-54-55_game-of-life-example-mapping_v6.2.1-refactor-vocab_opus-4-7-portkey-no-thinking/package.json declares dependencies that no committed lockfile resolves — there is no REDACTED / yarn.lock / REDACTED / bun.lock beside it, and no locked workspace above it names it — so its installs aren't reproducible (SSDF PW.4.4). Commit its package manager's lockfile (or add it to the locked workspace) and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
JavaScript dependencies are not locked experiments/runs/2026-05-26_09-55-16_game-of-life-example-mapping_v6.2.1-refactor-vocab_opus-4-7-portkey-no-thinking/package.json:10— experiments/runs/2026-05-26_09-55-16_game-of-life-example-mapping_v6.2.1-refactor-vocab_opus-4-7-portkey-no-thinking/package.json declares dependencies that no committed lockfile resolves — there is no REDACTED / yarn.lock / REDACTED / bun.lock beside it, and no locked workspace above it names it — so its installs aren't reproducible (SSDF PW.4.4). Commit its package manager's lockfile (or add it to the locked workspace) and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
JavaScript dependencies are not locked experiments/runs/2026-05-26_10-05-17_claim-office-example-mapping_v6.2.1-refactor-vocab_opus-4-7-portkey-no-thinking/package.json:10— experiments/runs/2026-05-26_10-05-17_claim-office-example-mapping_v6.2.1-refactor-vocab_opus-4-7-portkey-no-thinking/package.json declares dependencies that no committed lockfile resolves — there is no REDACTED / yarn.lock / REDACTED / bun.lock beside it, and no locked workspace above it names it — so its installs aren't reproducible (SSDF PW.4.4). Commit its package manager's lockfile (or add it to the locked workspace) and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
JavaScript dependencies are not locked experiments/runs/2026-05-26_10-05-38_claim-office-example-mapping_v6.2.1-refactor-vocab_opus-4-7-portkey-no-thinking/package.json:10— experiments/runs/2026-05-26_10-05-38_claim-office-example-mapping_v6.2.1-refactor-vocab_opus-4-7-portkey-no-thinking/package.json declares dependencies that no committed lockfile resolves — there is no REDACTED / yarn.lock / REDACTED / bun.lock beside it, and no locked workspace above it names it — so its installs aren't reproducible (SSDF PW.4.4). Commit its package manager's lockfile (or add it to the locked workspace) and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
JavaScript dependencies are not locked experiments/runs/2026-05-26_10-08-16_claim-office-example-mapping_v6.2.1-refactor-vocab_opus-4-7-portkey-no-thinking/package.json:10— experiments/runs/2026-05-26_10-08-16_claim-office-example-mapping_v6.2.1-refactor-vocab_opus-4-7-portkey-no-thinking/package.json declares dependencies that no committed lockfile resolves — there is no REDACTED / yarn.lock / REDACTED / bun.lock beside it, and no locked workspace above it names it — so its installs aren't reproducible (SSDF PW.4.4). Commit its package manager's lockfile (or add it to the locked workspace) and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
JavaScript dependencies are not locked experiments/runs/2026-05-26_10-27-59_claim-office-example-mapping_v5.1-testlist-scope-fix-oc_qwen3-coder-480b/package.json:10— experiments/runs/2026-05-26_10-27-59_claim-office-example-mapping_v5.1-testlist-scope-fix-oc_qwen3-coder-480b/package.json declares dependencies that no committed lockfile resolves — there is no REDACTED / yarn.lock / REDACTED / bun.lock beside it, and no locked workspace above it names it — so its installs aren't reproducible (SSDF PW.4.4). Commit its package manager's lockfile (or add it to the locked workspace) and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
JavaScript dependencies are not locked experiments/runs/2026-05-26_10-32-44_claim-office-example-mapping_v5.1-testlist-scope-fix-oc_mistral-medium-3-5/package.json:15— experiments/runs/2026-05-26_10-32-44_claim-office-example-mapping_v5.1-testlist-scope-fix-oc_mistral-medium-3-5/package.json declares dependencies that no committed lockfile resolves — there is no REDACTED / yarn.lock / REDACTED / bun.lock beside it, and no locked workspace above it names it — so its installs aren't reproducible (SSDF PW.4.4). Commit its package manager's lockfile (or add it to the locked workspace) and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
JavaScript dependencies are not locked experiments/runs/2026-05-26_10-40-07_claim-office-example-mapping_v5.1-testlist-scope-fix-oc_codestral-2508/package.json:10— experiments/runs/2026-05-26_10-40-07_claim-office-example-mapping_v5.1-testlist-scope-fix-oc_codestral-2508/package.json declares dependencies that no committed lockfile resolves — there is no REDACTED / yarn.lock / REDACTED / bun.lock beside it, and no locked workspace above it names it — so its installs aren't reproducible (SSDF PW.4.4). Commit its package manager's lockfile (or add it to the locked workspace) and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
JavaScript dependencies are not locked experiments/runs/2026-05-26_10-47-28_claim-office-example-mapping_v6.2.1-refactor-vocab_opus-4-7-portkey-no-thinking/package.json:10— experiments/runs/2026-05-26_10-47-28_claim-office-example-mapping_v6.2.1-refactor-vocab_opus-4-7-portkey-no-thinking/package.json declares dependencies that no committed lockfile resolves — there is no REDACTED / yarn.lock / REDACTED / bun.lock beside it, and no locked workspace above it names it — so its installs aren't reproducible (SSDF PW.4.4). Commit its package manager's lockfile (or add it to the locked workspace) and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
JavaScript dependencies are not locked experiments/runs/2026-05-26_11-19-00_claim-office-example-mapping_v6.2-with-why-cleaned-oc_opus-4-7-portkey-no-thinking-2/package.json:10— experiments/runs/2026-05-26_11-19-00_claim-office-example-mapping_v6.2-with-why-cleaned-oc_opus-4-7-portkey-no-thinking-2/package.json declares dependencies that no committed lockfile resolves — there is no REDACTED / yarn.lock / REDACTED / bun.lock beside it, and no locked workspace above it names it — so its installs aren't reproducible (SSDF PW.4.4). Commit its package manager's lockfile (or add it to the locked workspace) and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
JavaScript dependencies are not locked experiments/runs/2026-05-26_11-19-00_claim-office-example-mapping_v6.2-with-why-cleaned-oc_opus-4-7-portkey-no-thinking/package.json:10— experiments/runs/2026-05-26_11-19-00_claim-office-example-mapping_v6.2-with-why-cleaned-oc_opus-4-7-portkey-no-thinking/package.json declares dependencies that no committed lockfile resolves — there is no REDACTED / yarn.lock / REDACTED / bun.lock beside it, and no locked workspace above it names it — so its installs aren't reproducible (SSDF PW.4.4). Commit its package manager's lockfile (or add it to the locked workspace) and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
JavaScript dependencies are not locked experiments/runs/2026-05-26_11-19-00_game-of-life-example-mapping_v6.2-with-why-cleaned-oc_opus-4-7-portkey-no-thinking-2/package.json:10— experiments/runs/2026-05-26_11-19-00_game-of-life-example-mapping_v6.2-with-why-cleaned-oc_opus-4-7-portkey-no-thinking-2/package.json declares dependencies that no committed lockfile resolves — there is no REDACTED / yarn.lock / REDACTED / bun.lock beside it, and no locked workspace above it names it — so its installs aren't reproducible (SSDF PW.4.4). Commit its package manager's lockfile (or add it to the locked workspace) and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
JavaScript dependencies are not locked experiments/runs/2026-05-26_11-19-00_game-of-life-example-mapping_v6.2-with-why-cleaned-oc_opus-4-7-portkey-no-thinking/package.json:10— experiments/runs/2026-05-26_11-19-00_game-of-life-example-mapping_v6.2-with-why-cleaned-oc_opus-4-7-portkey-no-thinking/package.json declares dependencies that no committed lockfile resolves — there is no REDACTED / yarn.lock / REDACTED / bun.lock beside it, and no locked workspace above it names it — so its installs aren't reproducible (SSDF PW.4.4). Commit its package manager's lockfile (or add it to the locked workspace) and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
JavaScript dependencies are not locked experiments/runs/2026-05-26_19-50-08_claim-office-example-mapping_v6.2-with-why-cleaned-pi_opus-4-7-portkey-no-thinking/package.json:10— experiments/runs/2026-05-26_19-50-08_claim-office-example-mapping_v6.2-with-why-cleaned-pi_opus-4-7-portkey-no-thinking/package.json declares dependencies that no committed lockfile resolves — there is no REDACTED / yarn.lock / REDACTED / bun.lock beside it, and no locked workspace above it names it — so its installs aren't reproducible (SSDF PW.4.4). Commit its package manager's lockfile (or add it to the locked workspace) and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
JavaScript dependencies are not locked experiments/runs/2026-05-26_20-41-14_claim-office-example-mapping_v6.2-with-why-cleaned-pi_opus-4-7-portkey-no-thinking-2/package.json:10— experiments/runs/2026-05-26_20-41-14_claim-office-example-mapping_v6.2-with-why-cleaned-pi_opus-4-7-portkey-no-thinking-2/package.json declares dependencies that no committed lockfile resolves — there is no REDACTED / yarn.lock / REDACTED / bun.lock beside it, and no locked workspace above it names it — so its installs aren't reproducible (SSDF PW.4.4). Commit its package manager's lockfile (or add it to the locked workspace) and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
JavaScript dependencies are not locked experiments/runs/2026-05-26_20-41-14_claim-office-example-mapping_v6.2-with-why-cleaned-pi_opus-4-7-portkey-no-thinking-3/package.json:10— experiments/runs/2026-05-26_20-41-14_claim-office-example-mapping_v6.2-with-why-cleaned-pi_opus-4-7-portkey-no-thinking-3/package.json declares dependencies that no committed lockfile resolves — there is no REDACTED / yarn.lock / REDACTED / bun.lock beside it, and no locked workspace above it names it — so its installs aren't reproducible (SSDF PW.4.4). Commit its package manager's lockfile (or add it to the locked workspace) and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
JavaScript dependencies are not locked experiments/runs/2026-05-26_20-41-14_claim-office-example-mapping_v6.2-with-why-cleaned-pi_opus-4-7-portkey-no-thinking-4/package.json:10— experiments/runs/2026-05-26_20-41-14_claim-office-example-mapping_v6.2-with-why-cleaned-pi_opus-4-7-portkey-no-thinking-4/package.json declares dependencies that no committed lockfile resolves — there is no REDACTED / yarn.lock / REDACTED / bun.lock beside it, and no locked workspace above it names it — so its installs aren't reproducible (SSDF PW.4.4). Commit its package manager's lockfile (or add it to the locked workspace) and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
JavaScript dependencies are not locked experiments/runs/2026-05-26_20-41-14_claim-office-example-mapping_v6.2-with-why-cleaned-pi_opus-4-7-portkey-no-thinking/package.json:13— experiments/runs/2026-05-26_20-41-14_claim-office-example-mapping_v6.2-with-why-cleaned-pi_opus-4-7-portkey-no-thinking/package.json declares dependencies that no committed lockfile resolves — there is no REDACTED / yarn.lock / REDACTED / bun.lock beside it, and no locked workspace above it names it — so its installs aren't reproducible (SSDF PW.4.4). Commit its package manager's lockfile (or add it to the locked workspace) and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
JavaScript dependencies are not locked experiments/runs/2026-05-26_20-41-14_game-of-life-example-mapping_v6.2-with-why-cleaned-pi_opus-4-7-portkey-no-thinking/package.json:10— experiments/runs/2026-05-26_20-41-14_game-of-life-example-mapping_v6.2-with-why-cleaned-pi_opus-4-7-portkey-no-thinking/package.json declares dependencies that no committed lockfile resolves — there is no REDACTED / yarn.lock / REDACTED / bun.lock beside it, and no locked workspace above it names it — so its installs aren't reproducible (SSDF PW.4.4). Commit its package manager's lockfile (or add it to the locked workspace) and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
JavaScript dependencies are not locked experiments/runs/2026-05-26_21-05-30_game-of-life-example-mapping_v6.2-with-why-cleaned-pi_opus-4-7-portkey-no-thinking/package.json:10— experiments/runs/2026-05-26_21-05-30_game-of-life-example-mapping_v6.2-with-why-cleaned-pi_opus-4-7-portkey-no-thinking/package.json declares dependencies that no committed lockfile resolves — there is no REDACTED / yarn.lock / REDACTED / bun.lock beside it, and no locked workspace above it names it — so its installs aren't reproducible (SSDF PW.4.4). Commit its package manager's lockfile (or add it to the locked workspace) and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
JavaScript dependencies are not locked experiments/runs/2026-05-26_21-06-22_game-of-life-example-mapping_v6.2-with-why-cleaned-pi_opus-4-7-portkey-no-thinking/package.json:10— experiments/runs/2026-05-26_21-06-22_game-of-life-example-mapping_v6.2-with-why-cleaned-pi_opus-4-7-portkey-no-thinking/package.json declares dependencies that no committed lockfile resolves — there is no REDACTED / yarn.lock / REDACTED / bun.lock beside it, and no locked workspace above it names it — so its installs aren't reproducible (SSDF PW.4.4). Commit its package manager's lockfile (or add it to the locked workspace) and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
JavaScript dependencies are not locked experiments/runs/2026-05-26_21-07-59_game-of-life-example-mapping_v6.2-with-why-cleaned-pi_opus-4-7-portkey-no-thinking/package.json:10— experiments/runs/2026-05-26_21-07-59_game-of-life-example-mapping_v6.2-with-why-cleaned-pi_opus-4-7-portkey-no-thinking/package.json declares dependencies that no committed lockfile resolves — there is no REDACTED / yarn.lock / REDACTED / bun.lock beside it, and no locked workspace above it names it — so its installs aren't reproducible (SSDF PW.4.4). Commit its package manager's lockfile (or add it to the locked workspace) and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
JavaScript dependencies are not locked experiments/runs/2026-05-26_21-13-20_game-of-life-example-mapping_v6.2-with-why-cleaned-pi_opus-4-7-portkey-no-thinking/package.json:10— experiments/runs/2026-05-26_21-13-20_game-of-life-example-mapping_v6.2-with-why-cleaned-pi_opus-4-7-portkey-no-thinking/package.json declares dependencies that no committed lockfile resolves — there is no REDACTED / yarn.lock / REDACTED / bun.lock beside it, and no locked workspace above it names it — so its installs aren't reproducible (SSDF PW.4.4). Commit its package manager's lockfile (or add it to the locked workspace) and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
JavaScript dependencies are not locked experiments/runs/2026-05-27_03-22-31_game-of-life-example-mapping_v6.4-metric-driven-refactor_opus-4-7-no-thinking/package.json:10— experiments/runs/2026-05-27_03-22-31_game-of-life-example-mapping_v6.4-metric-driven-refactor_opus-4-7-no-thinking/package.json declares dependencies that no committed lockfile resolves — there is no REDACTED / yarn.lock / REDACTED / bun.lock beside it, and no locked workspace above it names it — so its installs aren't reproducible (SSDF PW.4.4). Commit its package manager's lockfile (or add it to the locked workspace) and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
JavaScript dependencies are not locked experiments/runs/2026-05-27_03-39-46_claim-office-example-mapping_v6.4-metric-driven-refactor_opus-4-7-no-thinking/package.json:10— experiments/runs/2026-05-27_03-39-46_claim-office-example-mapping_v6.4-metric-driven-refactor_opus-4-7-no-thinking/package.json declares dependencies that no committed lockfile resolves — there is no REDACTED / yarn.lock / REDACTED / bun.lock beside it, and no locked workspace above it names it — so its installs aren't reproducible (SSDF PW.4.4). Commit its package manager's lockfile (or add it to the locked workspace) and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
+ 15 more in this group — see findings.md.
D30 · Dependency Vulnerabilities· Medium vulnerability · ×38
Swallowed exception (caught, then discarded) experiments/aggregate-by-query.py:617— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) experiments/check-pi-model-wiring.py:131— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) experiments/compute-cost.py:335— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) experiments/compute-cost.py:345— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) experiments/measure-suite-transitions.py:132— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) experiments/measure-suite-transitions.py:185— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) experiments/measure-suite-transitions.py:323— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) experiments/measure-tdd-rigour.py:54— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) experiments/measure-tdd-rigour.py:76— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) experiments/measure-tdd-rigour.py:101— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) REDACTED:588— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) experiments/stacks/python-pytest/conftest.py:116— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) experiments/runs/2026-09-16_22-18-02_game-of-life-prose_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/.verification-adapter.ts:19— `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (`catch (e) { if (!(e instanceof SyntaxError)) throw e; … }`, or test `e.name`), because a JavaScript catch takes every exception, programming errors included.
Swallowed exception (caught, then discarded) experiments/runs/2026-09-16_21-58-58_game-of-life-prose_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/.verification-adapter.ts:19— `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (`catch (e) { if (!(e instanceof SyntaxError)) throw e; … }`, or test `e.name`), because a JavaScript catch takes every exception, programming errors included.
Swallowed exception (caught, then discarded) experiments/runs/2026-09-16_20-41-05_game-of-life-prose_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex/.verification-adapter.ts:19— `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (`catch (e) { if (!(e instanceof SyntaxError)) throw e; … }`, or test `e.name`), because a JavaScript catch takes every exception, programming errors included.
Swallowed exception (caught, then discarded) experiments/runs/2026-09-16_20-41-05_game-of-life-prose_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/.verification-adapter.ts:19— `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (`catch (e) { if (!(e instanceof SyntaxError)) throw e; … }`, or test `e.name`), because a JavaScript catch takes every exception, programming errors included.
Swallowed exception (caught, then discarded) experiments/runs/2026-09-16_09-31-04_game-of-life-prose_exact-sol-v1.6.1-naming-refactor-trial-cc_opus-5-no-thinking/.verification-adapter.ts:19— `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (`catch (e) { if (!(e instanceof SyntaxError)) throw e; … }`, or test `e.name`), because a JavaScript catch takes every exception, programming errors included.
Swallowed exception (caught, then discarded) experiments/runs/2026-09-15_21-10-16_game-of-life-prose_exact-sol-v1.5-tcr-parity-domain-trial-cc_opus-5-no-thinking/.verification-adapter.ts:19— `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (`catch (e) { if (!(e instanceof SyntaxError)) throw e; … }`, or test `e.name`), because a JavaScript catch takes every exception, programming errors included.
Swallowed exception (caught, then discarded) experiments/runs/2026-09-15_21-03-16_game-of-life-prose_exact-sol-v1.5-tcr-parity-domain-trial-cc_opus-5-no-thinking/.verification-adapter.ts:19— `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (`catch (e) { if (!(e instanceof SyntaxError)) throw e; … }`, or test `e.name`), because a JavaScript catch takes every exception, programming errors included.
Swallowed exception (caught, then discarded) experiments/runs/2026-09-05_14-51-22_game-of-life-prose_v3-basic-tdd-pi_gpt-6-astra-codex-no-thinking/.verification-adapter.ts:19— `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (`catch (e) { if (!(e instanceof SyntaxError)) throw e; … }`, or test `e.name`), because a JavaScript catch takes every exception, programming errors included.
Swallowed exception (caught, then discarded) experiments/runs/2026-08-17_04-05-07_game-of-life-prose_basic-sol-tdd-cc_opus-4-8-no-thinking/.verification-adapter.ts:19— `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (`catch (e) { if (!(e instanceof SyntaxError)) throw e; … }`, or test `e.name`), because a JavaScript catch takes every exception, programming errors included.
Swallowed exception (caught, then discarded) experiments/runs/2026-08-16_16-58-02_game-of-life-prose_basic-sol-tdd-subagent-pi_gpt-5-6-sol-codex/.verification-adapter.ts:19— `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (`catch (e) { if (!(e instanceof SyntaxError)) throw e; … }`, or test `e.name`), because a JavaScript catch takes every exception, programming errors included.
Swallowed exception (caught, then discarded) experiments/runs/2026-08-16_16-52-25_game-of-life-prose_basic-sol-tdd-pi_gpt-5-6-sol-codex/.verification-adapter.ts:19— `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (`catch (e) { if (!(e instanceof SyntaxError)) throw e; … }`, or test `e.name`), because a JavaScript catch takes every exception, programming errors included.
Swallowed exception (caught, then discarded) experiments/runs/2026-05-14_23-56-15_game-of-life-prose_v2-iterative_opus-4-7-no-thinking/.verification-adapter.ts:19— `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (`catch (e) { if (!(e instanceof SyntaxError)) throw e; … }`, or test `e.name`), because a JavaScript catch takes every exception, programming errors included.
Swallowed exception (caught, then discarded) experiments/runs/2026-05-14_23-54-40_game-of-life-prose_v2-iterative_opus-4-7-no-thinking/.verification-adapter.ts:19— `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (`catch (e) { if (!(e instanceof SyntaxError)) throw e; … }`, or test `e.name`), because a JavaScript catch takes every exception, programming errors included.
+ 3 more in this group — see findings.md.
R4 · Test Coverage· This test file cannot be loaded · ×20
This test file cannot be loaded experiments/runs/2026-05-12_04-33-35_claim-office-prose_v5-exact-single-context_haiku-4-5-portkey/src/claim-office.spec.ts:2— experiments/runs/2026-05-12_04-33-35_claim-office-prose_v5-exact-single-context_haiku-4-5-portkey/src/claim-office.spec.ts:2 imports './claim-office.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing.
This test file cannot be loaded experiments/runs/2026-05-12_04-59-28_claim-office-example-mapping_v5-exact-single-context_haiku-4-5-portkey/src/mhpco.spec.ts:2— experiments/runs/2026-05-12_04-59-28_claim-office-example-mapping_v5-exact-single-context_haiku-4-5-portkey/src/mhpco.spec.ts:2 imports './mhpco.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing.
This test file cannot be loaded experiments/runs/2026-05-12_04-59-54_claim-office-prose_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/mhpco.spec.ts:2— experiments/runs/2026-05-12_04-59-54_claim-office-prose_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/mhpco.spec.ts:2 imports './mhpco.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing.
This test file cannot be loaded experiments/runs/2026-05-12_05-00-21_claim-office-example-mapping_v5-exact-single-context_haiku-4-5-portkey/src/claims-office.spec.ts:2— experiments/runs/2026-05-12_05-00-21_claim-office-example-mapping_v5-exact-single-context_haiku-4-5-portkey/src/claims-office.spec.ts:2 imports './claims-office.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing.
This test file cannot be loaded experiments/runs/2026-05-12_05-05-25_claim-office-prose_v5-exact-single-context_haiku-4-5-portkey/src/quote.spec.ts:2— experiments/runs/2026-05-12_05-05-25_claim-office-prose_v5-exact-single-context_haiku-4-5-portkey/src/quote.spec.ts:2 imports './quote.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing.
This test file cannot be loaded experiments/runs/2026-05-12_05-26-27_claim-office-example-mapping_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/claim-office.spec.ts:2— experiments/runs/2026-05-12_05-26-27_claim-office-example-mapping_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/claim-office.spec.ts:2 imports './claim-office.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing.
This test file cannot be loaded experiments/runs/2026-05-12_05-26-56_claim-office-user-story_v5-exact-single-context_haiku-4-5-portkey/src/premium.spec.ts:2— experiments/runs/2026-05-12_05-26-56_claim-office-user-story_v5-exact-single-context_haiku-4-5-portkey/src/premium.spec.ts:2 imports './premium.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing.
This test file cannot be loaded experiments/runs/2026-05-12_05-35-05_claim-office-example-mapping_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/mhpco.spec.ts:2— experiments/runs/2026-05-12_05-35-05_claim-office-example-mapping_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/mhpco.spec.ts:2 imports './mhpco.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing.
This test file cannot be loaded experiments/runs/2026-05-12_05-40-02_claim-office-example-mapping_v5-exact-single-context_haiku-4-5-portkey/src/claim-office.spec.ts:2— experiments/runs/2026-05-12_05-40-02_claim-office-example-mapping_v5-exact-single-context_haiku-4-5-portkey/src/claim-office.spec.ts:2 imports './claim-office.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing.
This test file cannot be loaded experiments/runs/2026-05-12_06-23-47_claim-office-user-story_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/claim-office.spec.ts:2— experiments/runs/2026-05-12_06-23-47_claim-office-user-story_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/claim-office.spec.ts:2 imports './claim-office.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing.
This test file cannot be loaded experiments/runs/2026-05-12_07-46-30_claim-office-prose_v5-exact-single-context_haiku-4-5-portkey/src/claim-office.spec.ts:2— experiments/runs/2026-05-12_07-46-30_claim-office-prose_v5-exact-single-context_haiku-4-5-portkey/src/claim-office.spec.ts:2 imports './quote.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either (1 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing.
This test file cannot be loaded experiments/runs/2026-05-12_07-47-45_claim-office-prose_v5-exact-single-context_haiku-4-5-portkey/src/claim-office.spec.ts:2— experiments/runs/2026-05-12_07-47-45_claim-office-prose_v5-exact-single-context_haiku-4-5-portkey/src/claim-office.spec.ts:2 imports './claim-office.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing.
This test file cannot be loaded experiments/runs/2026-05-12_07-51-23_claim-office-prose_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/mhpco.spec.ts:2— experiments/runs/2026-05-12_07-51-23_claim-office-prose_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/mhpco.spec.ts:2 imports './mhpco.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing.
This test file cannot be loaded experiments/runs/2026-05-12_08-28-35_claim-office-example-mapping_v5-exact-single-context_haiku-4-5-portkey/src/claim-office.spec.ts:2— experiments/runs/2026-05-12_08-28-35_claim-office-example-mapping_v5-exact-single-context_haiku-4-5-portkey/src/claim-office.spec.ts:2 imports './claim-office.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing.
This test file cannot be loaded experiments/runs/2026-05-12_08-52-11_claim-office-example-mapping_v5-exact-single-context_haiku-4-5-portkey/src/claim-office.spec.ts:2— experiments/runs/2026-05-12_08-52-11_claim-office-example-mapping_v5-exact-single-context_haiku-4-5-portkey/src/claim-office.spec.ts:2 imports './claim-office.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing.
This test file cannot be loaded experiments/runs/2026-05-12_09-04-49_claim-office-user-story_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/claim-office.spec.ts:2— experiments/runs/2026-05-12_09-04-49_claim-office-user-story_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/claim-office.spec.ts:2 imports './claim-office.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing.
This test file cannot be loaded experiments/runs/2026-05-12_09-36-31_claim-office-user-story_v5-exact-single-context_haiku-4-5-portkey/src/claim-office.spec.ts:2— experiments/runs/2026-05-12_09-36-31_claim-office-user-story_v5-exact-single-context_haiku-4-5-portkey/src/claim-office.spec.ts:2 imports './claim-office.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing.
This test file cannot be loaded experiments/runs/2026-05-12_23-12-53_game-of-life-cli-prose_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/gameOfLife.spec.ts:2— experiments/runs/2026-05-12_23-12-53_game-of-life-cli-prose_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/gameOfLife.spec.ts:2 imports './gameOfLife.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing.
This test file cannot be loaded experiments/runs/2026-05-23_21-38-24_claim-office-example-mapping_v6.1-no-emoji_opus-4-7-portkey-no-thinking/src/claim-office.spec.ts:2— experiments/runs/2026-05-23_21-38-24_claim-office-example-mapping_v6.1-no-emoji_opus-4-7-portkey-no-thinking/src/claim-office.spec.ts:2 imports './claim-office.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing.
This test file cannot be loaded experiments/runs/2026-09-13_10-54-15_claim-office-example-mapping_exact-hybrid-v2.9-stack-profile-cc_opus-5-no-thinking/src/claim-office.spec.ts:2— experiments/runs/2026-09-13_10-54-15_claim-office-example-mapping_exact-hybrid-v2.9-stack-profile-cc_opus-5-no-thinking/src/claim-office.spec.ts:2 imports './claim-office.js', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing.
R4 · Test Coverage· No test reaches this file · ×20
No test reaches this file experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/lib/parse.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/lexer.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/lib/scan.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/lib/picomatch.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/src/scopes.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file experiments/runs/2026-08-04_22-50-39_claim-office-example-mapping_v6.2.1-phase-continuation-pi_kimi-k3-sference-2/src/cli.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file experiments/runs/2026-10-23_01-19-48_claim-office-example-mapping_exact-ptdd-v1-pi_kimi-k3-sference/src/cli.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file experiments/runs/2026-08-04_21-48-40_claim-office-example-mapping_v6.2.1-phase-continuation-pi_kimi-k3-sference-no-thinking/src/cli.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file experiments/runs/2026-10-23_03-27-25_claim-office-example-mapping_exact-ptdd-v1-pi_kimi-k3-sference/src/cli.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/lib/constants.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file experiments/runs/2026-09-14_23-38-56_claim-office-example-mapping_exact-tcr-v1-pi_gpt-5-6-sol-codex-4/src/cli.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file experiments/runs/2026-05-26_07-28-08_claim-office-example-mapping_v5.1-testlist-scope-fix-oc_mistral-medium-3-5/src/cli.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file experiments/runs/2026-05-09_09-02-47_claim-office-example-mapping_v3-basic-tdd_haiku-4-5/src/cli.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file experiments/runs/2026-05-09_14-12-06_claim-office-example-mapping_v3-basic-tdd_haiku-4-5-no-thinking/src/cli.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file experiments/runs/2026-10-01_00-49-48_claim-office-example-mapping_exact-hybrid-v2-testlist-fix-cc_opus-5-5-no-thinking-2/tdd-reporter.mjs:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file experiments/runs/2026-10-01_00-49-48_claim-office-example-mapping_exact-hybrid-v2-testlist-fix-cc_opus-5-5-no-thinking-3/tdd-reporter.mjs:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file experiments/runs/2026-10-01_00-49-48_claim-office-example-mapping_exact-hybrid-v2-testlist-fix-cc_opus-5-5-no-thinking-4/tdd-reporter.mjs:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file experiments/runs/2026-10-01_00-49-48_claim-office-example-mapping_exact-hybrid-v2-testlist-fix-cc_opus-5-5-no-thinking-5/tdd-reporter.mjs:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file experiments/runs/2026-10-01_00-49-48_claim-office-example-mapping_exact-hybrid-v2-testlist-fix-cc_opus-5-5-no-thinking/tdd-reporter.mjs:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file experiments/runs/2026-10-01_01-06-09_claim-office-example-mapping_exact-hybrid-v2.4-lab-split-cc_opus-5-5-no-thinking/tdd-reporter.mjs:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
D4 · Code Duplication· Edited copy of a member (7 corresponding lines) · ×16
Edited copy of a member (7 corresponding lines) experiments/runs/2026-09-20_06-40-05_game-of-life-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLifeCli.java:12— experiments/runs/2026-09-20_06-40-05_game-of-life-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLifeCli.java:12-18 | experiments/runs/2026-09-20_08-53-33_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-2/src/main/java/GameOfLifeCli.java:10-17 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) experiments/runs/2026-09-20_06-59-55_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/ComponentBlocks.java:20— experiments/runs/2026-09-20_06-59-55_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/ComponentBlocks.java:20-26 | experiments/runs/2026-09-20_07-28-04_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOffice.java:158-164 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) experiments/runs/2026-09-20_11-57-09_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/AlikeItems.java:15— experiments/runs/2026-09-20_11-57-09_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/AlikeItems.java:15-21 | experiments/runs/2026-09-20_07-18-13_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/Incident.java:53-59 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) experiments/runs/2026-10-01_12-21-28_claim-office-rust-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/policy.rs:64— experiments/runs/2026-10-01_12-21-28_claim-office-rust-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/policy.rs:64-74 | experiments/runs/2026-10-01_12-43-20_claim-office-rust-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/lib.rs:84-90 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) experiments/runs/2026-09-20_07-28-04_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOffice.java:115— experiments/runs/2026-09-20_07-28-04_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOffice.java:115-122 | experiments/runs/2026-09-20_10-13-24_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/ClaimOffice.java:196-202 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) experiments/runs/2026-09-20_07-28-11_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOfficeCli.java:63— experiments/runs/2026-09-20_07-28-11_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOfficeCli.java:63-70 | experiments/runs/2026-09-20_07-18-54_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/ScenarioRunner.java:53-59 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) experiments/runs/2026-09-20_07-18-13_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/Incident.java:45— experiments/runs/2026-09-20_07-18-13_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/Incident.java:45-51 | experiments/runs/2026-09-20_07-28-11_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/InsurancePolicy.java:98-104 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) experiments/runs/2026-10-01_12-43-20_claim-office-rust-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/json.rs:79— experiments/runs/2026-10-01_12-43-20_claim-office-rust-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/json.rs:79-88 | experiments/runs/2026-10-01_12-27-11_claim-office-rust-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/json.rs:106-112 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) experiments/runs/2026-10-01_12-33-47_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/lib.rs:693— experiments/runs/2026-10-01_12-33-47_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/lib.rs:693-699 | experiments/runs/2026-10-19_02-32-59_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/lib.rs:386-392 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) experiments/runs/2026-09-20_06-59-55_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOfficeCli.java:54— experiments/runs/2026-09-20_06-59-55_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOfficeCli.java:54-60 | experiments/runs/2026-09-20_10-13-24_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/ClaimOfficeCli.java:95-101 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) experiments/runs/2026-10-01_02-34-42_claim-office-rust-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/lib.rs:123— experiments/runs/2026-10-01_02-34-42_claim-office-rust-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/lib.rs:123-129 | experiments/runs/2026-10-01_12-12-08_claim-office-rust-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/lib.rs:209-220 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) experiments/runs/2026-09-20_06-39-36_game-of-life-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/GameOfLifeCli.java:38— experiments/runs/2026-09-20_06-39-36_game-of-life-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/GameOfLifeCli.java:38-45 | experiments/runs/2026-09-20_08-53-34_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-3/src/main/java/GameOfLifeCli.java:32-38 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) experiments/runs/2026-09-20_06-35-29_game-of-life-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLifeCli.java:25— experiments/runs/2026-09-20_06-35-29_game-of-life-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLifeCli.java:25-32 | experiments/runs/2026-09-20_08-53-33_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex/src/main/java/GameOfLifeCli.java:35-41 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) experiments/runs/2026-09-20_09-25-34_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/GameOfLife.java:35— experiments/runs/2026-09-20_09-25-34_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/GameOfLife.java:35-41 | experiments/runs/2026-09-20_09-37-48_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/GameOfLife.java:20-26 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) experiments/runs/2026-09-21_21-18-56_game-of-life-python-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/game_of_life.py:45— experiments/runs/2026-09-21_21-18-56_game-of-life-python-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/game_of_life.py:45-51 | experiments/runs/2026-09-21_22-06-47_game-of-life-python-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex/src/game_of_life.py:21-27 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) experiments/runs/2026-10-19_06-18-28_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/PremiumPolicy.java:50— experiments/runs/2026-10-19_06-18-28_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/PremiumPolicy.java:50-56 | experiments/runs/2026-10-19_06-18-28_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/PriceList.java:77-83 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (10 corresponding lines) · ×15
Edited copy of a member (10 corresponding lines) experiments/rq-status.py:44— experiments/rq-status.py:44-55 | site/prototype/extract.py:95-104 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) experiments/runs/2026-10-01_12-27-53_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/lib.rs:247— experiments/runs/2026-10-01_12-27-53_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/lib.rs:247-259 | experiments/runs/2026-10-19_02-32-59_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/lib.rs:136-145 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) experiments/runs/2026-09-20_07-18-54_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOfficeCli.java:12— experiments/runs/2026-09-20_07-18-54_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOfficeCli.java:12-21 | experiments/runs/2026-09-20_07-28-11_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOfficeCli.java:21-32 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) experiments/runs/2026-09-20_06-28-51_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLifeCli.java:29— experiments/runs/2026-09-20_06-28-51_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLifeCli.java:29-38 | experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/GameOfLifeCli.java:43-52 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) experiments/runs/2026-09-20_07-18-54_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/PremiumCalculator.java:63— experiments/runs/2026-09-20_07-18-54_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/PremiumCalculator.java:63-72 | experiments/runs/2026-09-20_07-28-11_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/Quote.java:52-61 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) experiments/runs/2026-09-20_10-40-56_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/ResultsWriter.java:32— experiments/runs/2026-09-20_10-40-56_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/ResultsWriter.java:32-41 | experiments/runs/2026-09-20_11-57-09_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/ScenarioJson.java:70-80 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) experiments/runs/2026-10-01_12-21-27_claim-office-rust-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/quote.rs:39— experiments/runs/2026-10-01_12-21-27_claim-office-rust-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/quote.rs:39-48 | experiments/runs/2026-10-01_12-27-11_claim-office-rust-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/quote.rs:104-113 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) experiments/runs/2026-10-01_12-27-11_claim-office-rust-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/json.rs:93— experiments/runs/2026-10-01_12-27-11_claim-office-rust-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/json.rs:93-102 | experiments/runs/2026-10-01_12-43-20_claim-office-rust-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/json.rs:99-109 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) experiments/runs/2026-10-01_12-12-08_claim-office-rust-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/quote.rs:27— experiments/runs/2026-10-01_12-12-08_claim-office-rust-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/quote.rs:27-36 | experiments/runs/2026-10-01_12-21-28_claim-office-rust-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/catalog.rs:5-14 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) experiments/runs/2026-09-20_06-48-34_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/PremiumCalculator.java:77— experiments/runs/2026-09-20_06-48-34_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/PremiumCalculator.java:77-86 | experiments/runs/2026-09-20_07-18-13_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOffice.java:49-58 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) experiments/runs/2026-09-20_06-41-22_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ItemCatalog.java:4— experiments/runs/2026-09-20_06-41-22_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ItemCatalog.java:4-13 | experiments/runs/2026-09-20_08-53-35_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-5/src/main/java/InsuranceValue.java:4-13 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) experiments/runs/2026-09-20_07-23-29_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/RiskSurcharge.java:11— experiments/runs/2026-09-20_07-23-29_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/RiskSurcharge.java:11-20 | experiments/runs/2026-09-20_07-33-00_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/RiskSurcharges.java:14-23 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) experiments/runs/2026-10-01_12-21-23_claim-office-rust-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/claim.rs:87— experiments/runs/2026-10-01_12-21-23_claim-office-rust-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/claim.rs:87-96 | experiments/runs/2026-10-01_12-21-28_claim-office-rust-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/claim.rs:38-47 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) experiments/runs/2026-09-20_07-23-29_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/CustomerHistory.java:21— experiments/runs/2026-09-20_07-23-29_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/CustomerHistory.java:21-31 | experiments/runs/2026-09-20_07-33-00_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/CustomerModifiers.java:20-29 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) experiments/runs/2026-10-01_12-43-20_claim-office-rust-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/lib.rs:323— experiments/runs/2026-10-01_12-43-20_claim-office-rust-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/lib.rs:323-332 | experiments/runs/2026-10-19_02-32-59_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/lib.rs:168-177 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Swallowed exception (empty catch) REDACTED:613— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) experiments/stacks/typescript-vitest/tdd-reporter.mjs:58— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) experiments/stacks/typescript-vitest/tdd-reporter.mjs:69— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) experiments/stacks/typescript-vitest/tdd-reporter.mjs:162— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) experiments/stacks/python-pytest/conftest.py:80— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) experiments/stacks/python-pytest/conftest.py:90— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) experiments/runs/2026-10-20_03-17-52_claim-office-user-story_exact-single-context-v1-cc_opus-4-7-no-thinking-2/tdd-reporter.mjs:58— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) experiments/runs/2026-10-20_03-17-52_claim-office-user-story_exact-single-context-v1-cc_opus-4-7-no-thinking-2/tdd-reporter.mjs:69— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) experiments/runs/2026-10-20_03-17-52_claim-office-user-story_exact-single-context-v1-cc_opus-4-7-no-thinking-2/tdd-reporter.mjs:162— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) experiments/runs/2026-10-20_03-17-52_claim-office-user-story_exact-single-context-v1-cc_opus-4-7-no-thinking/tdd-reporter.mjs:58— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) experiments/runs/2026-10-20_03-17-52_claim-office-user-story_exact-single-context-v1-cc_opus-4-7-no-thinking/tdd-reporter.mjs:69— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) experiments/runs/2026-10-20_03-17-52_claim-office-user-story_exact-single-context-v1-cc_opus-4-7-no-thinking/tdd-reporter.mjs:162— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
game-of-life.nextGeneration (cognitive 17) experiments/runs/2026-05-13_05-58-56_game-of-life-cli-prose_v5-exact-single-context_sonnet-4-6-portkey-no-thinking/src/game-of-life.ts:6— game-of-life.nextGeneration has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (7 pts), if/else 2 (6 pts), boolean chains 3, ternaries 1 (nesting depth added 7). Of this number, 16 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
game-of-life.nextGeneration (cognitive 17) experiments/runs/2026-05-14_21-31-17_game-of-life-prose_v1-oneshot_opus-4-7-no-thinking/src/game-of-life.ts:10— game-of-life.nextGeneration has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 2 (6 pts), boolean chains 3 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
game-of-life.nextGeneration (cognitive 17) experiments/runs/2026-05-14_21-32-37_game-of-life-prose_v2-iterative_opus-4-7-no-thinking/src/game-of-life.ts:7— game-of-life.nextGeneration has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 2 (6 pts), boolean chains 3 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
game-of-life.nextGeneration (cognitive 17) experiments/runs/2026-05-14_21-36-00_game-of-life-prose_v2-iterative_opus-4-7-no-thinking/src/game-of-life.ts:10— game-of-life.nextGeneration has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 2 (6 pts), boolean chains 3 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
game-of-life.nextGeneration (cognitive 17) experiments/runs/2026-05-14_23-35-11_game-of-life-prose_v1-oneshot_opus-4-7-no-thinking/src/game-of-life.ts:12— game-of-life.nextGeneration has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 3 (7 pts), boolean chains 2 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
game-of-life.nextGeneration (cognitive 17) experiments/runs/2026-05-14_23-37-10_game-of-life-prose_v1-oneshot_opus-4-7-no-thinking/src/game-of-life.ts:10— game-of-life.nextGeneration has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 3 (7 pts), boolean chains 2 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
game-of-life.nextGeneration (cognitive 17) experiments/runs/2026-05-14_23-44-37_game-of-life-prose_v1-oneshot_opus-4-7-no-thinking/src/game-of-life.ts:12— game-of-life.nextGeneration has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 2 (6 pts), boolean chains 3 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
game-of-life.nextGeneration (cognitive 17) experiments/runs/2026-05-14_23-45-58_game-of-life-prose_v2-iterative_opus-4-7-no-thinking/src/game-of-life.ts:10— game-of-life.nextGeneration has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 2 (6 pts), boolean chains 3 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
game-of-life.nextGeneration (cognitive 17) experiments/runs/2026-05-14_23-47-30_game-of-life-prose_v2-iterative_opus-4-7-no-thinking/src/game-of-life.ts:7— game-of-life.nextGeneration has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 2 (6 pts), boolean chains 3 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
game-of-life.nextGeneration (cognitive 17) experiments/runs/2026-05-14_23-49-23_game-of-life-prose_v2-iterative_opus-4-7-no-thinking/src/game-of-life.ts:10— game-of-life.nextGeneration has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 2 (6 pts), boolean chains 3 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
game-of-life.nextGeneration (cognitive 17) experiments/runs/2026-05-14_23-54-40_game-of-life-prose_v2-iterative_opus-4-7-no-thinking/src/game-of-life.ts:12— game-of-life.nextGeneration has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 3 (7 pts), boolean chains 2 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D4 · Code Duplication· Edited copy of a member (9 corresponding lines) · ×11
Edited copy of a member (9 corresponding lines) experiments/runs/2026-09-20_07-18-54_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/ScenarioRunner.java:92— experiments/runs/2026-09-20_07-18-54_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/ScenarioRunner.java:92-100 | experiments/runs/2026-09-20_07-18-54_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/ScenarioRunner.java:111-119 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) experiments/runs/2026-09-20_06-59-43_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:23— experiments/runs/2026-09-20_06-59-43_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:23-31 | experiments/runs/2026-09-20_09-37-48_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:25-35 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) experiments/runs/2026-09-20_06-35-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOffice.java:166— experiments/runs/2026-09-20_06-35-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOffice.java:166-174 | experiments/runs/2026-09-20_07-18-13_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/Quote.java:71-79 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) experiments/runs/2026-10-01_12-43-48_claim-office-rust-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/lib.rs:123— experiments/runs/2026-10-01_12-43-48_claim-office-rust-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/lib.rs:123-132 | experiments/runs/2026-10-19_02-32-59_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/lib.rs:600-608 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) experiments/runs/2026-09-20_08-53-34_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-3/src/main/java/GameOfLife.java:8— experiments/runs/2026-09-20_08-53-34_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-3/src/main/java/GameOfLife.java:8-17 | experiments/runs/2026-09-20_08-53-33_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex/src/main/java/GameOfLife.java:14-22 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) experiments/runs/2026-09-22_01-30-09_claim-office-python-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/cli.py:23— experiments/runs/2026-09-22_01-30-09_claim-office-python-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/cli.py:23-37 | experiments/runs/2026-09-22_02-08-36_claim-office-python-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/cli.py:12-20 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) experiments/runs/2026-09-20_06-40-50_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOfficeCli.java:139— experiments/runs/2026-09-20_06-40-50_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOfficeCli.java:139-147 | experiments/runs/2026-09-20_08-53-35_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-4/src/main/java/ClaimOfficeCli.java:77-85 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) experiments/runs/2026-09-20_08-53-35_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-5/src/main/java/CursedSurcharge.java:6— experiments/runs/2026-09-20_08-53-35_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-5/src/main/java/CursedSurcharge.java:6-14 | experiments/runs/2026-09-20_08-53-35_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-5/src/main/java/EnchantmentSurcharge.java:7-15 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) experiments/runs/2026-09-20_11-57-09_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/ItemRiskSurcharge.java:21— experiments/runs/2026-09-20_11-57-09_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/ItemRiskSurcharge.java:21-29 | experiments/runs/2026-09-20_11-57-09_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/PolicyModifiers.java:16-24 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) experiments/runs/2026-10-01_12-12-08_claim-office-rust-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/quote.rs:42— experiments/runs/2026-10-01_12-12-08_claim-office-rust-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/quote.rs:42-50 | experiments/runs/2026-10-01_12-21-28_claim-office-rust-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/catalog.rs:17-26 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) experiments/runs/2026-09-20_08-53-34_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-3/src/main/java/GameOfLife.java:41— experiments/runs/2026-09-20_08-53-34_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-3/src/main/java/GameOfLife.java:41-49 | experiments/runs/2026-09-20_09-37-48_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/GameOfLife.java:45-53 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (9 lines × 2) experiments/runs/2026-09-20_06-35-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOffice.java:238— experiments/runs/2026-09-20_06-35-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOffice.java:238-246 | experiments/runs/2026-09-20_06-35-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOffice.java:199-207 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (9 lines × 2) experiments/runs/2026-09-20_08-53-34_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-3/src/main/java/GameOfLife.java:31— experiments/runs/2026-09-20_08-53-34_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-3/src/main/java/GameOfLife.java:31-39 | experiments/runs/2026-09-20_08-53-34_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex/src/main/java/Neighborhood.java:21-29 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `experiments/runs/2026-09-20_08-53-34_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-3/src/main/java/GameOfLife.java:31` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (9 lines × 2) experiments/runs/2026-09-20_06-35-29_game-of-life-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/Cell.java:6— experiments/runs/2026-09-20_06-35-29_game-of-life-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/Cell.java:6-14 | experiments/runs/2026-09-20_08-53-33_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-2/src/main/java/Cell.java:6-14 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (9 lines × 2) experiments/runs/2026-09-20_08-53-35_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-5/src/main/java/PriceList.java:29— experiments/runs/2026-09-20_08-53-35_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-5/src/main/java/PriceList.java:29-37 | experiments/runs/2026-09-20_08-53-35_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex/src/main/java/QuotePricing.java:55-63 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (9 lines × 2) experiments/runs/2026-09-20_06-53-35_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/gameoflife/GameOfLife.java:11— experiments/runs/2026-09-20_06-53-35_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/gameoflife/GameOfLife.java:11-19 | experiments/runs/2026-09-20_09-37-48_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/GameOfLife.java:10-18 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (9 lines × 2) experiments/runs/2026-09-20_06-59-55_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOfficeCli.java:20— experiments/runs/2026-09-20_06-59-55_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOfficeCli.java:20-28 | experiments/runs/2026-09-20_07-33-00_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOfficeCli.java:21-29 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (9 lines × 2) experiments/runs/2026-09-22_00-12-48_claim-office-python-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/cli.py:10— experiments/runs/2026-09-22_00-12-48_claim-office-python-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/cli.py:10-18 | experiments/runs/2026-09-22_05-55-30_claim-office-python-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/cli.py:42-51 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (9 lines × 2) experiments/runs/2026-10-01_14-35-25_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex/src/lib.rs:106— experiments/runs/2026-10-01_14-35-25_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex/src/lib.rs:106-114 | experiments/runs/2026-10-01_14-39-03_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/lib.rs:89-97 — before extracting anything, compare `experiments/runs/2026-10-01_14-35-25_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex/src/lib.rs` and `experiments/runs/2026-10-01_14-39-03_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/lib.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `experiments/runs/2026-10-01_14-35-25_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex/src/lib.rs:106` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) experiments/runs/2026-10-01_02-34-42_claim-office-rust-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/lib.rs:102— experiments/runs/2026-10-01_02-34-42_claim-office-rust-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/lib.rs:102-110 | experiments/runs/2026-10-01_12-48-19_claim-office-rust-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/lib.rs:321-329 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (9 lines × 2) experiments/runs/2026-10-01_02-34-42_claim-office-rust-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/lib.rs:209— experiments/runs/2026-10-01_02-34-42_claim-office-rust-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/lib.rs:209-217 | experiments/runs/2026-10-01_12-48-19_claim-office-rust-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/lib.rs:85-93 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (9 lines × 2) experiments/runs/2026-10-01_12-12-08_claim-office-rust-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/lib.rs:131— experiments/runs/2026-10-01_12-12-08_claim-office-rust-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/lib.rs:131-139 | experiments/runs/2026-10-19_02-32-59_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/lib.rs:723-731 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (8 lines × 2) experiments/parse_pi_transcript.py:281— experiments/parse_pi_transcript.py:281-288 | experiments/parse_pi_transcript.py:540-547 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLife.java:18— experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLife.java:18-25 | experiments/runs/2026-09-20_06-35-29_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLife.java:10-17 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLife.java:18` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) experiments/runs/2026-09-20_06-35-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOffice.java:113— experiments/runs/2026-09-20_06-35-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOffice.java:113-120 | experiments/runs/2026-09-20_06-35-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOffice.java:84-91 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (8 lines × 2) experiments/runs/2026-09-20_07-33-00_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/Policy.java:46— experiments/runs/2026-09-20_07-33-00_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/Policy.java:46-53 | experiments/runs/2026-09-20_09-40-30_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/Policy.java:44-51 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (8 lines × 2) experiments/runs/2026-09-20_06-28-51_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLife.java:32— experiments/runs/2026-09-20_06-28-51_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLife.java:32-39 | experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLife.java:26-33 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLife.java:26` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) experiments/runs/2026-09-20_06-48-34_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/ScenarioRunner.java:64— experiments/runs/2026-09-20_06-48-34_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/ScenarioRunner.java:64-71 | experiments/runs/2026-09-20_07-28-11_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOfficeCli.java:93-100 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `experiments/runs/2026-09-20_06-48-34_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/ScenarioRunner.java:64` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (8 lines × 2) experiments/runs/2026-09-20_07-22-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/Scenario.java:23— experiments/runs/2026-09-20_07-22-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/Scenario.java:23-30 | experiments/runs/2026-09-20_07-28-11_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOfficeCli.java:40-47 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `experiments/runs/2026-09-20_07-22-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/Scenario.java:23` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) experiments/runs/2026-09-20_06-35-28_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOffice.java:219— experiments/runs/2026-09-20_06-35-28_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOffice.java:219-226 | experiments/runs/2026-09-20_06-35-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOffice.java:256-263 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (8 lines × 2) experiments/runs/2026-10-01_12-21-28_claim-office-rust-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/scenario.rs:152— experiments/runs/2026-10-01_12-21-28_claim-office-rust-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/scenario.rs:152-159 | experiments/runs/2026-10-01_12-27-33_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/scenario.rs:52-59 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
D4 · Code Duplication· Edited copy of a member (8 corresponding lines) · ×9
Edited copy of a member (8 corresponding lines) experiments/runs/2026-09-20_06-28-51_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLife.java:41— experiments/runs/2026-09-20_06-28-51_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLife.java:41-48 | experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLife.java:46-53 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) experiments/runs/2026-09-20_09-31-01_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/GenerationJson.java:26— experiments/runs/2026-09-20_09-31-01_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/GenerationJson.java:26-33 | experiments/runs/2026-09-20_09-38-26_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/AliveCellsJson.java:28-35 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) experiments/runs/2026-09-20_07-18-13_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/Incident.java:19— experiments/runs/2026-09-20_07-18-13_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/Incident.java:19-26 | experiments/runs/2026-09-20_07-18-54_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/Policy.java:47-54 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) experiments/runs/2026-09-20_07-23-24_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOffice.java:135— experiments/runs/2026-09-20_07-23-24_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOffice.java:135-144 | experiments/runs/2026-09-20_10-13-24_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/ClaimOffice.java:157-164 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) experiments/runs/2026-09-21_23-56-52_claim-office-python-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/office.py:49— experiments/runs/2026-09-21_23-56-52_claim-office-python-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/office.py:49-56 | experiments/runs/2026-09-22_01-57-46_claim-office-python-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/quote.py:52-59 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) experiments/runs/2026-09-20_10-40-56_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/ResultsWriter.java:23— experiments/runs/2026-09-20_10-40-56_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/ResultsWriter.java:23-30 | experiments/runs/2026-09-20_11-57-09_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/ScenarioJson.java:27-34 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) experiments/runs/2026-09-21_21-33-20_claim-office-python-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex-2/src/claim_office.py:62— experiments/runs/2026-09-21_21-33-20_claim-office-python-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex-2/src/claim_office.py:62-72 | experiments/runs/2026-09-21_22-43-48_claim-office-python-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex/src/claim_office.py:144-151 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) experiments/runs/2026-09-20_08-53-35_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOfficeCli.java:139— experiments/runs/2026-09-20_08-53-35_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOfficeCli.java:139-146 | experiments/runs/2026-09-20_08-53-35_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-3/src/main/java/ClaimOffice.java:241-248 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) experiments/runs/2026-09-20_06-35-28_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOfficeCli.java:232— experiments/runs/2026-09-20_06-35-28_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOfficeCli.java:232-239 | experiments/runs/2026-09-20_06-35-30_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOffice.java:167-174 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (7 lines × 2) experiments/runs/2026-09-20_08-53-35_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-3/src/main/java/ClaimOffice.java:23— experiments/runs/2026-09-20_08-53-35_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-3/src/main/java/ClaimOffice.java:23-29 | experiments/runs/2026-09-20_08-53-35_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-5/src/main/java/ClaimOfficeCli.java:25-31 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `experiments/runs/2026-09-20_08-53-35_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-3/src/main/java/ClaimOffice.java:23` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) experiments/runs/2026-09-20_06-35-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOffice.java:221— experiments/runs/2026-09-20_06-35-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOffice.java:221-227 | experiments/runs/2026-09-20_06-35-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOffice.java:163-169 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (7 lines × 2) experiments/runs/2026-09-20_06-35-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOffice.java:229— experiments/runs/2026-09-20_06-35-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOffice.java:229-235 | experiments/runs/2026-09-20_06-35-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOffice.java:171-177 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (7 lines × 2) experiments/runs/2026-09-20_06-41-22_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimProcessor.java:23— experiments/runs/2026-09-20_06-41-22_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimProcessor.java:23-29 | experiments/runs/2026-09-20_08-53-35_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-4/src/main/java/ClaimOfficeCli.java:189-195 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (7 lines × 2) experiments/runs/2026-09-20_06-53-35_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/gameoflife/GameOfLife.java:21— experiments/runs/2026-09-20_06-53-35_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/gameoflife/GameOfLife.java:21-27 | experiments/runs/2026-09-20_08-53-33_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-2/src/main/java/GameOfLife.java:19-25 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (7 lines × 2) experiments/runs/2026-09-20_06-59-43_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLife.java:16— experiments/runs/2026-09-20_06-59-43_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLife.java:16-22 | experiments/runs/2026-09-20_09-31-01_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/gameoflife/GameOfLife.java:26-32 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (7 lines × 2) experiments/runs/2026-09-20_07-23-29_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/PriceList.java:33— experiments/runs/2026-09-20_07-23-29_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/PriceList.java:33-39 | experiments/runs/2026-09-20_10-13-24_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/ClaimOffice.java:175-181 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (7 lines × 2) experiments/runs/2026-09-20_06-59-43_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLife.java:24— experiments/runs/2026-09-20_06-59-43_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLife.java:24-30 | experiments/runs/2026-09-20_09-37-48_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/GameOfLife.java:28-34 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (7 lines × 2) experiments/runs/2026-09-21_21-09-45_game-of-life-python-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/game_of_life.py:20— experiments/runs/2026-09-21_21-09-45_game-of-life-python-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/game_of_life.py:20-26 | experiments/runs/2026-09-22_06-32-50_game-of-life-python-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/game_of_life.py:21-28 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `experiments/runs/2026-09-22_06-32-50_game-of-life-python-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/game_of_life.py:16` calls `frozenset` and `experiments/runs/2026-09-21_21-09-45_game-of-life-python-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/game_of_life.py:16` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication· Edited copy of a member (6 corresponding lines) · ×8
Edited copy of a member (6 corresponding lines) experiments/generate-snapshot-skeleton.py:33— experiments/generate-snapshot-skeleton.py:33-41 | experiments/rq-status.py:35-40 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (6 corresponding lines) experiments/runs/2026-09-20_06-58-06_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLife.java:44— experiments/runs/2026-09-20_06-58-06_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLife.java:44-49 | experiments/runs/2026-09-20_06-58-08_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLife.java:38-45 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (6 corresponding lines) experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex/src/lib.rs:25— experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex/src/lib.rs:25-30 | experiments/runs/2026-10-01_12-16-09_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/lib.rs:25-32 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (6 corresponding lines) experiments/runs/2026-10-01_12-17-52_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/lib.rs:207— experiments/runs/2026-10-01_12-17-52_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/lib.rs:207-214 | experiments/runs/2026-10-01_12-27-11_claim-office-rust-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/claim.rs:98-103 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (6 corresponding lines) experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex-4/src/lib.rs:68— experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex-4/src/lib.rs:68-73 | experiments/runs/2026-10-01_12-15-39_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/lib.rs:74-82 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (6 corresponding lines) experiments/runs/2026-09-20_06-35-28_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOffice.java:167— experiments/runs/2026-09-20_06-35-28_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOffice.java:167-172 | experiments/runs/2026-09-20_06-35-30_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOffice.java:140-145 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (6 corresponding lines) experiments/runs/2026-09-21_21-18-56_game-of-life-python-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/game_of_life.py:35— experiments/runs/2026-09-21_21-18-56_game-of-life-python-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/game_of_life.py:35-41 | experiments/runs/2026-09-21_21-19-30_game-of-life-python-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/game_of_life.py:41-46 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (6 corresponding lines) experiments/runs/2026-09-20_06-35-28_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOfficeCli.java:273— experiments/runs/2026-09-20_06-35-28_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOfficeCli.java:273-278 | experiments/runs/2026-09-20_06-35-28_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOffice.java:178-183 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (11 corresponding lines) · ×8
Edited copy of a member (11 corresponding lines) experiments/runs/2026-09-20_06-59-55_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOfficeCli.java:42— experiments/runs/2026-09-20_06-59-55_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOfficeCli.java:42-52 | experiments/runs/2026-09-20_07-23-29_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOfficeCli.java:43-54 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) experiments/runs/2026-09-20_07-23-24_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOffice.java:194— experiments/runs/2026-09-20_07-23-24_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOffice.java:194-204 | experiments/runs/2026-09-20_07-23-29_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOffice.java:47-58 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) experiments/runs/2026-09-20_06-39-36_game-of-life-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLife.java:12— experiments/runs/2026-09-20_06-39-36_game-of-life-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLife.java:12-22 | experiments/runs/2026-09-20_06-39-36_game-of-life-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLife.java:40-50 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) experiments/runs/2026-10-01_12-16-09_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/lib.rs:8— experiments/runs/2026-10-01_12-16-09_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/lib.rs:8-18 | experiments/runs/2026-10-01_12-21-27_claim-office-rust-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/pricing.rs:10-23 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) experiments/runs/2026-09-20_07-28-04_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOffice.java:103— experiments/runs/2026-09-20_07-28-04_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOffice.java:103-113 | experiments/runs/2026-09-20_09-40-30_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/PolicyModifiers.java:36-47 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) experiments/runs/2026-10-01_12-21-28_claim-office-rust-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/scenario.rs:24— experiments/runs/2026-10-01_12-21-28_claim-office-rust-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/scenario.rs:24-35 | experiments/runs/2026-10-01_12-21-23_claim-office-rust-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/scenario.rs:82-92 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) experiments/runs/2026-09-21_21-09-44_game-of-life-python-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-3/src/game_of_life.py:30— experiments/runs/2026-09-21_21-09-44_game-of-life-python-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-3/src/game_of_life.py:30-40 | experiments/runs/2026-09-22_00-17-00_game-of-life-python-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/game_of_life.py:30-43 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) experiments/runs/2026-09-21_22-37-47_claim-office-python-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex/src/cli.py:115— experiments/runs/2026-09-21_22-37-47_claim-office-python-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex/src/cli.py:115-125 | experiments/runs/2026-09-21_23-21-10_claim-office-python-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex/src/premium.py:131-141 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (5 lines × 2) experiments/runs/2026-09-20_06-53-35_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:22— experiments/runs/2026-09-20_06-53-35_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:22-27 | experiments/runs/2026-09-20_06-59-41_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:22-26 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (5 lines × 2) experiments/runs/2026-09-20_06-56-38_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/gol/GameOfLife.java:18— experiments/runs/2026-09-20_06-56-38_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/gol/GameOfLife.java:18-22 | experiments/runs/2026-09-20_09-38-26_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/gameoflife/GameOfLife.java:28-32 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (5 lines × 2) experiments/runs/2026-09-20_06-58-06_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GenerationJson.java:47— experiments/runs/2026-09-20_06-58-06_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GenerationJson.java:47-51 | experiments/runs/2026-09-20_07-04-55_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:53-57 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (5 lines × 2) experiments/runs/2026-09-20_07-01-23_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLife.java:13— experiments/runs/2026-09-20_07-01-23_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLife.java:13-17 | experiments/runs/2026-09-20_07-04-55_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLife.java:13-17 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (5 lines × 2) experiments/runs/2026-09-20_07-04-55_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLife.java:7— experiments/runs/2026-09-20_07-04-55_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLife.java:7-11 | experiments/runs/2026-09-20_09-38-26_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/gameoflife/GameOfLife.java:22-26 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (5 lines × 2) experiments/runs/2026-09-20_06-40-05_game-of-life-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLife.java:17— experiments/runs/2026-09-20_06-40-05_game-of-life-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLife.java:17-21 | experiments/runs/2026-09-20_08-53-33_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex/src/main/java/Neighborhood.java:7-11 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (5 lines × 2) experiments/runs/2026-09-20_09-31-01_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/GenerationJson.java:29— experiments/runs/2026-09-20_09-31-01_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/GenerationJson.java:29-33 | experiments/runs/2026-09-20_09-38-26_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/AliveCellsJson.java:31-35 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `experiments/runs/2026-09-20_09-31-01_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/GenerationJson.java:29` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (5 lines × 2) experiments/runs/2026-10-01_02-28-23_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex/src/lib.rs:14— experiments/runs/2026-10-01_02-28-23_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex/src/lib.rs:14-18 | experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex/src/lib.rs:19-23 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Unused dependency 'dev' experiments/runs/2026-05-12_06-07-32_claim-office-user-story_v5-exact-single-context_sonnet-4-6-portkey/package.json:26— Declared in experiments/runs/2026-05-12_06-07-32_claim-office-user-story_v5-exact-single-context_sonnet-4-6-portkey/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
Unused dependency 'dev' experiments/runs/2026-05-12_07-22-03_claim-office-prose_v5-exact-single-context_sonnet-4-6-portkey-no-thinking-2/package.json:25— Declared in experiments/runs/2026-05-12_07-22-03_claim-office-prose_v5-exact-single-context_sonnet-4-6-portkey-no-thinking-2/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
Unused dependency 'dev' experiments/runs/2026-05-13_00-24-43_game-of-life-cli-example-mapping_v5-exact-single-context_haiku-4-5-portkey-no-thinking/package.json:25— Declared in experiments/runs/2026-05-13_00-24-43_game-of-life-cli-example-mapping_v5-exact-single-context_haiku-4-5-portkey-no-thinking/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
Unused dependency 'dev' experiments/runs/2026-05-27_23-24-13_game-of-life-example-mapping_v5.1-testlist-scope-fix-oc_deepseek-v4-flash/package.json:26— Declared in experiments/runs/2026-05-27_23-24-13_game-of-life-example-mapping_v5.1-testlist-scope-fix-oc_deepseek-v4-flash/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
Unused dependency 'dev' experiments/runs/2026-07-25_01-23-55_claim-office-example-mapping_v6.2-with-why-cleaned-pi_minimax-m3-no-thinking-4/package.json:26— Declared in experiments/runs/2026-07-25_01-23-55_claim-office-example-mapping_v6.2-with-why-cleaned-pi_minimax-m3-no-thinking-4/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
Unused dependency 'dev' experiments/runs/2026-08-17_00-17-09_sphinx-score-example-mapping_basic-sol-tdd-subagent-pi_gpt-5-3-codex-spark-2/package.json:25— Declared in experiments/runs/2026-08-17_00-17-09_sphinx-score-example-mapping_basic-sol-tdd-subagent-pi_gpt-5-3-codex-spark-2/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
Unused dependency 'dev' experiments/runs/2026-08-17_00-37-28_sphinx-score-example-mapping_basic-sol-tdd-pi_gpt-5-3-codex-spark-3/package.json:25— Declared in experiments/runs/2026-08-17_00-37-28_sphinx-score-example-mapping_basic-sol-tdd-pi_gpt-5-3-codex-spark-3/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
Unused dependency 'dev' experiments/runs/2026-08-17_00-43-42_sphinx-score-example-mapping_basic-sol-tdd-subagent-pi_gpt-5-3-codex-spark/package.json:26— Declared in experiments/runs/2026-08-17_00-43-42_sphinx-score-example-mapping_basic-sol-tdd-subagent-pi_gpt-5-3-codex-spark/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
Duplicated block (6 lines × 2) experiments/runs/2026-09-20_06-35-28_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOfficeCli.java:60— experiments/runs/2026-09-20_06-35-28_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOfficeCli.java:60-65 | experiments/runs/2026-09-20_06-35-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOffice.java:27-32 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `experiments/runs/2026-09-20_06-35-28_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOfficeCli.java:60` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) experiments/runs/2026-09-20_07-18-13_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/Quote.java:42— experiments/runs/2026-09-20_07-18-13_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/Quote.java:42-47 | experiments/runs/2026-09-20_07-28-11_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/Quote.java:34-39 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `experiments/runs/2026-09-20_07-18-13_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/Quote.java:42` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) experiments/runs/2026-09-20_07-01-23_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:38— experiments/runs/2026-09-20_07-01-23_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:38-43 | experiments/runs/2026-09-20_07-04-55_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:37-42 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (6 lines × 2) experiments/runs/2026-09-20_08-53-33_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-2/src/main/java/CellCoordinatesMapper.java:16— experiments/runs/2026-09-20_08-53-33_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-2/src/main/java/CellCoordinatesMapper.java:16-21 | experiments/runs/2026-09-20_08-53-34_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex/src/main/java/GameOfLifeCli.java:35-40 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (6 lines × 2) experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex-3/src/lib.rs:124— experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex-3/src/lib.rs:124-129 | experiments/runs/2026-10-01_14-35-25_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex/src/lib.rs:126-131 — before extracting anything, compare `experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex-3/src/lib.rs` and `experiments/runs/2026-10-01_14-35-25_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex/src/lib.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex-3/src/lib.rs:124` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex-3/src/lib.rs:131— experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex-3/src/lib.rs:131-136 | experiments/runs/2026-10-01_14-35-25_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex/src/lib.rs:133-138 — before extracting anything, compare `experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex-3/src/lib.rs` and `experiments/runs/2026-10-01_14-35-25_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex/src/lib.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex-3/src/lib.rs:131` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex/src/lib.rs:68— experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex/src/lib.rs:68-73 | experiments/runs/2026-10-01_14-39-03_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/lib.rs:70-75 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex/src/lib.rs:68` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Hotspot: .claude/skills/exact-coding-baseline-export/export-sol.py .claude/skills/exact-coding-baseline-export/export-sol.py:730— .claude/skills/exact-coding-baseline-export/export-sol.py changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in export-sol.validate at line 730. 2 of those changes were fix/bug commits, and the other 22 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-15 12:52:06 +01:00' --until='2026-11-13 12:52:06 +01:00' --full-history --no-merges -- .claude/skills/exact-coding-baseline-export/export-sol.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: REDACTED REDACTED:1059— REDACTED changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in compute-mutation-score.main at line 1059. 1 of those changes was a fix/bug commit, and the other 10 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-15 12:52:06 +01:00' --until='2026-11-13 12:52:06 +01:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: experiments/tdd-report.py experiments/tdd-report.py:98— experiments/tdd-report.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in tdd-report.classify at line 98. 1 of those changes was a fix/bug commit, and the other 5 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-15 12:52:06 +01:00' --until='2026-11-13 12:52:06 +01:00' --full-history --no-merges -- experiments/tdd-report.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: experiments/measure-tdd-rigour.py experiments/measure-tdd-rigour.py:114— experiments/measure-tdd-rigour.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in measure-tdd-rigour.analyse at line 114. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-15 12:52:06 +01:00' --until='2026-11-13 12:52:06 +01:00' --full-history --no-merges -- experiments/measure-tdd-rigour.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: experiments/analyze_transcript.py experiments/analyze_transcript.py:864— experiments/analyze_transcript.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in analyze_transcript.main at line 864. 1 of those changes was a fix/bug commit, and the other 2 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-15 12:52:06 +01:00' --until='2026-11-13 12:52:06 +01:00' --full-history --no-merges -- experiments/analyze_transcript.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: experiments/workflow-lineage.py experiments/workflow-lineage.py:74— experiments/workflow-lineage.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in workflow-lineage.check at line 74. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-15 12:52:06 +01:00' --until='2026-11-13 12:52:06 +01:00' --full-history --no-merges -- experiments/workflow-lineage.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
D4 · Code Duplication· Edited copies of one member (3 members, 8+ corresponding lines) · ×6
Edited copies of one member (3 members, 8+ corresponding lines) experiments/runs/2026-09-20_07-33-00_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOfficeCli.java:84— experiments/runs/2026-09-20_07-33-00_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOfficeCli.java:84-94 | experiments/runs/2026-09-20_08-53-35_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-5/src/main/java/ClaimOfficeCli.java:77-84 | experiments/runs/2026-09-20_10-40-56_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/ScenarioReader.java:43-50 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 8+ corresponding lines) experiments/runs/2026-09-20_07-01-23_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:45— experiments/runs/2026-09-20_07-01-23_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:45-52 | experiments/runs/2026-09-20_09-27-18_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/GameOfLifeJson.java:33-40 | experiments/runs/2026-09-20_09-38-26_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/AliveCellsJson.java:37-44 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 8+ corresponding lines) experiments/runs/2026-09-20_06-59-43_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:50— experiments/runs/2026-09-20_06-59-43_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:50-57 | experiments/runs/2026-09-20_07-04-55_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:44-51 | experiments/runs/2026-09-20_09-25-34_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:42-49 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 8+ corresponding lines) experiments/runs/2026-09-20_07-33-00_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/Policy.java:28— experiments/runs/2026-09-20_07-33-00_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/Policy.java:28-35 | experiments/runs/2026-09-20_09-40-30_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/Policy.java:33-40 | experiments/runs/2026-09-20_10-40-56_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/DamagedItem.java:27-34 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 8+ corresponding lines) experiments/runs/2026-09-21_23-56-52_claim-office-python-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/cli.py:13— experiments/runs/2026-09-21_23-56-52_claim-office-python-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/cli.py:13-21 | experiments/runs/2026-09-22_00-05-32_claim-office-python-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/cli.py:10-18 | experiments/runs/2026-09-22_01-57-46_claim-office-python-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/cli.py:13-20 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 8+ corresponding lines) experiments/runs/2026-09-21_21-33-20_claim-office-python-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/cli.py:8— experiments/runs/2026-09-21_21-33-20_claim-office-python-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/cli.py:8-15 | experiments/runs/2026-09-22_00-18-38_claim-office-python-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/cli.py:13-21 | experiments/runs/2026-09-22_00-20-04_claim-office-python-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/cli.py:10-17 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
TodoComment experiments/runs/2026-07-25_10-35-55_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b-no-thinking/src/claim-office-mapping.ts:2— // TODO: Implement the full logic for quotes and claims — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment experiments/runs/2026-07-25_10-34-28_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b-no-thinking/src/claim-office.ts:2— // TODO: implement — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment experiments/runs/2026-05-13_05-43-51_game-of-life-cli-example-mapping_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/gameOfLife.ts:48— // TODO: Implement generation advancement for other configurations — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment experiments/runs/2026-05-12_08-47-44_claim-office-user-story_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/claim-office.ts:3— // TODO — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment experiments/runs/2026-05-12_08-47-44_claim-office-user-story_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/claim-office.ts:7— // TODO — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
game-of-life.nextGeneration (cognitive 19) experiments/runs/2026-05-03_11-01-33_game-of-life-prose_v3-basic-tdd_opus-4-7-no-thinking/src/game-of-life.ts:10— game-of-life.nextGeneration has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 3 (7 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
game-of-life.nextGeneration (cognitive 19) experiments/runs/2026-05-03_13-07-14_game-of-life-user-story_v3-basic-tdd_opus-4-7-no-thinking/src/game-of-life.ts:10— game-of-life.nextGeneration has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 3 (7 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
game-of-life.nextGeneration (cognitive 19) experiments/runs/2026-05-14_23-33-30_game-of-life-prose_v1-oneshot_opus-4-7-no-thinking/src/game-of-life.ts:12— game-of-life.nextGeneration has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 3 (7 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
game-of-life.nextGeneration (cognitive 19) experiments/runs/2026-05-14_23-43-02_game-of-life-prose_v1-oneshot_opus-4-7-no-thinking/src/game-of-life.ts:12— game-of-life.nextGeneration has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 3 (7 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
game-of-life.nextGeneration (cognitive 19) experiments/runs/2026-05-14_23-56-15_game-of-life-prose_v2-iterative_opus-4-7-no-thinking/src/game-of-life.ts:10— game-of-life.nextGeneration has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 3 (7 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D4 · Code Duplication· Edited copy of a member (15 corresponding lines) · ×5
Edited copy of a member (15 corresponding lines) REDACTED:569— REDACTED:569-586 | REDACTED:683-697 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (15 corresponding lines) experiments/runs/2026-09-20_06-48-34_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/ScenarioRunner.java:44— experiments/runs/2026-09-20_06-48-34_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/ScenarioRunner.java:44-58 | experiments/runs/2026-09-20_07-22-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/Scenario.java:47-61 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (15 corresponding lines) experiments/runs/2026-09-21_21-31-47_claim-office-python-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/claim_office.py:124— experiments/runs/2026-09-21_21-31-47_claim-office-python-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/claim_office.py:124-139 | experiments/runs/2026-09-21_22-37-47_claim-office-python-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex/src/cli.py:204-218 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (15 corresponding lines) experiments/runs/2026-10-01_12-27-53_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/lib.rs:707— experiments/runs/2026-10-01_12-27-53_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/lib.rs:707-724 | experiments/runs/2026-10-01_12-33-47_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/wire.rs:103-117 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (15 corresponding lines) experiments/runs/2026-09-22_00-12-48_claim-office-python-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/claim_office.py:112— experiments/runs/2026-09-22_00-12-48_claim-office-python-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/claim_office.py:112-126 | experiments/runs/2026-09-22_05-55-30_claim-office-python-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/cli.py:20-38 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (13 corresponding lines) · ×5
Edited copy of a member (13 corresponding lines) experiments/runs/2026-09-20_06-35-29_game-of-life-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLifeCli.java:11— experiments/runs/2026-09-20_06-35-29_game-of-life-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLifeCli.java:11-23 | experiments/runs/2026-09-20_06-39-44_game-of-life-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLifeCli.java:18-32 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (13 corresponding lines) experiments/runs/2026-09-20_06-40-50_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOfficeCli.java:50— experiments/runs/2026-09-20_06-40-50_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOfficeCli.java:50-62 | experiments/runs/2026-09-20_06-41-41_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOffice.java:23-39 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (13 corresponding lines) experiments/runs/2026-10-01_12-12-08_claim-office-rust-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/lib.rs:270— experiments/runs/2026-10-01_12-12-08_claim-office-rust-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/lib.rs:270-282 | experiments/runs/2026-10-01_12-27-11_claim-office-rust-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/claim.rs:79-94 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (13 corresponding lines) experiments/runs/2026-10-01_12-15-39_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/lib.rs:45— experiments/runs/2026-10-01_12-15-39_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/lib.rs:45-57 | experiments/runs/2026-10-01_14-35-25_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex/src/lib.rs:32-44 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (13 corresponding lines) experiments/runs/2026-09-20_06-40-50_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOfficeCli.java:88— experiments/runs/2026-09-20_06-40-50_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOfficeCli.java:88-101 | experiments/runs/2026-09-20_06-41-29_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOfficeCli.java:104-116 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (12 corresponding lines) · ×5
Edited copy of a member (12 corresponding lines) experiments/runs/2026-09-20_06-35-29_game-of-life-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/Cell.java:5— experiments/runs/2026-09-20_06-35-29_game-of-life-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/Cell.java:5-16 | experiments/runs/2026-09-20_08-53-33_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-2/src/main/java/Cell.java:5-16 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) experiments/runs/2026-10-01_14-35-25_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex/src/lib.rs:19— experiments/runs/2026-10-01_14-35-25_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex/src/lib.rs:19-30 | experiments/runs/2026-10-01_14-39-03_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/lib.rs:18-29 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) experiments/runs/2026-09-21_21-30-38_claim-office-python-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/claim_office.py:127— experiments/runs/2026-09-21_21-30-38_claim-office-python-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/claim_office.py:127-138 | experiments/runs/2026-09-22_00-18-38_claim-office-python-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/policy.py:22-38 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) experiments/runs/2026-10-01_12-12-08_claim-office-rust-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main.rs:156— experiments/runs/2026-10-01_12-12-08_claim-office-rust-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main.rs:156-167 | experiments/runs/2026-10-01_12-17-52_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main.rs:22-33 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) experiments/runs/2026-09-20_06-35-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOffice.java:285— experiments/runs/2026-09-20_06-35-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOffice.java:285-296 | experiments/runs/2026-09-20_06-35-30_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOffice.java:202-213 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (4 corresponding lines) · ×5
Edited copy of a member (4 corresponding lines) experiments/runs/2026-09-21_21-50-41_game-of-life-python-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex/src/cli.py:14— experiments/runs/2026-09-21_21-50-41_game-of-life-python-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex/src/cli.py:14-17 | experiments/runs/2026-09-21_21-55-39_game-of-life-python-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex/src/cli.py:8-11 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (4 corresponding lines) experiments/runs/2026-09-21_21-31-47_claim-office-python-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/claim_office.py:98— experiments/runs/2026-09-21_21-31-47_claim-office-python-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/claim_office.py:98-101 | experiments/runs/2026-09-21_22-37-47_claim-office-python-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex/src/cli.py:180-183 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (4 corresponding lines) experiments/runs/2026-09-21_23-55-36_game-of-life-python-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/game_of_life.py:13— experiments/runs/2026-09-21_23-55-36_game-of-life-python-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/game_of_life.py:13-16 | experiments/runs/2026-09-22_00-15-52_game-of-life-python-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/game_of_life.py:12-15 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (4 corresponding lines) experiments/runs/2026-10-01_12-12-08_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/lib.rs:71— experiments/runs/2026-10-01_12-12-08_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/lib.rs:71-74 | experiments/runs/2026-10-01_12-16-10_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/domain.rs:98-101 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (4 corresponding lines) experiments/runs/2026-09-21_21-33-20_claim-office-python-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/claim_office.py:119— experiments/runs/2026-09-21_21-33-20_claim-office-python-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/claim_office.py:119-122 | experiments/runs/2026-09-22_04-53-29_claim-office-python-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/claim.py:78-87 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (7 lines × 3) experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/GameOfLife.java:27— experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/GameOfLife.java:27-33 | experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-3/src/main/java/GameOfLife.java:25-31 | experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLife.java:35-41 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/GameOfLife.java:23` calls `requireNonNull` and `experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-3/src/main/java/GameOfLife.java:21` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (7 lines × 3) experiments/runs/2026-09-20_06-35-28_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOfficeCli.java:246— experiments/runs/2026-09-20_06-35-28_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOfficeCli.java:246-252 | experiments/runs/2026-09-20_06-35-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOffice.java:213-219 | experiments/runs/2026-09-20_06-35-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOffice.java:155-161 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (7 lines × 3) experiments/runs/2026-09-20_06-55-04_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:33— experiments/runs/2026-09-20_06-55-04_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:33-39 | experiments/runs/2026-09-20_09-25-34_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:28-34 | experiments/runs/2026-09-20_09-37-48_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:46-52 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (7 lines × 3) experiments/runs/2026-09-20_07-18-54_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/ScenarioRunner.java:129— experiments/runs/2026-09-20_07-18-54_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/ScenarioRunner.java:129-135 | experiments/runs/2026-09-20_07-22-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/Scenario.java:77-83 | experiments/runs/2026-09-20_07-28-11_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOfficeCli.java:102-108 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (7 lines × 3) experiments/runs/2026-09-20_06-28-51_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLife.java:42— experiments/runs/2026-09-20_06-28-51_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLife.java:42-48 | experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLife.java:47-53 | experiments/runs/2026-09-20_06-35-29_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLife.java:37-43 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at `experiments/runs/2026-09-20_06-35-29_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLife.java:37` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
game-of-life.nextGeneration (cognitive 16) experiments/runs/2026-05-12_23-13-18_game-of-life-cli-user-story_v5-exact-single-context_opus-4-6-portkey-no-thinking/src/game-of-life.ts:4— game-of-life.nextGeneration has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (7 pts), if/else 2 (6 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
game-of-life.nextGeneration (cognitive 16) experiments/runs/2026-05-12_23-17-33_game-of-life-cli-user-story_v5-exact-single-context_opus-4-6-portkey-no-thinking/src/game-of-life.ts:1— game-of-life.nextGeneration has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (7 pts), if/else 2 (6 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
game-of-life.nextGeneration (cognitive 16) experiments/runs/2026-05-12_23-26-22_game-of-life-cli-user-story_v5-exact-single-context_opus-4-6-portkey-no-thinking/src/game-of-life.ts:1— game-of-life.nextGeneration has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (7 pts), if/else 2 (6 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
game-of-life.nextGeneration (cognitive 16) experiments/runs/2026-05-13_05-43-50_game-of-life-cli-user-story_v5-exact-single-context_opus-4-6-portkey-no-thinking/src/game-of-life.ts:1— game-of-life.nextGeneration has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (7 pts), if/else 2 (6 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
FileTooLong: REDACTED REDACTED— FileTooLong — 704 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 204 over it, 1.41× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: experiments/analyze_transcript.py experiments/analyze_transcript.py— FileTooLong — 640 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 140 over it, 1.28× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: experiments/aggregate-by-query.py experiments/aggregate-by-query.py— FileTooLong — 541 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 41 over it, 1.08× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: experiments/generate-snapshot-skeleton.py experiments/generate-snapshot-skeleton.py— FileTooLong — 513 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 13 over it, 1.03× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
D4 · Code Duplication· Edited copy of a member (18 corresponding lines) · ×4
Edited copy of a member (18 corresponding lines) experiments/parse_pi_transcript.py:232— experiments/parse_pi_transcript.py:232-265 | experiments/parse_pi_transcript.py:416-433 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (18 corresponding lines) experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex/src/lib.rs:66— experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex/src/lib.rs:66-83 | experiments/runs/2026-10-01_12-15-39_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/lib.rs:84-104 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (18 corresponding lines) experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex-4/src/lib.rs:75— experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex-4/src/lib.rs:75-92 | experiments/runs/2026-10-01_14-39-03_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/lib.rs:68-85 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (18 corresponding lines) experiments/runs/2026-09-20_06-41-41_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOffice.java:101— experiments/runs/2026-09-20_06-41-41_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOffice.java:101-118 | experiments/runs/2026-09-20_06-41-41_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOffice.java:120-138 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 7+ corresponding lines) · ×4
Edited copies of one member (3 members, 7+ corresponding lines) experiments/runs/2026-09-22_00-22-16_game-of-life-python-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/game_of_life.py:50— experiments/runs/2026-09-22_00-22-16_game-of-life-python-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/game_of_life.py:50-56 | experiments/runs/2026-09-22_00-45-51_game-of-life-python-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/game_of_life.py:49-56 | experiments/runs/2026-09-22_02-31-22_game-of-life-python-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/game_of_life.py:40-46 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 7+ corresponding lines) experiments/runs/2026-09-20_09-40-30_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/MhpcoPriceList.java:74— experiments/runs/2026-09-20_09-40-30_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/MhpcoPriceList.java:74-84 | experiments/runs/2026-09-20_10-40-56_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/PriceList.java:53-59 | experiments/runs/2026-09-20_11-57-09_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/PriceList.java:52-61 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 7+ corresponding lines) experiments/runs/2026-09-20_06-41-39_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOfficeCli.java:98— experiments/runs/2026-09-20_06-41-39_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOfficeCli.java:98-104 | experiments/runs/2026-09-20_07-33-00_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOfficeCli.java:72-78 | experiments/runs/2026-09-20_09-40-30_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/PoliciesByStep.java:31-37 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 7+ corresponding lines) experiments/runs/2026-09-20_06-48-34_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/PriceList.java:40— experiments/runs/2026-09-20_06-48-34_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/PriceList.java:40-46 | experiments/runs/2026-09-20_07-18-54_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/PriceList.java:41-47 | experiments/runs/2026-09-20_07-22-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/PriceList.java:25-31 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
TddEventReporter.onFinished (cyclomatic 16) experiments/runs/2026-10-20_03-17-52_claim-office-user-story_exact-single-context-v1-cc_opus-4-7-no-thinking-2/tdd-reporter.mjs:109— TddEventReporter.onFinished has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
TddEventReporter.onFinished (cyclomatic 16) experiments/runs/2026-10-20_03-17-52_claim-office-user-story_exact-single-context-v1-cc_opus-4-7-no-thinking/tdd-reporter.mjs:109— TddEventReporter.onFinished has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
TddEventReporter.onFinished (cyclomatic 16) experiments/stacks/typescript-vitest/tdd-reporter.mjs:109— TddEventReporter.onFinished has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
game-of-life.nextGeneration (cognitive 21) experiments/runs/2026-05-03_05-19-00_game-of-life-prose_v5-exact-single-context_opus-4-7-no-thinking/src/game-of-life.ts:5— game-of-life.nextGeneration has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (7 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
game-of-life.nextGeneration (cognitive 21) experiments/runs/2026-05-14_23-38-50_game-of-life-prose_v1-oneshot_opus-4-7-no-thinking/src/game-of-life.ts:7— game-of-life.nextGeneration has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 5 (8 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
game-of-life.nextGeneration (cognitive 21) experiments/runs/2026-09-05_14-51-22_game-of-life-prose_v3-basic-tdd-pi_gpt-6-astra-codex-no-thinking/src/game-of-life.ts:7— game-of-life.nextGeneration has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (7 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D4 · Code Duplication· Edited copy of a member (16 corresponding lines) · ×3
Edited copy of a member (16 corresponding lines) experiments/measure-tdd-rigour.py:52— experiments/measure-tdd-rigour.py:52-71 | experiments/measure-tdd-rigour.py:74-89 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (16 corresponding lines) experiments/runs/2026-09-20_08-53-35_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-3/src/main/java/ClaimOffice.java:112— experiments/runs/2026-09-20_08-53-35_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-3/src/main/java/ClaimOffice.java:112-127 | experiments/runs/2026-09-20_08-53-35_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-4/src/main/java/ClaimOfficeCli.java:87-102 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (16 corresponding lines) experiments/runs/2026-10-01_12-21-27_claim-office-rust-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/scenario.rs:63— experiments/runs/2026-10-01_12-21-27_claim-office-rust-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/scenario.rs:63-81 | experiments/runs/2026-10-01_12-27-11_claim-office-rust-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/scenario.rs:37-52 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (14 corresponding lines) · ×3
Edited copy of a member (14 corresponding lines) REDACTED:773— REDACTED:773-786 | REDACTED:790-814 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (14 corresponding lines) experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLifeCli.java:40— experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLifeCli.java:40-59 | experiments/runs/2026-09-20_06-35-29_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLifeCli.java:43-56 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (14 corresponding lines) experiments/runs/2026-10-01_02-34-42_claim-office-rust-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/scenario.rs:140— experiments/runs/2026-10-01_02-34-42_claim-office-rust-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/scenario.rs:140-153 | experiments/runs/2026-10-01_12-21-28_claim-office-rust-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/scenario.rs:100-113 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (11 lines × 2) REDACTED:1161— REDACTED:1161-1171 | REDACTED:1173-1183 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (11 lines × 2) experiments/runs/2026-09-20_06-40-50_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOfficeCli.java:76— experiments/runs/2026-09-20_06-40-50_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOfficeCli.java:76-86 | experiments/runs/2026-09-20_06-41-41_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOffice.java:46-56 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (11 lines × 2) experiments/runs/2026-09-20_07-18-54_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/ScenarioRunner.java:36— experiments/runs/2026-09-20_07-18-54_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/ScenarioRunner.java:36-46 | experiments/runs/2026-09-20_07-28-11_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOfficeCli.java:50-60 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `experiments/runs/2026-09-20_07-18-54_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/ScenarioRunner.java:36` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (10 lines × 2) experiments/parse_pi_transcript.py:255— experiments/parse_pi_transcript.py:255-264 | experiments/parse_pi_transcript.py:424-433 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) experiments/runs/2026-09-20_07-23-29_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOfficeCli.java:57— experiments/runs/2026-09-20_07-23-29_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOfficeCli.java:57-66 | experiments/runs/2026-09-20_09-40-30_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/ClaimOfficeCli.java:97-106 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (10 lines × 2) experiments/runs/2026-09-20_06-35-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOffice.java:248— experiments/runs/2026-09-20_06-35-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOffice.java:248-257 | experiments/runs/2026-09-20_06-35-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOffice.java:209-218 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication· Edited copies of one member (4 members, 10+ corresponding lines) · ×3
Edited copies of one member (4 members, 10+ corresponding lines) experiments/runs/2026-09-20_06-41-39_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOfficeCli.java:87— experiments/runs/2026-09-20_06-41-39_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOfficeCli.java:87-96 | experiments/runs/2026-09-20_06-48-34_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/ScenarioRunner.java:60-71 | experiments/runs/2026-09-20_07-22-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/Scenario.java:63-75 | experiments/runs/2026-09-20_07-28-11_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOfficeCli.java:89-100 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
Edited copies of one member (4 members, 10+ corresponding lines) experiments/runs/2026-09-20_08-53-33_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex/src/main/java/Neighborhood.java:5— experiments/runs/2026-09-20_08-53-33_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex/src/main/java/Neighborhood.java:5-14 | experiments/runs/2026-09-20_08-53-34_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-3/src/main/java/GameOfLife.java:29-39 | experiments/runs/2026-09-20_08-53-34_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex/src/main/java/Neighborhood.java:19-29 | experiments/runs/2026-09-20_09-27-18_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/Cell.java:10-21 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
Edited copies of one member (4 members, 10+ corresponding lines) experiments/runs/2026-09-22_00-20-04_claim-office-python-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/claim_office.py:269— experiments/runs/2026-09-22_00-20-04_claim-office-python-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/claim_office.py:269-279 | experiments/runs/2026-09-22_00-29-36_claim-office-python-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/claim_office.py:234-245 | experiments/runs/2026-09-22_01-57-46_claim-office-python-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/scenario.py:8-17 | experiments/runs/2026-09-22_02-08-36_claim-office-python-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/claim_office.py:250-259 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (5 corresponding lines) · ×3
Edited copy of a member (5 corresponding lines) experiments/runs/2026-09-22_00-17-13_claim-office-python-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/scenario.py:23— experiments/runs/2026-09-22_00-17-13_claim-office-python-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/scenario.py:23-27 | experiments/runs/2026-09-22_01-57-46_claim-office-python-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/scenario.py:29-33 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (5 corresponding lines) experiments/runs/2026-09-20_06-58-08_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLife.java:13— experiments/runs/2026-09-20_06-58-08_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLife.java:13-17 | experiments/runs/2026-09-20_09-27-18_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/GameOfLife.java:30-34 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (5 corresponding lines) experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex-4/src/lib.rs:60— experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex-4/src/lib.rs:60-64 | experiments/runs/2026-10-01_14-39-03_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/lib.rs:31-35 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (6 lines × 3) experiments/runs/2026-09-20_06-39-36_game-of-life-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLifeCli.java:28— experiments/runs/2026-09-20_06-39-36_game-of-life-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLifeCli.java:28-33 | experiments/runs/2026-09-20_06-40-05_game-of-life-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLifeCli.java:35-40 | experiments/runs/2026-09-20_08-53-34_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-2/src/main/java/GameOfLifeCli.java:43-48 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (6 lines × 3) experiments/runs/2026-09-20_06-41-22_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOfficeCli.java:12— experiments/runs/2026-09-20_06-41-22_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOfficeCli.java:12-17 | experiments/runs/2026-09-20_08-53-35_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-3/src/main/java/ClaimOfficeCli.java:9-14 | experiments/runs/2026-09-20_08-53-35_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-4/src/main/java/ClaimOfficeCli.java:24-29 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (6 lines × 3) experiments/runs/2026-10-01_12-12-08_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/lib.rs:132— experiments/runs/2026-10-01_12-12-08_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/lib.rs:132-137 | experiments/runs/2026-10-01_14-35-25_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex/src/lib.rs:107-112 | experiments/runs/2026-10-01_14-39-03_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/lib.rs:90-95 — before extracting anything, compare `experiments/runs/2026-10-01_14-35-25_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex/src/lib.rs` and `experiments/runs/2026-10-01_14-39-03_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/lib.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `experiments/runs/2026-10-01_12-12-08_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/lib.rs:132` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 3) experiments/runs/2026-09-20_06-59-43_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:59— experiments/runs/2026-09-20_06-59-43_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:59-63 | experiments/runs/2026-09-20_09-25-34_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:36-40 | experiments/runs/2026-09-20_09-31-01_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/GenerationJson.java:46-50 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (5 lines × 3) experiments/runs/2026-09-21_21-09-44_game-of-life-python-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/cli.py:10— experiments/runs/2026-09-21_21-09-44_game-of-life-python-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/cli.py:10-14 | experiments/runs/2026-09-21_21-09-45_game-of-life-python-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/cli.py:10-14 | experiments/runs/2026-09-22_06-32-50_game-of-life-python-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/cli.py:10-15 — before extracting anything, compare `experiments/runs/2026-09-21_21-09-44_game-of-life-python-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/cli.py` and `experiments/runs/2026-09-21_21-09-45_game-of-life-python-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/cli.py` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (5 lines × 3) experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex-4/src/lib.rs:75— experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex-4/src/lib.rs:75-79 | experiments/runs/2026-10-01_14-35-25_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex/src/lib.rs:106-110 | experiments/runs/2026-10-01_14-39-03_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/lib.rs:89-93 — before extracting anything, compare `experiments/runs/2026-10-01_14-35-25_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex/src/lib.rs` and `experiments/runs/2026-10-01_14-39-03_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/lib.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex-4/src/lib.rs:75` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind `input` to `Value` in one and `&Value` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Forked directory tree (5 identical files, ~225 lines × 2 trees) experiments/docker/pi-config/README.md:1— experiments/docker/pi-config/ and experiments/docker/pi-config-noreason/ are near-verbatim copies of each other: 5 files are byte-identical under the same relative paths (~225 lines; the trees hold 6 and 6 files). That is one structural fact, not 5 local ones: every edit made to one tree and not the other drifts silently, which is the failure whole-tree forks guarantee. Pick one tree as the single source and produce the other from it (generated, copied at build or release time, or re-exported) — or, if the copy is a stale snapshot nothing produces any more, delete it. Check first whether the copy is a deliberately published deliverable (a template consumers copy verbatim, a released sample frozen at a version); where it is, keep it produced from the source tree rather than edited in place.
Forked directory tree (5 identical files, ~225 lines × 2 trees) experiments/docker/pi-config/README.md:1— experiments/docker/pi-config/ and experiments/docker/pi-config-reasoning/ are near-verbatim copies of each other: 5 files are byte-identical under the same relative paths (~225 lines; the trees hold 6 and 6 files). That is one structural fact, not 5 local ones: every edit made to one tree and not the other drifts silently, which is the failure whole-tree forks guarantee. Pick one tree as the single source and produce the other from it (generated, copied at build or release time, or re-exported) — or, if the copy is a stale snapshot nothing produces any more, delete it. Check first whether the copy is a deliberately published deliverable (a template consumers copy verbatim, a released sample frozen at a version); where it is, keep it produced from the source tree rather than edited in place.
Forked directory tree (5 identical files, ~225 lines × 2 trees) experiments/docker/pi-config-noreason/README.md:1— experiments/docker/pi-config-noreason/ and experiments/docker/pi-config-reasoning/ are near-verbatim copies of each other: 5 files are byte-identical under the same relative paths (~225 lines; the trees hold 6 and 6 files). That is one structural fact, not 5 local ones: every edit made to one tree and not the other drifts silently, which is the failure whole-tree forks guarantee. Pick one tree as the single source and produce the other from it (generated, copied at build or release time, or re-exported) — or, if the copy is a stale snapshot nothing produces any more, delete it. Check first whether the copy is a deliberately published deliverable (a template consumers copy verbatim, a released sample frozen at a version); where it is, keep it produced from the source tree rather than edited in place.
game-of-life.nextGeneration (cognitive 18) experiments/runs/2026-05-03_05-45-04_game-of-life-prose_v3-basic-tdd_sonnet-4-6/src/game-of-life.ts:3— game-of-life.nextGeneration has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (7 pts), if/else 2 (6 pts), boolean chains 5 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
game-of-life.nextGeneration (cognitive 18) experiments/runs/2026-05-13_05-58-56_game-of-life-cli-prose_v5-exact-single-context_opus-4-6-portkey-no-thinking/src/game-of-life.ts:13— game-of-life.nextGeneration has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (7 pts), if/else 2 (6 pts), boolean chains 5 (nesting depth added 7). Of this number, 17 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
adapter.loadEvolve (cognitive 17) experiments/katas/game-of-life-cli-verification/adapter.ts:8— adapter.loadEvolve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
adapter.loadEvolve (cognitive 17) experiments/katas/game-of-life-verification/adapter.ts:8— adapter.loadEvolve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Duplicated block (8–9 lines × 2) experiments/batch-plan-from-rq.py:237— experiments/batch-plan-from-rq.py:237-244 | REDACTED:1089-1097 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1089` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `experiments/batch-plan-from-rq.py:235` calls `add_argument`, `parse_args` and `REDACTED:1089` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (8–9 lines × 2) experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-3/src/main/java/GameOfLife.java:19— experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-3/src/main/java/GameOfLife.java:19-27 | experiments/runs/2026-09-20_06-35-29_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLife.java:16-23 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-3/src/main/java/GameOfLife.java:19` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `experiments/runs/2026-09-20_06-35-29_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLife.java:12` calls `contains`, `NullPointerException` and `experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-3/src/main/java/GameOfLife.java:18` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication· Members sharing a duplicated core (10 members, 50+ identical tokens) · ×2
Members sharing a duplicated core (10 members, 50+ identical tokens) experiments/runs/2026-09-20_06-53-35_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/gameoflife/Cell.java:8— experiments/runs/2026-09-20_06-53-35_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/gameoflife/Cell.java:8-18 | experiments/runs/2026-09-20_06-55-04_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/gameoflife/Cell.java:8-18 | experiments/runs/2026-09-20_06-56-38_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/gol/Cell.java:8-18 | experiments/runs/2026-09-20_06-59-43_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/Cell.java:6-16 | experiments/runs/2026-09-20_07-01-23_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/Cell.java:6-16 | experiments/runs/2026-09-20_07-04-55_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/Cell.java:6-16 | experiments/runs/2026-09-20_09-25-34_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/Cell.java:6-16 | experiments/runs/2026-09-20_09-31-01_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/gameoflife/Cell.java:8-18 | experiments/runs/2026-09-20_09-37-48_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/Cell.java:6-16 | experiments/runs/2026-09-20_09-38-26_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/gameoflife/Cell.java:8-18 — These 10 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 10 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 10 times.
Members sharing a duplicated core (10 members, 50+ identical tokens) experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex-3/src/lib.rs:54— experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex-3/src/lib.rs:54-63 | experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex-4/src/lib.rs:8-17 | experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex-4/src/lib.rs:5-14 | experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex/src/lib.rs:8-17 | experiments/runs/2026-10-01_12-12-08_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/lib.rs:23-32 | experiments/runs/2026-10-01_12-15-39_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/lib.rs:7-16 | experiments/runs/2026-10-01_12-16-10_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/domain.rs:53-62 | experiments/runs/2026-10-01_14-35-25_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex/src/lib.rs:53-62 | experiments/runs/2026-10-01_14-35-25_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex/src/lib.rs:3-12 | experiments/runs/2026-10-01_14-39-03_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/lib.rs:3-12 — These 10 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 10 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 10 times.
D4 · Code Duplication· Members sharing a duplicated core (4 members, 50+ identical tokens) · ×2
Members sharing a duplicated core (4 members, 50+ identical tokens) experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/GameOfLife.java:17— experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/GameOfLife.java:17-35 | experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-3/src/main/java/GameOfLife.java:16-33 | experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLife.java:17-43 | experiments/runs/2026-09-20_06-35-29_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLife.java:9-29 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/GameOfLife.java:37— experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/GameOfLife.java:37-46 | experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-3/src/main/java/GameOfLife.java:35-44 | experiments/runs/2026-09-20_06-39-36_game-of-life-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/GameOfLife.java:21-34 | experiments/runs/2026-09-20_08-53-34_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-2/src/main/java/GameOfLife.java:20-29 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
D4 · Code Duplication· Edited copies of one member (4 members, 9+ corresponding lines) · ×2
Edited copies of one member (4 members, 9+ corresponding lines) experiments/runs/2026-09-20_06-53-35_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:40— experiments/runs/2026-09-20_06-53-35_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:40-51 | experiments/runs/2026-09-20_06-55-04_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:41-51 | experiments/runs/2026-09-20_06-56-38_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:45-53 | experiments/runs/2026-09-20_06-59-41_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:36-44 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
Edited copies of one member (4 members, 9+ corresponding lines) experiments/runs/2026-09-20_06-41-22_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/PremiumCalculator.java:41— experiments/runs/2026-09-20_06-41-22_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/PremiumCalculator.java:41-49 | experiments/runs/2026-09-20_06-41-29_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOfficeCli.java:172-180 | experiments/runs/2026-09-20_06-41-41_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOffice.java:91-99 | experiments/runs/2026-09-20_08-53-35_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex/src/main/java/QuotePricing.java:41-49 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 9+ corresponding lines) · ×2
Edited copies of one member (3 members, 9+ corresponding lines) experiments/runs/2026-09-21_21-13-15_claim-office-python-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/claim_office.py:41— experiments/runs/2026-09-21_21-13-15_claim-office-python-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/claim_office.py:41-51 | experiments/runs/2026-09-21_21-13-27_claim-office-python-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/claim_office.py:188-196 | experiments/runs/2026-09-21_21-14-30_claim-office-python-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/claim_office.py:33-43 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 9+ corresponding lines) experiments/runs/2026-09-20_06-59-43_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLife.java:6— experiments/runs/2026-09-20_06-59-43_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLife.java:6-14 | experiments/runs/2026-09-20_09-25-34_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/GameOfLife.java:14-22 | experiments/runs/2026-09-20_09-31-01_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/gameoflife/GameOfLife.java:16-24 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 11+ corresponding lines) · ×2
Edited copies of one member (3 members, 11+ corresponding lines) experiments/runs/2026-09-20_06-59-55_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOfficeCli.java:30— experiments/runs/2026-09-20_06-59-55_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOfficeCli.java:30-40 | experiments/runs/2026-09-20_09-40-30_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/ClaimOfficeCli.java:36-49 | experiments/runs/2026-09-20_10-13-24_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/ClaimOfficeCli.java:69-80 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 11+ corresponding lines) experiments/runs/2026-09-20_07-28-04_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOffice.java:132— experiments/runs/2026-09-20_07-28-04_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOffice.java:132-142 | experiments/runs/2026-09-20_09-40-30_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/ItemRiskRating.java:28-39 | experiments/runs/2026-10-19_06-18-28_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/PremiumPolicy.java:64-74 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 11+ corresponding lines) · ×2
Edited copies of one member (4 members, 11+ corresponding lines) experiments/runs/2026-09-20_06-35-28_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOfficeCli.java:8— experiments/runs/2026-09-20_06-35-28_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOfficeCli.java:8-21 | experiments/runs/2026-09-20_06-35-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOfficeCli.java:9-20 | experiments/runs/2026-09-20_06-35-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOfficeCli.java:9-20 | experiments/runs/2026-09-20_06-35-30_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOfficeCli.java:9-19 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
Edited copies of one member (4 members, 11+ corresponding lines) experiments/runs/2026-09-20_07-18-13_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/Quote.java:41— experiments/runs/2026-09-20_07-18-13_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/Quote.java:41-53 | experiments/runs/2026-09-20_07-18-54_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/PremiumCalculator.java:50-60 | experiments/runs/2026-09-20_07-22-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/Premium.java:63-75 | experiments/runs/2026-09-20_07-28-11_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/Quote.java:33-45 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 6+ corresponding lines) · ×2
Edited copies of one member (3 members, 6+ corresponding lines) experiments/runs/2026-09-21_16-30-49_game-of-life-python-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/cli.py:16— experiments/runs/2026-09-21_16-30-49_game-of-life-python-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/cli.py:16-22 | experiments/runs/2026-09-21_21-18-06_game-of-life-python-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/cli.py:14-21 | experiments/runs/2026-09-21_21-20-12_game-of-life-python-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/cli.py:14-19 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 6+ corresponding lines) experiments/runs/2026-09-22_00-05-32_claim-office-python-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/claim_office.py:185— experiments/runs/2026-09-22_00-05-32_claim-office-python-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/claim_office.py:185-191 | experiments/runs/2026-09-22_00-17-13_claim-office-python-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/premium.py:59-64 | experiments/runs/2026-09-22_05-55-30_claim-office-python-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/claim_office.py:104-114 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 10+ corresponding lines) · ×2
Edited copies of one member (3 members, 10+ corresponding lines) experiments/runs/2026-09-20_06-58-06_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GenerationJson.java:36— experiments/runs/2026-09-20_06-58-06_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GenerationJson.java:36-45 | experiments/runs/2026-09-20_09-31-01_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/GenerationJson.java:35-44 | experiments/runs/2026-09-20_09-37-48_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:54-63 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 10+ corresponding lines) experiments/runs/2026-09-20_06-35-28_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOfficeCli.java:290— experiments/runs/2026-09-20_06-35-28_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOfficeCli.java:290-299 | experiments/runs/2026-09-20_06-35-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOffice.java:259-268 | experiments/runs/2026-09-20_06-35-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOffice.java:187-196 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 4+ corresponding lines) · ×2
Edited copies of one member (3 members, 4+ corresponding lines) experiments/runs/2026-09-21_21-18-56_game-of-life-python-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/cli.py:19— experiments/runs/2026-09-21_21-18-56_game-of-life-python-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/cli.py:19-22 | experiments/runs/2026-09-21_22-06-47_game-of-life-python-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex/src/cli.py:18-21 | experiments/runs/2026-09-21_22-45-20_game-of-life-python-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex/src/cli.py:19-22 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 4+ corresponding lines) experiments/runs/2026-09-20_06-55-04_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/gameoflife/GameOfLife.java:20— experiments/runs/2026-09-20_06-55-04_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/gameoflife/GameOfLife.java:20-23 | experiments/runs/2026-09-20_06-56-38_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/gol/GameOfLife.java:24-27 | experiments/runs/2026-09-20_06-59-41_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/gameoflife/GameOfLife.java:31-34 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (3 corresponding lines) · ×2
Edited copy of a member (3 corresponding lines) experiments/runs/2026-09-22_02-01-49_game-of-life-python-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/cli.py:16— experiments/runs/2026-09-22_02-01-49_game-of-life-python-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/cli.py:16-18 | experiments/runs/2026-09-22_05-52-07_game-of-life-python-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/cli.py:8-10 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (3 corresponding lines) experiments/runs/2026-09-22_00-05-52_game-of-life-python-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/game_of_life.py:48— experiments/runs/2026-09-22_00-05-52_game-of-life-python-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/game_of_life.py:48-54 | experiments/runs/2026-09-22_02-31-22_game-of-life-python-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/game_of_life.py:13-15 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (12 lines × 2) experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/GameOfLife.java:24— experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/GameOfLife.java:24-35 | experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-3/src/main/java/GameOfLife.java:22-33 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/GameOfLife.java:24` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/GameOfLife.java:23` calls `requireNonNull` and `experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-3/src/main/java/GameOfLife.java:21` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (12 lines × 2) experiments/runs/2026-10-01_12-17-52_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/lib.rs:187— experiments/runs/2026-10-01_12-17-52_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/lib.rs:187-198 | experiments/runs/2026-10-01_12-43-48_claim-office-rust-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/lib.rs:380-391 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `experiments/runs/2026-10-01_12-43-48_claim-office-rust-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/lib.rs:380` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Unfinished stub — throws a "not implemented" error experiments/runs/2026-05-12_23-56-27_game-of-life-cli-user-story_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/game.ts:1— A shipped function's whole body still throws a "not implemented" error — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — throws a "not implemented" error experiments/runs/2026-05-13_06-12-21_game-of-life-cli-user-story_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/game-of-life.ts:5— A shipped function's whole body still throws a "not implemented" error — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — throws a "not implemented" exception experiments/runs/2026-05-12_23-56-27_game-of-life-cli-user-story_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/game.ts:1— `advanceGeneration` throws an exception whose message says it isn't finished — a not-implemented stub wearing an ordinary exception. Implement it or remove it.
Unfinished stub — throws a "not implemented" exception experiments/runs/2026-05-13_06-12-21_game-of-life-cli-user-story_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/game-of-life.ts:5— `step` throws an exception whose message says it isn't finished — a not-implemented stub wearing an ordinary exception. Implement it or remove it.
R10 · Code Duplication· Duplicated block with local edits (86 matched lines × 2 locations) · ×2
Duplicated block with local edits (86 matched lines × 2 locations) experiments/runs/2026-05-21_10-49-45_claim-office-example-mapping_v3-basic-tdd_opus-4-6-portkey-no-thinking-2/src/claim-office.ts:18— experiments/runs/2026-05-21_10-49-45_claim-office-example-mapping_v3-basic-tdd_opus-4-6-portkey-no-thinking-2/src/claim-office.ts:18 · experiments/runs/2026-05-21_10-56-34_claim-office-example-mapping_v3-basic-tdd_opus-4-6-portkey-no-thinking/src/claim-office.ts:25 — the two spans are one implementation copied and then locally edited — 379 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block with local edits (86 matched lines × 2 locations) experiments/runs/2026-07-26_00-13-47_claim-office-example-mapping_v4-exact-subagents_opus-5-no-thinking-2/src/claim-office.ts:4— experiments/runs/2026-07-26_00-13-47_claim-office-example-mapping_v4-exact-subagents_opus-5-no-thinking-2/src/claim-office.ts:4 · experiments/runs/2026-08-10_18-13-18_claim-office-example-mapping_v6.6-lab-split-cc_opus-5-no-thinking/src/claim-office.ts:8 — the two spans are one implementation copied and then locally edited — 462 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (70 matched lines × 2 locations) · ×2
Duplicated block with local edits (70 matched lines × 2 locations) experiments/runs/2026-05-08_15-43-45_claim-office-example-mapping_v5-exact-single-context_opus-4-7-no-thinking/src/claim-office.ts:63— experiments/runs/2026-05-08_15-43-45_claim-office-example-mapping_v5-exact-single-context_opus-4-7-no-thinking/src/claim-office.ts:63 · experiments/runs/2026-05-08_16-04-50_claim-office-example-mapping_v5-exact-single-context_opus-4-7-no-thinking/src/claim-office.ts:104 — the two spans are one implementation copied and then locally edited — 488 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block with local edits (70 matched lines × 2 locations) experiments/runs/2026-08-05_02-03-30_claim-office-example-mapping_v6.2.1-phase-continuation-pi_opus-5-requesty-3/src/claim-office.ts:87— experiments/runs/2026-08-05_02-03-30_claim-office-example-mapping_v6.2.1-phase-continuation-pi_opus-5-requesty-3/src/claim-office.ts:87 · experiments/runs/2026-09-04_06-20-44_claim-office-example-mapping_v6.1.1-lab-split-cc_opus-5-no-thinking/src/claim-office.ts:97 — the two spans are one implementation copied and then locally edited — 582 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (56 matched lines × 2 locations) · ×2
Duplicated block with local edits (56 matched lines × 2 locations) experiments/runs/2026-07-24_15-24-24_claim-office-example-mapping_v6.2-with-why-cleaned-pi_opus-4-8-3/src/claim-office.ts:20— experiments/runs/2026-07-24_15-24-24_claim-office-example-mapping_v6.2-with-why-cleaned-pi_opus-4-8-3/src/claim-office.ts:20 · experiments/runs/2026-08-17_07-16-10_claim-office-example-mapping_v6.2-with-why-cleaned_opus-5-no-thinking/src/claim-office.ts:89 — the two spans are one implementation copied and then locally edited — 472 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block with local edits (56 matched lines × 2 locations) experiments/runs/2026-08-10_07-58-09_claim-office-example-mapping_v5.1-testlist-scope-fix-pi_gpt-5-6-sol/src/claim-office.ts:38— experiments/runs/2026-08-10_07-58-09_claim-office-example-mapping_v5.1-testlist-scope-fix-pi_gpt-5-6-sol/src/claim-office.ts:38 · experiments/runs/2026-08-10_08-17-05_claim-office-example-mapping_v5.1-testlist-scope-fix-pi_gpt-5-6-sol/src/claim-office.ts:28 — the two spans are one implementation copied and then locally edited — 481 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (46 matched lines × 2 locations) · ×2
Duplicated block with local edits (46 matched lines × 2 locations) experiments/runs/2026-08-10_09-47-13_claim-office-example-mapping_v3-basic-tdd-pi_gpt-5-6-sol/src/claim-office.ts:36— experiments/runs/2026-08-10_09-47-13_claim-office-example-mapping_v3-basic-tdd-pi_gpt-5-6-sol/src/claim-office.ts:36 · experiments/runs/2026-08-16_21-17-00_claim-office-example-mapping_v3-basic-tdd-pi_gpt-5-6-sol-codex-2/src/claim-office.ts:38 — the two spans are one implementation copied and then locally edited — 475 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block with local edits (46 matched lines × 2 locations) experiments/runs/2026-09-04_06-20-44_claim-office-example-mapping_v6.1.1-lab-split-cc_opus-5-no-thinking-2/src/claim-office.ts:51— experiments/runs/2026-09-04_06-20-44_claim-office-example-mapping_v6.1.1-lab-split-cc_opus-5-no-thinking-2/src/claim-office.ts:51 · experiments/runs/2026-09-04_06-20-44_claim-office-example-mapping_v6.1.1-lab-split-cc_opus-5-no-thinking-3/src/claim-office.ts:43 — the two spans are one implementation copied and then locally edited — 274 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (45 matched lines × 2 locations) · ×2
Duplicated block with local edits (45 matched lines × 2 locations) experiments/runs/2026-05-24_23-18-18_claim-office-example-mapping_v6.2-with-why-cleaned_opus-4-7-portkey-no-thinking/src/claim-office.ts:12— experiments/runs/2026-05-24_23-18-18_claim-office-example-mapping_v6.2-with-why-cleaned_opus-4-7-portkey-no-thinking/src/claim-office.ts:12 · experiments/runs/2026-05-26_20-41-14_claim-office-example-mapping_v6.2-with-why-cleaned-pi_opus-4-7-portkey-no-thinking-3/src/claim-office.ts:11 — the two spans are one implementation copied and then locally edited — 198 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block with local edits (45 matched lines × 2 locations) experiments/runs/2026-07-25_19-51-19_claim-office-example-mapping_v6.2-with-why-cleaned-oc_opus-4-8-requesty/src/cli.ts:26— experiments/runs/2026-07-25_19-51-19_claim-office-example-mapping_v6.2-with-why-cleaned-oc_opus-4-8-requesty/src/cli.ts:26 · experiments/runs/2026-07-27_15-46-00_claim-office-example-mapping_v6.6-lab-split-oc_opus-4-8-requesty-no-thinking/src/cli.ts:27 — the two spans are one implementation copied and then locally edited — 336 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (44 lines × 2 locations) experiments/runs/2026-05-08_16-04-50_claim-office-example-mapping_v5-exact-single-context_opus-4-7-no-thinking/src/claim-office.ts:1— experiments/runs/2026-05-08_16-04-50_claim-office-example-mapping_v5-exact-single-context_opus-4-7-no-thinking/src/claim-office.ts:1 · experiments/runs/2026-08-10_16-14-18_claim-office-example-mapping_v5.1-testlist-scope-fix_opus-5-no-thinking/src/claim-office.ts:1 — the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct — the members of a type, or the entries of an object or array literal — with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal's entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or — where the copies are a literal's entries rather than a type's members — one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared — a decorator and its options, an annotation, a registration table's keys — the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases.
Duplicated block (44 lines × 2 locations) experiments/runs/2026-05-26_11-19-00_claim-office-example-mapping_v6.2-with-why-cleaned-oc_opus-4-7-portkey-no-thinking/src/claim-office.ts:1— experiments/runs/2026-05-26_11-19-00_claim-office-example-mapping_v6.2-with-why-cleaned-oc_opus-4-7-portkey-no-thinking/src/claim-office.ts:1 · experiments/runs/2026-05-27_03-39-46_claim-office-example-mapping_v6.4-metric-driven-refactor_opus-4-7-no-thinking/src/claim-office.ts:1 — the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct — the members of a type, or the entries of an object or array literal — with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal's entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or — where the copies are a literal's entries rather than a type's members — one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared — a decorator and its options, an annotation, a registration table's keys — the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases.
Complex function visit (cyclomatic 19, cognitive 55) experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/src/async.js:55— visit has cyclomatic complexity 19 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function visit (cyclomatic 19, cognitive 55) experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/src/sync.js:55— visit has cyclomatic complexity 19 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
AC3 · Page structure· Data table has no header cells · ×1
Data table has no header cells site/src/ResultTable.tsx:155— A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
parse_pi_transcript.main (cyclomatic 68) experiments/parse_pi_transcript.py:436— parse_pi_transcript.main has cyclomatic complexity 68 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
analyze_transcript.aggregate_main_session (cyclomatic 51) experiments/analyze_transcript.py:220— analyze_transcript.aggregate_main_session has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
export-sol.validate (cyclomatic 44) .claude/skills/exact-coding-baseline-export/export-sol.py:730— export-sol.validate has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
countComponents::visit (cyclomatic 39) experiments/workflows/exact-coding/sol/exact-sol-v1.2.3-measured-tool-pi/.pi/tools/app-mass.mjs:67— countComponents::visit has cyclomatic complexity 39 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
tdd-report.classify (cyclomatic 32) experiments/tdd-report.py:98— tdd-report.classify has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
analyze_transcript.aggregate_subagent_phases (cyclomatic 31) experiments/analyze_transcript.py:700— analyze_transcript.aggregate_subagent_phases has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
compute-mutation-score.main (cyclomatic 31) REDACTED:1059— compute-mutation-score.main has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
workflow-lineage.check (cyclomatic 30) experiments/workflow-lineage.py:74— workflow-lineage.check has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
parse_cursor_transcript.main (cyclomatic 26) experiments/parse_cursor_transcript.py:236— parse_cursor_transcript.main has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
REDACTED.ResultTable (cyclomatic 23) REDACTED:168— REDACTED.ResultTable has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 1 of the 23 points is its own statement and the rest belongs to 9 function literals inside it that branch (lines 196, 184, 175, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
REDACTED.ResultTable (cyclomatic 23) REDACTED:168— REDACTED.ResultTable has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 1 of the 23 points is its own statement and the rest belongs to 9 function literals inside it that branch (lines 196, 184, 175, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
analyze_transcript.main (cyclomatic 23) experiments/analyze_transcript.py:864— analyze_transcript.main has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
measure-tdd-rigour.seq_cc (cyclomatic 23) experiments/measure-tdd-rigour.py:51— measure-tdd-rigour.seq_cc has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
tdd-report.metrics (cyclomatic 22) experiments/tdd-report.py:370— tdd-report.metrics has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
check-pi-model-wiring.main (cyclomatic 21) experiments/check-pi-model-wiring.py:135— check-pi-model-wiring.main has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
measure-suite-transitions.main (cyclomatic 21) experiments/measure-suite-transitions.py:266— measure-suite-transitions.main has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
export-sol.sync_distribution (cyclomatic 20) .claude/skills/exact-coding-baseline-export/export-sol.py:1029— export-sol.sync_distribution has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
extract.aggregate (cyclomatic 20) site/prototype/extract.py:127— extract.aggregate has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
measure-tdd-rigour.seq_pi (cyclomatic 19) experiments/measure-tdd-rigour.py:73— measure-tdd-rigour.seq_pi has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
measure-tdd-rigour.count_tcr_refactor_steps (cyclomatic 19) experiments/measure-tdd-rigour.py:91— measure-tdd-rigour.count_tcr_refactor_steps has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
parse_pi_transcript._subagent_phase_text_of (cyclomatic 19) experiments/parse_pi_transcript.py:375— parse_pi_transcript._subagent_phase_text_of has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
export-sol.main (cyclomatic 19) .claude/skills/exact-coding-baseline-export/export-sol.py:1121— export-sol.main has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
analyze_transcript.infer_phases_from_tool_sequence (cyclomatic 18) experiments/analyze_transcript.py:448— analyze_transcript.infer_phases_from_tool_sequence has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
compute-cost.iter_target_runs (cyclomatic 17) experiments/compute-cost.py:349— compute-cost.iter_target_runs has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
measure-suite-transitions.measure (cyclomatic 17) experiments/measure-suite-transitions.py:210— measure-suite-transitions.measure has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
measure-tdd-rigour.main (cyclomatic 17) experiments/measure-tdd-rigour.py:144— measure-tdd-rigour.main has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
parse_opencode_transcript.main (cyclomatic 17) experiments/parse_opencode_transcript.py:159— parse_opencode_transcript.main has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
rust_tdd._skip_literal (cyclomatic 17) REDACTED:110— rust_tdd._skip_literal has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
tdd-report.render (cyclomatic 17) experiments/tdd-report.py:482— tdd-report.render has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
extract.trophies (cyclomatic 17) site/prototype/extract.py:168— extract.trophies has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
measure-suite-transitions.suite_results_pi (cyclomatic 16) experiments/measure-suite-transitions.py:177— measure-suite-transitions.suite_results_pi has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
measure-tdd-rigour.analyse (cyclomatic 16) experiments/measure-tdd-rigour.py:114— measure-tdd-rigour.analyse has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
parse_pi_transcript._collect_tool_calls (cyclomatic 16) experiments/parse_pi_transcript.py:139— parse_pi_transcript._collect_tool_calls has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
parse_pi_transcript.main (cognitive 135) experiments/parse_pi_transcript.py:436— parse_pi_transcript.main has cognitive complexity 135 (threshold 15). Drivers by points: if/else 31 (85 pts), loops 11 (27 pts), boolean chains 21, error handling 1 (2 pts) (nesting depth added 71). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
analyze_transcript.aggregate_main_session (cognitive 111) experiments/analyze_transcript.py:220— analyze_transcript.aggregate_main_session has cognitive complexity 111 (threshold 15). Drivers by points: if/else 26 (85 pts), boolean chains 17, ternaries 2 (6 pts), loops 2 (3 pts) (nesting depth added 64). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
export-sol.validate (cognitive 95) .claude/skills/exact-coding-baseline-export/export-sol.py:730— export-sol.validate has cognitive complexity 95 (threshold 15). Drivers by points: if/else 28 (69 pts), loops 10 (19 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
analyze_transcript.aggregate_subagent_phases (cognitive 68) experiments/analyze_transcript.py:700— analyze_transcript.aggregate_subagent_phases has cognitive complexity 68 (threshold 15). Drivers by points: if/else 13 (39 pts), loops 5 (13 pts), boolean chains 9, ternaries 2 (4 pts), error handling 1 (3 pts) (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
compute-mutation-score.main (cognitive 57) REDACTED:1059— compute-mutation-score.main has cognitive complexity 57 (threshold 15). Drivers by points: if/else 26 (47 pts), loops 3 (4 pts), boolean chains 3, error handling 1 (2 pts), ternaries 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
parse_cursor_transcript.main (cognitive 47) experiments/parse_cursor_transcript.py:236— parse_cursor_transcript.main has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (34 pts), boolean chains 7, loops 2 (4 pts), error handling 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
workflow-lineage.check (cognitive 46) experiments/workflow-lineage.py:74— workflow-lineage.check has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (32 pts), boolean chains 9, loops 4 (5 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tdd-report.classify (cognitive 44) experiments/tdd-report.py:98— tdd-report.classify has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (30 pts), boolean chains 9, ternaries 2 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
claim-office.processScenario (cognitive 42) experiments/runs/2026-05-12_01-37-57_claim-office-user-story_v5-exact-single-context_opus-4-6-portkey-no-thinking/src/claim-office.ts:24— claim-office.processScenario has cognitive complexity 42 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 5 (13 pts), ternaries 2 (8 pts), boolean chains 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
measure-tdd-rigour.seq_cc (cognitive 39) experiments/measure-tdd-rigour.py:51— measure-tdd-rigour.seq_cc has cognitive complexity 39 (threshold 15). Drivers by points: if/else 7 (24 pts), boolean chains 10, loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
extract.aggregate (cognitive 39) site/prototype/extract.py:127— extract.aggregate has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (21 pts), ternaries 5 (13 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
check-pi-model-wiring.main (cognitive 37) experiments/check-pi-model-wiring.py:135— check-pi-model-wiring.main has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 6 (12 pts), ternaries 1 (4 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
analyze_transcript.infer_phases_from_tool_sequence (cognitive 33) experiments/analyze_transcript.py:448— analyze_transcript.infer_phases_from_tool_sequence has cognitive complexity 33 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 3 (9 pts), loops 3 (7 pts), boolean chains 6 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
measure-suite-transitions.main (cognitive 32) experiments/measure-suite-transitions.py:266— measure-suite-transitions.main has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (19 pts), error handling 2 (6 pts), boolean chains 4, ternaries 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
export-sol.sync_distribution (cognitive 32) .claude/skills/exact-coding-baseline-export/export-sol.py:1029— export-sol.sync_distribution has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (20 pts), loops 6 (9 pts), ternaries 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
parse_pi_transcript._subagent_phase_text_of (cognitive 31) experiments/parse_pi_transcript.py:375— parse_pi_transcript._subagent_phase_text_of has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 7, loops 3 (7 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
compute-cost.iter_target_runs (cognitive 30) experiments/compute-cost.py:349— compute-cost.iter_target_runs has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 5, loops 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
extract.trophies (cognitive 30) site/prototype/extract.py:168— extract.trophies has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (8 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
measure-tdd-rigour.count_tcr_refactor_steps (cognitive 29) experiments/measure-tdd-rigour.py:91— measure-tdd-rigour.count_tcr_refactor_steps has cognitive complexity 29 (threshold 15). Drivers by points: if/else 4 (13 pts), boolean chains 8, loops 2 (4 pts), error handling 2 (3 pts), ternaries 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
claim-office.processScenario (cognitive 28) experiments/runs/2026-05-12_07-22-03_claim-office-prose_v5-exact-single-context_opus-4-6-portkey/src/claim-office.ts:67— claim-office.processScenario has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 3 (13 pts), if/else 4 (8 pts), loops 3 (7 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
REDACTED.ResultTable (cognitive 28) REDACTED:168— REDACTED.ResultTable has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 11 (17 pts), if/else 7, boolean chains 4 (nesting depth added 6). None of this is in the body itself: all 28 points belong to 9 function literals inside it that branch (lines 184, 196, 175, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
REDACTED.ResultTable (cognitive 28) REDACTED:168— REDACTED.ResultTable has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 11 (17 pts), if/else 7, boolean chains 4 (nesting depth added 6). None of this is in the body itself: all 28 points belong to 9 function literals inside it that branch (lines 184, 196, 175, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
measure-tdd-rigour.seq_pi (cognitive 27) experiments/measure-tdd-rigour.py:73— measure-tdd-rigour.seq_pi has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 8, error handling 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
measure-suite-transitions._suite_results_one_cc_file (cognitive 26) experiments/measure-suite-transitions.py:120— measure-suite-transitions._suite_results_one_cc_file has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (16 pts), boolean chains 5, loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
measure-suite-transitions.suite_results_pi (cognitive 26) experiments/measure-suite-transitions.py:177— measure-suite-transitions.suite_results_pi has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (12 pts), boolean chains 6, ternaries 1 (4 pts), error handling 1 (2 pts), loops 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
parse_cursor_transcript._infer_cycles_from_tool_events (cognitive 25) experiments/parse_cursor_transcript.py:192— parse_cursor_transcript._infer_cycles_from_tool_events has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (7 pts), boolean chains 4 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
parse_opencode_transcript._walk_parts (cognitive 25) experiments/parse_opencode_transcript.py:115— parse_opencode_transcript._walk_parts has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (17 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
parse_pi_transcript._sum_main_usage (cognitive 25) experiments/parse_pi_transcript.py:185— parse_pi_transcript._sum_main_usage has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 6, loops 3 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
parse_pi_transcript._subagent_usage_totals (cognitive 24) experiments/parse_pi_transcript.py:231— parse_pi_transcript._subagent_usage_totals has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 6, loops 3 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
game-of-life.nextGeneration (cognitive 23) experiments/runs/2026-05-14_21-29-54_game-of-life-prose_v1-oneshot_opus-4-7-no-thinking/src/game-of-life.ts:7— game-of-life.nextGeneration has cognitive complexity 23 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 5 (8 pts), boolean chains 5 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
parse_pi_transcript._collect_tool_calls (cognitive 23) experiments/parse_pi_transcript.py:139— parse_pi_transcript._collect_tool_calls has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 8, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
measure-tdd-rigour.analyse (cognitive 22) experiments/measure-tdd-rigour.py:114— measure-tdd-rigour.analyse has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (4 pts), ternaries 2, boolean chains 1, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rust_tdd._skip_literal (cognitive 22) REDACTED:110— rust_tdd._skip_literal has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, ternaries 2 (4 pts), loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tdd-report.metrics (cognitive 22) experiments/tdd-report.py:370— tdd-report.metrics has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 12, if/else 8, boolean chains 1, loops 1. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
tdd-report.render (cognitive 22) experiments/tdd-report.py:482— tdd-report.render has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 4 (6 pts), loops 5, boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
export-sol.main (cognitive 22) .claude/skills/exact-coding-baseline-export/export-sol.py:1121— export-sol.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 6, error handling 1 (2 pts), loops 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
analyze_transcript.main (cognitive 21) experiments/analyze_transcript.py:864— analyze_transcript.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 7, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
measure-tdd-rigour.main (cognitive 21) experiments/measure-tdd-rigour.py:144— measure-tdd-rigour.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, error handling 1 (2 pts), ternaries 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
parse_pi_transcript._inline_tool_events (cognitive 21) experiments/parse_pi_transcript.py:321— parse_pi_transcript._inline_tool_events has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 5, ternaries 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
extract.detail (cognitive 21) site/prototype/extract.py:196— extract.detail has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (8 pts), boolean chains 4 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
claim-office.processScenario (cognitive 20) experiments/runs/2026-05-12_01-37-28_claim-office-user-story_v5-exact-single-context_opus-4-6-portkey/src/claim-office.ts:107— claim-office.processScenario has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
game-of-life.nextGeneration (cognitive 20) experiments/runs/2026-05-14_21-27-32_game-of-life-prose_v1-oneshot_opus-4-7-no-thinking/src/game-of-life.ts:12— game-of-life.nextGeneration has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (9 pts), if/else 3 (8 pts), boolean chains 3 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
batch-plan-from-rq.count_runs_per_cell (cognitive 20) experiments/batch-plan-from-rq.py:35— batch-plan-from-rq.count_runs_per_cell has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (4 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
parse_cursor_transcript._classify_tool_event (cognitive 20) experiments/parse_cursor_transcript.py:161— parse_cursor_transcript._classify_tool_event has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 5 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
claim-office.processScenario (cognitive 19) experiments/runs/2026-05-12_04-33-35_claim-office-prose_v5-exact-single-context_sonnet-4-6-portkey/src/claim-office.ts:26— claim-office.processScenario has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), ternaries 2 (6 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
game-of-life.step (cognitive 19) experiments/runs/2026-05-12_23-26-53_game-of-life-cli-user-story_v5-exact-single-context_sonnet-4-6-portkey-no-thinking/src/game-of-life.ts:1— game-of-life.step has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (7 pts), boolean chains 3, ternaries 1 (nesting depth added 7). Of this number, 18 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
game-of-life.tick (cognitive 19) experiments/runs/2026-05-13_06-08-05_game-of-life-cli-user-story_v5-exact-single-context_opus-4-6-portkey-no-thinking/src/game-of-life.ts:16— game-of-life.tick has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 10). Of this number, 18 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gameOfLife.step (cognitive 18) experiments/runs/2026-05-13_05-43-51_game-of-life-cli-user-story_v5-exact-single-context_sonnet-4-6-portkey-no-thinking/src/gameOfLife.ts:6— gameOfLife.step has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 4 (7 pts), boolean chains 3, ternaries 1 (nesting depth added 7). Of this number, 17 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pricing.basePremiumOf (cognitive 18) experiments/runs/2026-05-16_09-26-53_claim-office-prose_v1-oneshot_opus-4-7-no-thinking/src/pricing.ts:45— pricing.basePremiumOf has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 5 (9 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
analyze_transcript.aggregate_skill_phases (cognitive 18) experiments/analyze_transcript.py:533— analyze_transcript.aggregate_skill_phases has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 4 (11 pts), if/else 3 (4 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
generate-snapshot-skeleton.emit_skeleton (cognitive 18) experiments/generate-snapshot-skeleton.py:205— generate-snapshot-skeleton.emit_skeleton has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 6 (8 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
measure-suite-transitions.measure (cognitive 18) experiments/measure-suite-transitions.py:210— measure-suite-transitions.measure has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 5, boolean chains 4, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
rust_tdd.external_test_modules (cognitive 18) REDACTED:233— rust_tdd.external_test_modules has cognitive complexity 18 (threshold 15). Drivers by points: if/else 2 (7 pts), loops 3 (6 pts), ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rust_tdd.impl_line_coverage (cognitive 18) REDACTED:324— rust_tdd.impl_line_coverage has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 2 (4 pts), error handling 1 (3 pts), boolean chains 2, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
quote.computeItemsBasePremium (cognitive 17) experiments/runs/2026-05-16_09-38-15_claim-office-prose_v2-iterative_opus-4-7-no-thinking/src/quote.ts:33— quote.computeItemsBasePremium has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (7 pts), ternaries 2 (6 pts), if/else 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
generate-snapshot-skeleton.collect_rqs (cognitive 17) experiments/generate-snapshot-skeleton.py:144— generate-snapshot-skeleton.collect_rqs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (3 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
parse_opencode_transcript.main (cognitive 17) experiments/parse_opencode_transcript.py:159— parse_opencode_transcript.main has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 12, if/else 3, error handling 1, loops 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
rust_tdd._item_end (cognitive 17) REDACTED:141— rust_tdd._item_end has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rust_tdd.is_partial (cognitive 17) REDACTED:421— rust_tdd.is_partial has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 3, boolean chains 2, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
game-of-life.step (cognitive 16) experiments/runs/2026-05-12_22-53-00_game-of-life-cli-prose_v5-exact-single-context_opus-4-6-portkey-no-thinking/src/game-of-life.ts:11— game-of-life.step has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (7 pts), if/else 2 (6 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
game-of-life.tick (cognitive 16) experiments/runs/2026-05-13_05-58-56_game-of-life-cli-prose_v5-exact-single-context_opus-4-6-portkey-no-thinking-2/src/game-of-life.ts:1— game-of-life.tick has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (7 pts), if/else 2 (6 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
aggregate-by-query.expand_cells (cognitive 16) experiments/aggregate-by-query.py:129— aggregate-by-query.expand_cells has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 5 (7 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
migrate-legacy-discipline.main (cognitive 16) experiments/migrate-legacy-discipline.py:76— migrate-legacy-discipline.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4 (6 pts), ternaries 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
parse_pi_transcript._session_bounds (cognitive 16) experiments/parse_pi_transcript.py:277— parse_pi_transcript._session_bounds has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (13 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
parse_pi_transcript._process_tool_call_event (cognitive 16) experiments/parse_pi_transcript.py:292— parse_pi_transcript._process_tool_call_event has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 5 (7 pts), loops 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
parse_pi_transcript._subagent_usage_of (cognitive 16) experiments/parse_pi_transcript.py:415— parse_pi_transcript._subagent_usage_of has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rq-status.facts (cognitive 16) experiments/rq-status.py:68— rq-status.facts has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), boolean chains 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D4 · Code Duplication· Edited copy of a member (59 corresponding lines) · ×1
Edited copy of a member (59 corresponding lines) experiments/measure-suite-transitions.py:267— experiments/measure-suite-transitions.py:267-337 | experiments/measure-tdd-rigour.py:145-203 — These two members are one piece of code written twice and then edited apart: 59 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (23 corresponding lines) · ×1
Edited copy of a member (23 corresponding lines) experiments/parse_pi_transcript.py:140— experiments/parse_pi_transcript.py:140-167 | experiments/parse_pi_transcript.py:293-315 — These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (18–22 lines × 2) experiments/measure-suite-transitions.py:292— experiments/measure-suite-transitions.py:292-313 | experiments/measure-tdd-rigour.py:173-190 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (15–16 lines × 2) experiments/analyze_transcript.py:472— experiments/analyze_transcript.py:472-487 | experiments/analyze_transcript.py:499-513 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12–13 lines × 2) experiments/measure-suite-transitions.py:279— experiments/measure-suite-transitions.py:279-290 | experiments/measure-tdd-rigour.py:158-170 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `experiments/measure-suite-transitions.py:279` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `experiments/measure-tdd-rigour.py:157` calls `add_argument` and `experiments/measure-suite-transitions.py:278` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (11–13 lines × 2) experiments/measure-suite-transitions.py:327— experiments/measure-suite-transitions.py:327-337 | experiments/measure-tdd-rigour.py:191-203 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (9–11 lines × 2) experiments/parse_pi_transcript.py:156— experiments/parse_pi_transcript.py:156-166 | experiments/parse_pi_transcript.py:307-315 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (7–8 lines × 2) REDACTED:480— REDACTED:480-487 | REDACTED:909-915 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:480` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6–8 lines × 2) experiments/measure-suite-transitions.py:271— experiments/measure-suite-transitions.py:271-276 | experiments/measure-tdd-rigour.py:150-157 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `experiments/measure-suite-transitions.py:271` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `experiments/measure-suite-transitions.py:278` calls `add_argument` and `experiments/measure-tdd-rigour.py:158` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication· Edited copies of one member (4 members, 28+ corresponding lines) · ×1
Edited copies of one member (4 members, 28+ corresponding lines) experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex/src/lib.rs:85— experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex/src/lib.rs:85-113 | experiments/runs/2026-10-01_12-15-39_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/lib.rs:111-139 | experiments/runs/2026-10-01_12-16-09_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/lib.rs:109-137 | experiments/runs/2026-10-01_14-39-03_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/lib.rs:87-114 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 28 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (29 corresponding lines) · ×1
Edited copy of a member (29 corresponding lines) experiments/runs/2026-09-20_06-41-39_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOfficeCli.java:52— experiments/runs/2026-09-20_06-41-39_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOfficeCli.java:52-80 | experiments/runs/2026-09-20_08-53-35_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOfficeCli.java:38-66 — These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (27 corresponding lines) · ×1
Edited copy of a member (27 corresponding lines) experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex-4/src/lib.rs:73— experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex-4/src/lib.rs:73-99 | experiments/runs/2026-10-01_14-35-25_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex/src/lib.rs:104-130 — These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (30 corresponding lines) · ×1
Edited copy of a member (30 corresponding lines) experiments/runs/2026-09-20_06-41-41_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOfficeCli.java:39— experiments/runs/2026-09-20_06-41-41_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOfficeCli.java:39-68 | experiments/runs/2026-09-20_08-53-35_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-3/src/main/java/ClaimOffice.java:22-51 — These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (22 corresponding lines) · ×1
Edited copy of a member (22 corresponding lines) experiments/runs/2026-09-20_06-35-28_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOffice.java:22— experiments/runs/2026-09-20_06-35-28_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOffice.java:22-47 | experiments/runs/2026-09-20_06-35-30_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOffice.java:14-35 — These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 24+ corresponding lines) · ×1
Edited copies of one member (3 members, 24+ corresponding lines) experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex-3/src/lib.rs:122— experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex-3/src/lib.rs:122-145 | experiments/runs/2026-10-01_12-11-13_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex/src/lib.rs:122-146 | experiments/runs/2026-10-01_14-35-25_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex/src/lib.rs:124-147 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (26 corresponding lines) · ×1
Edited copy of a member (26 corresponding lines) experiments/runs/2026-09-20_06-40-50_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOfficeCli.java:16— experiments/runs/2026-09-20_06-40-50_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOfficeCli.java:16-41 | experiments/runs/2026-09-20_08-53-35_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex/src/main/java/ClaimOfficeCli.java:46-74 — These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 25+ corresponding lines) · ×1
Edited copies of one member (3 members, 25+ corresponding lines) experiments/runs/2026-09-20_07-18-54_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/ScenarioRunner.java:22— experiments/runs/2026-09-20_07-18-54_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/ScenarioRunner.java:22-46 | experiments/runs/2026-09-20_07-22-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/Scenario.java:19-45 | experiments/runs/2026-09-20_07-28-11_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOfficeCli.java:35-60 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 25 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (25 corresponding lines) · ×1
Edited copy of a member (25 corresponding lines) experiments/runs/2026-09-20_06-35-28_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOfficeCli.java:54— experiments/runs/2026-09-20_06-35-28_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOfficeCli.java:54-78 | experiments/runs/2026-09-20_06-35-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOffice.java:19-43 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (5 members, 17+ corresponding lines) · ×1
Edited copies of one member (5 members, 17+ corresponding lines) experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex-3/src/lib.rs:97— experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex-3/src/lib.rs:97-120 | experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex/src/lib.rs:105-127 | experiments/runs/2026-10-01_12-11-13_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex/src/lib.rs:102-120 | experiments/runs/2026-10-01_12-16-10_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/domain.rs:103-119 | experiments/runs/2026-10-01_14-35-25_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex/src/lib.rs:98-121 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 15+ corresponding lines) · ×1
Edited copies of one member (3 members, 15+ corresponding lines) experiments/runs/2026-09-21_21-09-45_game-of-life-python-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/game_of_life.py:20— experiments/runs/2026-09-21_21-09-45_game-of-life-python-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/game_of_life.py:20-34 | experiments/runs/2026-09-21_21-09-45_game-of-life-python-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/game_of_life.py:20-37 | experiments/runs/2026-09-22_06-32-50_game-of-life-python-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/game_of_life.py:21-37 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 14+ corresponding lines) · ×1
Edited copies of one member (3 members, 14+ corresponding lines) experiments/runs/2026-09-20_07-22-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/Premium.java:46— experiments/runs/2026-09-20_07-22-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/Premium.java:46-60 | experiments/runs/2026-09-20_07-28-11_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/Policy.java:17-34 | experiments/runs/2026-09-20_07-33-00_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/ComponentBlocks.java:14-27 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (19 corresponding lines) · ×1
Edited copy of a member (19 corresponding lines) experiments/runs/2026-10-01_12-43-20_claim-office-rust-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/lib.rs:117— experiments/runs/2026-10-01_12-43-20_claim-office-rust-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/lib.rs:117-137 | experiments/runs/2026-10-01_12-43-48_claim-office-rust-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/lib.rs:373-391 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 17+ corresponding lines) · ×1
Edited copies of one member (3 members, 17+ corresponding lines) experiments/runs/2026-09-21_21-33-20_claim-office-python-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/claim_office.py:148— experiments/runs/2026-09-21_21-33-20_claim-office-python-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/claim_office.py:148-165 | experiments/runs/2026-09-21_22-14-14_claim-office-python-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/cli.py:8-27 | experiments/runs/2026-09-21_23-21-10_claim-office-python-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex/src/cli.py:12-28 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (5 members, 5+ corresponding lines) · ×1
Edited copies of one member (5 members, 5+ corresponding lines) experiments/runs/2026-09-21_23-55-36_game-of-life-python-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/cli.py:11— experiments/runs/2026-09-21_23-55-36_game-of-life-python-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/cli.py:11-15 | experiments/runs/2026-09-22_00-00-55_game-of-life-python-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/cli.py:11-15 | experiments/runs/2026-09-22_00-15-52_game-of-life-python-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/cli.py:11-15 | experiments/runs/2026-09-22_00-17-00_game-of-life-python-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/cli.py:13-19 | experiments/runs/2026-09-22_01-08-06_game-of-life-python-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/cli.py:13-17 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 13+ corresponding lines) · ×1
Edited copies of one member (3 members, 13+ corresponding lines) experiments/runs/2026-09-22_00-20-04_claim-office-python-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/claim_office.py:184— experiments/runs/2026-09-22_00-20-04_claim-office-python-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/claim_office.py:184-200 | experiments/runs/2026-09-22_00-29-36_claim-office-python-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/claim_office.py:192-204 | experiments/runs/2026-09-22_05-55-30_claim-office-python-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/claim_office.py:219-237 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 8+ corresponding lines) · ×1
Edited copies of one member (4 members, 8+ corresponding lines) experiments/runs/2026-09-20_06-53-35_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:20— experiments/runs/2026-09-20_06-53-35_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:20-30 | experiments/runs/2026-09-20_06-55-04_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:22-31 | experiments/runs/2026-09-20_06-56-38_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:22-29 | experiments/runs/2026-09-20_06-59-41_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:20-28 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (5 members, 7+ corresponding lines) · ×1
Edited copies of one member (5 members, 7+ corresponding lines) experiments/runs/2026-09-20_06-58-06_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GenerationJson.java:28— experiments/runs/2026-09-20_06-58-06_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GenerationJson.java:28-34 | experiments/runs/2026-09-20_06-58-08_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GenerationJson.java:26-32 | experiments/runs/2026-09-20_07-01-23_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:37-43 | experiments/runs/2026-09-20_07-04-55_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:36-42 | experiments/runs/2026-09-20_08-53-34_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-2/src/main/java/GameOfLifeCli.java:31-37 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (5 members, 4+ corresponding lines) · ×1
Edited copies of one member (5 members, 4+ corresponding lines) experiments/runs/2026-09-21_16-30-48_game-of-life-python-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/cli.py:8— experiments/runs/2026-09-21_16-30-48_game-of-life-python-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/cli.py:8-11 | experiments/runs/2026-09-21_21-09-44_game-of-life-python-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/cli.py:10-16 | experiments/runs/2026-09-21_21-09-44_game-of-life-python-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-3/src/cli.py:10-19 | experiments/runs/2026-09-21_21-09-45_game-of-life-python-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/cli.py:10-16 | experiments/runs/2026-09-22_06-32-50_game-of-life-python-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/cli.py:10-18 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (6 members, 9+ corresponding lines) · ×1
Edited copies of one member (6 members, 9+ corresponding lines) experiments/runs/2026-09-21_21-13-15_claim-office-python-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/cli.py:10— experiments/runs/2026-09-21_21-13-15_claim-office-python-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/cli.py:10-18 | experiments/runs/2026-09-21_21-13-27_claim-office-python-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/cli.py:10-18 | experiments/runs/2026-09-21_21-13-54_claim-office-python-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/cli.py:12-20 | experiments/runs/2026-09-21_21-14-30_claim-office-python-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/cli.py:61-69 | experiments/runs/2026-09-21_22-06-43_claim-office-python-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/cli.py:13-21 | experiments/runs/2026-09-22_00-02-08_claim-office-python-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/cli.py:14-22 — These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (5 members, 8+ corresponding lines) · ×1
Edited copies of one member (5 members, 8+ corresponding lines) experiments/runs/2026-09-20_06-48-34_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/Policy.java:61— experiments/runs/2026-09-20_06-48-34_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/Policy.java:61-68 | experiments/runs/2026-09-20_07-23-29_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/Policy.java:46-53 | experiments/runs/2026-09-20_07-33-00_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/Policy.java:45-53 | experiments/runs/2026-09-20_09-40-30_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/Policy.java:43-51 | experiments/runs/2026-09-20_10-40-56_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/DamagedItem.java:36-44 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (7 members, 7+ corresponding lines) · ×1
Edited copies of one member (7 members, 7+ corresponding lines) experiments/runs/2026-09-20_07-18-13_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOfficeCli.java:79— experiments/runs/2026-09-20_07-18-13_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOfficeCli.java:79-85 | experiments/runs/2026-09-20_07-23-29_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOfficeCli.java:68-74 | experiments/runs/2026-09-20_07-33-00_claim-office-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/ClaimOfficeCli.java:96-102 | experiments/runs/2026-09-20_09-40-30_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/ClaimOfficeCli.java:108-115 | experiments/runs/2026-09-20_10-40-56_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/ScenarioReader.java:35-41 | experiments/runs/2026-09-20_11-57-09_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/ScenarioJson.java:62-68 | experiments/runs/2026-10-19_06-18-28_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/ScenarioProtocol.java:73-80 — These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 6+ corresponding lines) · ×1
Edited copies of one member (4 members, 6+ corresponding lines) experiments/runs/2026-10-01_12-12-08_claim-office-rust-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/lib.rs:285— experiments/runs/2026-10-01_12-12-08_claim-office-rust-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/lib.rs:285-290 | experiments/runs/2026-10-01_12-21-23_claim-office-rust-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/claim.rs:69-74 | experiments/runs/2026-10-01_12-48-19_claim-office-rust-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/lib.rs:105-113 | experiments/runs/2026-10-19_02-32-59_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/lib.rs:561-566 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 2+ corresponding lines) · ×1
Edited copies of one member (3 members, 2+ corresponding lines) experiments/runs/2026-09-21_21-18-56_game-of-life-python-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/cli.py:8— experiments/runs/2026-09-21_21-18-56_game-of-life-python-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/cli.py:8-9 | experiments/runs/2026-09-21_22-45-20_game-of-life-python-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex/src/cli.py:8-9 | experiments/runs/2026-09-22_00-05-52_game-of-life-python-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/cli.py:12-13 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 5+ corresponding lines) · ×1
Edited copies of one member (3 members, 5+ corresponding lines) experiments/runs/2026-09-20_06-56-38_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/gol/GameOfLife.java:12— experiments/runs/2026-09-20_06-56-38_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/gol/GameOfLife.java:12-16 | experiments/runs/2026-09-20_06-58-08_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLife.java:7-11 | experiments/runs/2026-09-20_07-01-23_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLife.java:7-11 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (1 corresponding lines) · ×1
Edited copy of a member (1 corresponding lines) experiments/runs/2026-09-21_21-18-56_game-of-life-python-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/game_of_life.py:16— experiments/runs/2026-09-21_21-18-56_game-of-life-python-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/game_of_life.py:16-22 | experiments/runs/2026-09-22_00-05-52_game-of-life-python-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/game_of_life.py:14-14 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 4+ corresponding lines) · ×1
Edited copies of one member (4 members, 4+ corresponding lines) experiments/runs/2026-09-20_06-58-08_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLife.java:19— experiments/runs/2026-09-20_06-58-08_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLife.java:19-24 | experiments/runs/2026-09-20_07-04-55_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLife.java:19-22 | experiments/runs/2026-09-20_09-25-34_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/GameOfLife.java:24-29 | experiments/runs/2026-09-20_09-38-26_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/gameoflife/GameOfLife.java:34-39 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
Duplicated block (15 lines × 2) experiments/runs/2026-09-20_06-41-41_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOffice.java:102— experiments/runs/2026-09-20_06-41-41_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOffice.java:102-116 | experiments/runs/2026-09-20_06-41-41_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOffice.java:122-136 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (9 lines × 10) experiments/runs/2026-09-20_06-53-35_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/gameoflife/Cell.java:10— experiments/runs/2026-09-20_06-53-35_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/gameoflife/Cell.java:10-18 | experiments/runs/2026-09-20_06-55-04_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/gameoflife/Cell.java:10-18 | experiments/runs/2026-09-20_06-56-38_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/gol/Cell.java:10-18 | experiments/runs/2026-09-20_06-59-43_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/Cell.java:8-16 | experiments/runs/2026-09-20_07-01-23_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/Cell.java:8-16 | experiments/runs/2026-09-20_07-04-55_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/Cell.java:8-16 | experiments/runs/2026-09-20_09-25-34_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/Cell.java:8-16 | experiments/runs/2026-09-20_09-31-01_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/gameoflife/Cell.java:10-18 | experiments/runs/2026-09-20_09-37-48_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/Cell.java:8-16 | experiments/runs/2026-09-20_09-38-26_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/gameoflife/Cell.java:10-18 — before extracting anything, compare `experiments/runs/2026-09-20_06-56-38_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/gol/Cell.java` and `experiments/runs/2026-09-20_06-59-43_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/Cell.java` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `experiments/runs/2026-09-20_06-53-35_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/gameoflife/Cell.java:10` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (9 lines × 4) experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/GameOfLife.java:38— experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/GameOfLife.java:38-46 | experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-3/src/main/java/GameOfLife.java:36-44 | experiments/runs/2026-09-20_06-39-36_game-of-life-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/GameOfLife.java:24-32 | experiments/runs/2026-09-20_08-53-34_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-2/src/main/java/GameOfLife.java:21-29 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at `experiments/runs/2026-09-20_06-39-36_game-of-life-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/GameOfLife.java:24` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5–6 lines × 2) experiments/runs/2026-09-20_06-41-39_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOfficeCli.java:67— experiments/runs/2026-09-20_06-41-39_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOfficeCli.java:67-71 | experiments/runs/2026-09-20_08-53-35_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-4/src/main/java/ClaimOfficeCli.java:141-146 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `experiments/runs/2026-09-20_08-53-35_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-4/src/main/java/ClaimOfficeCli.java:141` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `experiments/runs/2026-09-20_06-41-39_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOfficeCli.java:71` calls `add`, `IllegalArgumentException` and `experiments/runs/2026-09-20_08-53-35_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-4/src/main/java/ClaimOfficeCli.java:146` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (10 lines × 3) experiments/runs/2026-09-20_07-18-13_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/Money.java:7— experiments/runs/2026-09-20_07-18-13_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/Money.java:7-16 | experiments/runs/2026-09-20_07-18-54_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/MhpcoRounding.java:10-19 | experiments/runs/2026-09-20_10-40-56_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/WholeG.java:19-36 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (6 lines × 6) experiments/runs/2026-09-20_06-35-28_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOfficeCli.java:22— experiments/runs/2026-09-20_06-35-28_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOfficeCli.java:22-27 | experiments/runs/2026-09-20_06-41-39_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOfficeCli.java:27-32 | experiments/runs/2026-09-20_06-41-41_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOfficeCli.java:18-23 | experiments/runs/2026-09-20_08-53-35_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOfficeCli.java:20-25 | experiments/runs/2026-09-20_08-53-35_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-5/src/main/java/ClaimOfficeCli.java:17-22 | experiments/runs/2026-09-20_08-53-35_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex/src/main/java/ClaimOfficeCli.java:39-44 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 6 times.
Duplicated block (7 lines × 4) experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-3/src/main/java/GameOfLifeCli.java:36— experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-3/src/main/java/GameOfLifeCli.java:36-42 | experiments/runs/2026-09-20_06-53-35_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:32-38 | experiments/runs/2026-09-20_06-59-43_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:42-48 | experiments/runs/2026-09-20_09-27-18_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/GameOfLifeJson.java:42-48 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (8 lines × 10) experiments/runs/2026-09-20_06-39-36_game-of-life-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLifeCli.java:35— experiments/runs/2026-09-20_06-39-36_game-of-life-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLifeCli.java:35-42 | experiments/runs/2026-09-20_06-39-44_game-of-life-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLifeCli.java:34-41 | experiments/runs/2026-09-20_06-40-05_game-of-life-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLifeCli.java:20-27 | experiments/runs/2026-09-20_06-58-08_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:14-21 | experiments/runs/2026-09-20_06-59-43_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:33-40 | experiments/runs/2026-09-20_07-01-23_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:28-35 | experiments/runs/2026-09-20_07-04-55_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:27-34 | experiments/runs/2026-09-20_08-53-33_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-2/src/main/java/GameOfLifeCli.java:19-26 | experiments/runs/2026-09-20_08-53-34_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-2/src/main/java/GameOfLifeCli.java:22-29 | experiments/runs/2026-09-20_09-37-48_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/GameOfLifeCli.java:37-44 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 10 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 10 times. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (10 lines × 4) experiments/runs/2026-09-20_06-40-50_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOfficeCli.java:149— experiments/runs/2026-09-20_06-40-50_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOfficeCli.java:149-158 | experiments/runs/2026-09-20_06-41-29_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOfficeCli.java:182-191 | experiments/runs/2026-09-20_08-53-35_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-3/src/main/java/ClaimOffice.java:157-166 | experiments/runs/2026-09-20_08-53-35_claim-office-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex/src/main/java/InsuranceValuation.java:5-14 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times.
Duplicated block (7 lines × 5) experiments/runs/2026-09-20_06-58-06_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLife.java:20— experiments/runs/2026-09-20_06-58-06_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLife.java:20-26 | experiments/runs/2026-09-20_09-25-34_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/GameOfLife.java:6-12 | experiments/runs/2026-09-20_09-27-18_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/GameOfLife.java:22-28 | experiments/runs/2026-09-20_09-31-01_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/gameoflife/GameOfLife.java:8-14 | experiments/runs/2026-09-20_09-38-26_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/gameoflife/GameOfLife.java:14-20 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 5 times. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (9 lines × 3) experiments/runs/2026-09-20_06-59-43_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLife.java:40— experiments/runs/2026-09-20_06-59-43_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLife.java:40-48 | experiments/runs/2026-09-20_09-25-34_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/GameOfLife.java:51-59 | experiments/runs/2026-09-20_09-31-01_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/main/java/gameoflife/GameOfLife.java:50-58 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (16 lines × 2) experiments/runs/2026-09-21_21-33-20_claim-office-python-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/claim_office.py:148— experiments/runs/2026-09-21_21-33-20_claim-office-python-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/claim_office.py:148-163 | experiments/runs/2026-09-21_22-14-14_claim-office-python-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/cli.py:9-24 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (6 lines × 7) experiments/runs/2026-09-21_16-30-48_game-of-life-python-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/game_of_life.py:47— experiments/runs/2026-09-21_16-30-48_game-of-life-python-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/game_of_life.py:47-52 | experiments/runs/2026-09-21_23-59-30_game-of-life-python-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/game_of_life.py:39-44 | experiments/runs/2026-09-22_00-00-55_game-of-life-python-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/game_of_life.py:12-17 | experiments/runs/2026-09-22_00-05-52_game-of-life-python-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/game_of_life.py:22-27 | experiments/runs/2026-09-22_00-28-11_game-of-life-python-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking/src/game_of_life.py:37-42 | experiments/runs/2026-09-22_01-08-06_game-of-life-python-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/game_of_life.py:15-20 | experiments/runs/2026-09-22_02-01-49_game-of-life-python-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/game_of_life.py:14-19 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 7 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 7 times. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (6 lines × 5) experiments/runs/2026-09-21_16-30-49_game-of-life-python-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/game_of_life.py:18— experiments/runs/2026-09-21_16-30-49_game-of-life-python-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/game_of_life.py:18-23 | experiments/runs/2026-09-21_21-09-44_game-of-life-python-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-3/src/game_of_life.py:21-26 | experiments/runs/2026-09-21_21-20-12_game-of-life-python-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/game_of_life.py:15-20 | experiments/runs/2026-09-21_21-58-41_game-of-life-python-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex/src/game_of_life.py:43-48 | experiments/runs/2026-09-21_22-45-20_game-of-life-python-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex/src/game_of_life.py:15-20 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 5 times. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (11–14 lines × 3) experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex-3/src/lib.rs:107— experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex-3/src/lib.rs:107-120 | experiments/runs/2026-10-01_12-11-13_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex/src/lib.rs:110-120 | experiments/runs/2026-10-01_14-35-25_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex/src/lib.rs:108-121 — before extracting anything, compare `experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex-3/src/lib.rs` and `experiments/runs/2026-10-01_14-35-25_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex/src/lib.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex-3/src/lib.rs:107` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 9) experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex-3/src/lib.rs:56— experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex-3/src/lib.rs:56-63 | experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex-4/src/lib.rs:10-17 | experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex-4/src/lib.rs:7-14 | experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex/src/lib.rs:10-17 | experiments/runs/2026-10-01_12-12-08_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/lib.rs:25-32 | experiments/runs/2026-10-01_12-15-39_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/lib.rs:9-16 | experiments/runs/2026-10-01_14-35-25_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex/src/lib.rs:55-62 | experiments/runs/2026-10-01_14-35-25_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex/src/lib.rs:5-12 | experiments/runs/2026-10-01_14-39-03_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/lib.rs:5-12 — before extracting anything, compare `experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex-3/src/lib.rs` and `experiments/runs/2026-10-01_14-35-25_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex/src/lib.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex-3/src/lib.rs:56` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 10) experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex-3/src/lib.rs:55— experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex-3/src/lib.rs:55-60 | experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex-4/src/lib.rs:9-14 | experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex-4/src/lib.rs:6-11 | experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex/src/lib.rs:9-14 | experiments/runs/2026-10-01_12-12-08_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/lib.rs:24-29 | experiments/runs/2026-10-01_12-15-39_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/lib.rs:8-13 | experiments/runs/2026-10-01_12-16-10_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/domain.rs:54-59 | experiments/runs/2026-10-01_14-35-25_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex/src/lib.rs:54-59 | experiments/runs/2026-10-01_14-35-25_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex/src/lib.rs:4-9 | experiments/runs/2026-10-01_14-39-03_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/lib.rs:4-9 — before extracting anything, compare `experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex-3/src/lib.rs` and `experiments/runs/2026-10-01_14-35-25_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex/src/lib.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex-3/src/lib.rs:55` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 4) experiments/runs/2026-10-01_02-28-23_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex/src/lib.rs:85— experiments/runs/2026-10-01_02-28-23_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex/src/lib.rs:85-92 | experiments/runs/2026-10-01_12-11-12_claim-office-rust-example-mapping_exact-ptdd-v1-pi_gpt-6-sol-codex/src/lib.rs:56-64 | experiments/runs/2026-10-01_12-16-09_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/lib.rs:82-90 | experiments/runs/2026-10-01_14-39-03_claim-office-rust-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-6-sol-codex/src/lib.rs:59-66 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times.
Hollow method — returns a constant without doing the work experiments/runs/2026-05-13_06-11-48_game-of-life-cli-prose_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/gameOfLife.ts:6— `step` looks like it should compute a result but its body just returns a constant — a placeholder return that was never filled in.
No structured logging — No logging call was found in the 5294 Python, JavaScript/TypeScript, Rust, JVM production file(s) this check read across 2015 module(s). Each was searched for its ecosystem's logging libraries (JVM: SLF4J, Log4j2, java.util.logging, Logback, kotlin-logging, scala-logging; Python: logging, structlog, loguru; JavaScript/TypeScript: pino, winston, bunyan, log4js, loglevel, consola, the NestJS Logger; Rust: the log and tracing crates (info!/warn!/error!, #[instrument]), slog, env_logger) and for a call on a receiver named `log`/`logger` (or ending in `Logger`/`_logger`) with a level verb. It cannot see logging through a repo-local wrapper named otherwise, or in source it did not read — this is 'no logging found by this walk', not a verdict that nothing here logs. If it is right, production issues will be hard to diagnose.
No DR/backup evidence — A persistence guard (data volume / purge-protection) was found, but no backup, geo-recovery or RTO/RPO controls were evidenced — a volume that survives a container recreate is not a tested restore from catastrophic loss.
Duplication concentrated across 1287 sibling directories (3127 clone groups) experiments/runs/2026-05-25_18-49-39_claim-office-example-mapping_v8b-delayed-refactor-native_opus-4-7-portkey-no-thinking/src/claim-office.ts:3— 3127 duplicated blocks under experiments/runs/ have copies in at least two of the sibling directories 2026-05-03_04-15-52_mars-rover-prose_v5-exact-single-context_haiku-4-5, 2026-05-03_05-13-45_game-of-life-prose_v5-exact-single-context_opus-4-7, 2026-05-03_05-19-00_game-of-life-prose_v5-exact-single-context_opus-4-7-no-thinking, 2026-05-03_05-23-01_game-of-life-prose_v5-exact-single-context_sonnet-4-6, 2026-05-03_05-33-40_game-of-life-prose_v5-exact-single-context_haiku-4-5, 2026-05-03_05-43-31_mars-rover-prose_v3-basic-tdd_sonnet-4-6 (+1281 more sibling(s) not listed) — 2360 of them are reported below, and 767 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 3127 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 3127 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 3127 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
R10 · Code Duplication· Duplicated block with local edits (119 matched lines × 2 locations) · ×1
Duplicated block with local edits (119 matched lines × 2 locations) experiments/runs/2026-05-25_18-49-39_claim-office-example-mapping_v8b-delayed-refactor-native_opus-4-7-portkey-no-thinking/src/claim-office.ts:3— experiments/runs/2026-05-25_18-49-39_claim-office-example-mapping_v8b-delayed-refactor-native_opus-4-7-portkey-no-thinking/src/claim-office.ts:3 · experiments/runs/2026-05-25_18-54-44_claim-office-example-mapping_v8b-delayed-refactor-native_opus-4-7-portkey-no-thinking/src/claim-office.ts:3 — the two spans are one implementation copied and then locally edited — 653 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (116 matched lines × 2 locations) · ×1
Duplicated block with local edits (116 matched lines × 2 locations) experiments/runs/2026-07-24_15-48-37_claim-office-example-mapping_v6.2-with-why-cleaned-pi_opus-4-8-no-thinking/src/claim-office.ts:1— experiments/runs/2026-07-24_15-48-37_claim-office-example-mapping_v6.2-with-why-cleaned-pi_opus-4-8-no-thinking/src/claim-office.ts:1 · experiments/runs/2026-07-25_19-11-36_claim-office-example-mapping_v6.2-with-why-cleaned-oc_opus-4-8-requesty/src/claim-office.ts:1 — the two spans are one implementation copied and then locally edited — 620 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (85 matched lines × 2 locations) · ×1
Duplicated block with local edits (85 matched lines × 2 locations) experiments/runs/2026-08-11_00-48-46_claim-office-example-mapping_v6.1-hybrid-testlist-scope-fix_opus-5-no-thinking/src/claim-office.ts:38— experiments/runs/2026-08-11_00-48-46_claim-office-example-mapping_v6.1-hybrid-testlist-scope-fix_opus-5-no-thinking/src/claim-office.ts:38 · experiments/runs/2026-08-17_07-16-10_claim-office-example-mapping_v6.2-with-why-cleaned_opus-5-no-thinking/src/claim-office.ts:70 — the two spans are one implementation copied and then locally edited — 581 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (75 matched lines × 2 locations) · ×1
Duplicated block with local edits (75 matched lines × 2 locations) experiments/runs/2026-08-17_06-45-48_claim-office-example-mapping_basic-sol-tdd-cc_opus-4-8-no-thinking/src/claim-office.ts:47— experiments/runs/2026-08-17_06-45-48_claim-office-example-mapping_basic-sol-tdd-cc_opus-4-8-no-thinking/src/claim-office.ts:47 · experiments/runs/2026-08-17_06-46-12_claim-office-example-mapping_basic-sol-tdd-cc_opus-4-8-no-thinking/src/claim-office.ts:57 — the two spans are one implementation copied and then locally edited — 360 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (74 matched lines × 2 locations) · ×1
Duplicated block with local edits (74 matched lines × 2 locations) experiments/runs/2026-08-17_07-00-06_claim-office-example-mapping_basic-sol-tdd-cc_opus-5-no-thinking/src/claim-office.ts:57— experiments/runs/2026-08-17_07-00-06_claim-office-example-mapping_basic-sol-tdd-cc_opus-5-no-thinking/src/claim-office.ts:57 · experiments/runs/2026-08-17_07-04-36_claim-office-example-mapping_basic-sol-tdd-cc_opus-5-no-thinking/src/claim-office.ts:77 — the two spans are one implementation copied and then locally edited — 599 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (73 matched lines × 2 locations) · ×1
Duplicated block with local edits (73 matched lines × 2 locations) experiments/runs/2026-08-10_08-17-05_claim-office-example-mapping_v5.1-testlist-scope-fix-pi_gpt-5-6-sol/src/claim-office.ts:5— experiments/runs/2026-08-10_08-17-05_claim-office-example-mapping_v5.1-testlist-scope-fix-pi_gpt-5-6-sol/src/claim-office.ts:5 · experiments/runs/2026-08-17_15-02-41_claim-office-example-mapping_basic-sol-tdd-app-measured-tool-pi_gpt-5-6-sol-codex/src/claim-office.ts:10 — the two spans are one implementation copied and then locally edited — 496 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (72 matched lines × 2 locations) · ×1
Duplicated block with local edits (72 matched lines × 2 locations) experiments/runs/2026-08-10_15-38-59_claim-office-example-mapping_v5.1-testlist-scope-fix_opus-5-no-thinking/src/claim-office.ts:65— experiments/runs/2026-08-10_15-38-59_claim-office-example-mapping_v5.1-testlist-scope-fix_opus-5-no-thinking/src/claim-office.ts:65 · experiments/runs/2026-08-17_06-59-21_claim-office-example-mapping_basic-sol-tdd-cc_opus-5-no-thinking/src/claim-office.ts:78 — the two spans are one implementation copied and then locally edited — 530 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (64 matched lines × 2 locations) · ×1
Duplicated block with local edits (64 matched lines × 2 locations) experiments/runs/2026-08-16_21-17-00_claim-office-example-mapping_v3-basic-tdd-pi_gpt-5-6-sol-codex-3/src/claim-office.ts:25— experiments/runs/2026-08-16_21-17-00_claim-office-example-mapping_v3-basic-tdd-pi_gpt-5-6-sol-codex-3/src/claim-office.ts:25 · experiments/runs/2026-08-16_21-17-00_claim-office-example-mapping_v3-basic-tdd-pi_gpt-5-6-sol-codex/src/claim-office.ts:21 — the two spans are one implementation copied and then locally edited — 372 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (63 matched lines × 2 locations) · ×1
Duplicated block with local edits (63 matched lines × 2 locations) experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/src/scopes.ts:35— experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/src/scopes.ts:35 · experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/src/scopes.ts:129 — the two spans are one implementation copied and then locally edited — 432 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (60 matched lines × 2 locations) · ×1
Duplicated block with local edits (60 matched lines × 2 locations) experiments/runs/2026-05-30_01-30-14_claim-office-example-mapping_v6.4-metric-driven-refactor_opus-4-8-no-thinking/src/claim-office.ts:33— experiments/runs/2026-05-30_01-30-14_claim-office-example-mapping_v6.4-metric-driven-refactor_opus-4-8-no-thinking/src/claim-office.ts:33 · experiments/runs/2026-05-30_06-28-45_claim-office-example-mapping_v6.5-end-refactor_opus-4-8-no-thinking/src/claim-office.ts:32 — the two spans are one implementation copied and then locally edited — 417 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Wholesale file copy (60 identical lines × 2 files) experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/src/async.js:1— experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/src/async.js:1 · experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/src/sync.js:1 — these 2 files are line-for-line copies of one another — 60 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done.
R10 · Code Duplication· Duplicated block with local edits (58 matched lines × 2 locations) · ×1
Duplicated block with local edits (58 matched lines × 2 locations) experiments/runs/2026-08-10_09-45-55_claim-office-example-mapping_v3-basic-tdd-pi_gpt-5-6-sol/src/claim-office.ts:4— experiments/runs/2026-08-10_09-45-55_claim-office-example-mapping_v3-basic-tdd-pi_gpt-5-6-sol/src/claim-office.ts:4 · experiments/runs/2026-08-10_09-46-02_claim-office-example-mapping_v3-basic-tdd-pi_gpt-5-6-sol/src/claim-office.ts:1 — the two spans are one implementation copied and then locally edited — 596 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (57 matched lines × 2 locations) · ×1
Duplicated block with local edits (57 matched lines × 2 locations) experiments/runs/2026-08-17_06-44-43_claim-office-example-mapping_basic-sol-tdd-cc_opus-4-8-no-thinking/src/claim-office.ts:172— experiments/runs/2026-08-17_06-44-43_claim-office-example-mapping_basic-sol-tdd-cc_opus-4-8-no-thinking/src/claim-office.ts:172 · experiments/runs/2026-08-17_06-44-58_claim-office-example-mapping_basic-sol-tdd-cc_opus-4-8-no-thinking/src/claimOffice.ts:163 — the two spans are one implementation copied and then locally edited — 479 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (55 lines × 2 locations) experiments/runs/2026-05-25_18-36-34_claim-office-example-mapping_v8a-delayed-refactor-agent_opus-4-7-portkey-no-thinking/src/claim-office.ts:5— experiments/runs/2026-05-25_18-36-34_claim-office-example-mapping_v8a-delayed-refactor-agent_opus-4-7-portkey-no-thinking/src/claim-office.ts:5 · experiments/runs/2026-05-25_18-58-01_claim-office-example-mapping_v8b-delayed-refactor-native_opus-4-7-portkey-no-thinking/src/claim-office.ts:3 — the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are.
Duplicated block (53 lines × 503 locations) experiments/katas/game-of-life-cli-verification/adapter.ts:8— experiments/katas/game-of-life-cli-verification/adapter.ts:8 · experiments/katas/game-of-life-verification/adapter.ts:8 · experiments/runs/2026-05-12_22-34-20_game-of-life-cli-prose_v5-exact-single-context_haiku-4-5-portkey-no-thinking/.verification-adapter.ts:8 · experiments/runs/2026-05-12_22-43-03_game-of-life-cli-prose_v5-exact-single-context_opus-4-6-portkey-no-thinking-2/.verification-adapter.ts:8 · +499 more site(s) not listed — the 503 copies are spread across 503 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 503 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete.
R10 · Code Duplication· Duplicated block with local edits (53 matched lines × 2 locations) · ×1
Duplicated block with local edits (53 matched lines × 2 locations) experiments/runs/2026-08-10_15-38-59_claim-office-example-mapping_v5.1-testlist-scope-fix_opus-5-no-thinking/src/claim-office.ts:90— experiments/runs/2026-08-10_15-38-59_claim-office-example-mapping_v5.1-testlist-scope-fix_opus-5-no-thinking/src/claim-office.ts:90 · experiments/runs/2026-08-17_07-03-06_claim-office-example-mapping_basic-sol-tdd-cc_opus-5-no-thinking/src/claim-office.ts:44 — the two spans are one implementation copied and then locally edited — 397 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (52 matched lines × 2 locations) · ×1
Duplicated block with local edits (52 matched lines × 2 locations) experiments/runs/2026-05-27_03-39-46_claim-office-example-mapping_v6.4-metric-driven-refactor_opus-4-7-no-thinking/src/claim-office.ts:125— experiments/runs/2026-05-27_03-39-46_claim-office-example-mapping_v6.4-metric-driven-refactor_opus-4-7-no-thinking/src/claim-office.ts:125 · experiments/runs/2026-07-24_15-24-24_claim-office-example-mapping_v6.2-with-why-cleaned-pi_opus-4-8-5/src/claim-office.ts:109 — the two spans are one implementation copied and then locally edited — 381 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (50 matched lines × 2 locations) · ×1
Duplicated block with local edits (50 matched lines × 2 locations) experiments/runs/2026-05-22_19-29-21_claim-office-example-mapping_v6.1-hybrid-testlist-scope-fix_opus-4-7-portkey-no-thinking/src/claim-office.ts:1— experiments/runs/2026-05-22_19-29-21_claim-office-example-mapping_v6.1-hybrid-testlist-scope-fix_opus-4-7-portkey-no-thinking/src/claim-office.ts:1 · experiments/runs/2026-05-23_21-09-13_claim-office-example-mapping_v6.1-no-pep_opus-4-7-portkey-no-thinking-5/src/claim-office.ts:27 — the two spans are one implementation copied and then locally edited — 332 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (49 matched lines × 2 locations) · ×1
Duplicated block with local edits (49 matched lines × 2 locations) experiments/runs/2026-08-17_07-03-06_claim-office-example-mapping_basic-sol-tdd-cc_opus-5-no-thinking/src/claim-office.ts:29— experiments/runs/2026-08-17_07-03-06_claim-office-example-mapping_basic-sol-tdd-cc_opus-5-no-thinking/src/claim-office.ts:29 · experiments/runs/2026-08-17_07-04-36_claim-office-example-mapping_basic-sol-tdd-cc_opus-5-no-thinking/src/claim-office.ts:89 — the two spans are one implementation copied and then locally edited — 418 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (46 lines × 3 locations) experiments/runs/2026-05-16_09-21-15_claim-office-prose_v1-oneshot_opus-4-7-no-thinking/src/types.ts:3— experiments/runs/2026-05-16_09-21-15_claim-office-prose_v1-oneshot_opus-4-7-no-thinking/src/types.ts:3 · experiments/runs/2026-05-16_09-38-15_claim-office-prose_v2-iterative_opus-4-7-no-thinking/src/types.ts:2 · experiments/runs/2026-05-16_09-42-34_claim-office-prose_v2-iterative_opus-4-7-no-thinking/src/types.ts:2 — the 3 copies are spread across 3 files, and the CITED SPAN is a run of DECLARATIONS inside a construct — the members of a type, or the entries of an object or array literal — with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal's entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or — where the copies are a literal's entries rather than a type's members — one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared — a decorator and its options, an annotation, a registration table's keys — the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases.
Duplicated block (46 lines × 2 locations) experiments/runs/2026-08-05_06-44-10_claim-office-example-mapping_v6.2.1-phase-continuation-pi_opus-5-requesty-no-thinking-2/src/claim-office.ts:1— experiments/runs/2026-08-05_06-44-10_claim-office-example-mapping_v6.2.1-phase-continuation-pi_opus-5-requesty-no-thinking-2/src/claim-office.ts:1 · experiments/runs/2026-08-17_06-59-21_claim-office-example-mapping_basic-sol-tdd-cc_opus-5-no-thinking/src/claim-office.ts:1 — the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct — the members of a type, or the entries of an object or array literal — with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal's entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or — where the copies are a literal's entries rather than a type's members — one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared — a decorator and its options, an annotation, a registration table's keys — the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases.
Duplicated block (45 lines × 2 locations) experiments/runs/2026-05-25_00-20-13_claim-office-example-mapping_v6.2-with-why-cleaned_opus-4-7-portkey-no-thinking/src/claim-office.ts:1— experiments/runs/2026-05-25_00-20-13_claim-office-example-mapping_v6.2-with-why-cleaned_opus-4-7-portkey-no-thinking/src/claim-office.ts:1 · experiments/runs/2026-05-26_20-41-14_claim-office-example-mapping_v6.2-with-why-cleaned-pi_opus-4-7-portkey-no-thinking-2/src/claim-office.ts:1 — the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct — the members of a type, or the entries of an object or array literal — with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal's entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or — where the copies are a literal's entries rather than a type's members — one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared — a decorator and its options, an annotation, a registration table's keys — the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases.
Duplicated block (44 lines × 3 locations) experiments/runs/2026-08-17_06-44-43_claim-office-example-mapping_basic-sol-tdd-cc_opus-4-8-no-thinking/src/claim-office.ts:70— experiments/runs/2026-08-17_06-44-43_claim-office-example-mapping_basic-sol-tdd-cc_opus-4-8-no-thinking/src/claim-office.ts:70 · experiments/runs/2026-08-17_06-45-48_claim-office-example-mapping_basic-sol-tdd-cc_opus-4-8-no-thinking/src/claim-office.ts:55 · experiments/runs/2026-08-17_06-46-12_claim-office-example-mapping_basic-sol-tdd-cc_opus-4-8-no-thinking/src/claim-office.ts:65 — the 3 copies are spread across 3 files, and the CITED SPAN is a run of DECLARATIONS inside a construct — the members of a type, or the entries of an object or array literal — with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal's entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or — where the copies are a literal's entries rather than a type's members — one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared — a decorator and its options, an annotation, a registration table's keys — the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases.
Duplicated block (43 lines × 2 locations) experiments/runs/2026-08-05_06-44-10_claim-office-example-mapping_v6.2.1-phase-continuation-pi_opus-5-requesty-no-thinking-3/src/claim-office.ts:1— experiments/runs/2026-08-05_06-44-10_claim-office-example-mapping_v6.2.1-phase-continuation-pi_opus-5-requesty-no-thinking-3/src/claim-office.ts:1 · experiments/runs/2026-08-17_06-44-43_claim-office-example-mapping_basic-sol-tdd-cc_opus-4-8-no-thinking/src/claim-office.ts:73 — the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct — the members of a type, or the entries of an object or array literal — with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal's entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or — where the copies are a literal's entries rather than a type's members — one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared — a decorator and its options, an annotation, a registration table's keys — the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases.
Boundary violation [package:relative-cross-package] experiments/runs/2026-08-10_15-25-37_claim-office-example-mapping_v3-basic-tdd_opus-5-no-thinking-2/bin/claim-office.mjs:8— experiments/runs/2026-08-10_15-25-37_claim-office-example-mapping_v3-basic-tdd_opus-5-no-thinking-2/bin/claim-office.mjs:8 reaches into another package with a relative path (../node_modules/tsx/dist/cli.mjs) — import the package by name instead.
Complex function parse (cyclomatic 216, cognitive 402) experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/lib/parse.js:356— parse has cyclomatic complexity 216 and cognitive complexity 402; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function scan (cyclomatic 92, cognitive 203) experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/lib/scan.js:49— scan has cyclomatic complexity 92 and cognitive complexity 203; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function parse (cyclomatic 88, cognitive 102) experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/lexer.js:44— parse has cyclomatic complexity 88 and cognitive complexity 102; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function runCLI (cyclomatic 44, cognitive 110) experiments/runs/2026-05-26_09-03-22_claim-office-example-mapping_v5.1-testlist-scope-fix-oc_mistral-medium-3-5/src/cli.ts:1— runCLI has cyclomatic complexity 44 and cognitive complexity 110; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function processScenario (cyclomatic 39, cognitive 99) experiments/runs/2026-05-26_10-32-44_claim-office-example-mapping_v5.1-testlist-scope-fix-oc_mistral-medium-3-5/src/claim-office.ts:1— processScenario has cyclomatic complexity 39 and cognitive complexity 99; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 39, cognitive 83) experiments/runs/2026-05-25_17-00-27_claim-office-example-mapping_v5.1-testlist-scope-fix-oc_gemini-3-5-flash/src/claim-office.ts:92— (anonymous) has cyclomatic complexity 39 and cognitive complexity 83; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 38, cognitive 71) experiments/runs/2026-05-25_16-53-53_claim-office-example-mapping_v5.1-testlist-scope-fix-oc_gemini-3-5-flash/src/claim-office.ts:28— (anonymous) has cyclomatic complexity 38 and cognitive complexity 71; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function nextGeneration (cyclomatic 34, cognitive 33) experiments/runs/2026-08-05_00-01-18_game-of-life-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/src/game-of-life.ts:1— nextGeneration has cyclomatic complexity 34 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 32, cognitive 65) experiments/runs/2026-05-26_07-28-08_claim-office-example-mapping_v5.1-testlist-scope-fix-oc_mistral-medium-3-5-2/src/cli.ts:12— (anonymous) has cyclomatic complexity 32 and cognitive complexity 65; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 31, cognitive 65) experiments/runs/2026-05-26_07-28-08_claim-office-example-mapping_v5.1-testlist-scope-fix-oc_mistral-medium-3-5/src/cli.ts:36— (anonymous) has cyclomatic complexity 31 and cognitive complexity 65; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function processScenario (cyclomatic 30, cognitive 68) experiments/runs/2026-05-22_08-52-17_claim-office-example-mapping_v4.1-testlist-scope-fix_opus-4-7-portkey-no-thinking/src/claim-office.ts:30— processScenario has cyclomatic complexity 30 and cognitive complexity 68; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 29, cognitive 76) experiments/runs/2026-07-25_03-40-48_claim-office-example-mapping_v6.2-with-why-cleaned-pi_deepseek-v4-pro-no-thinking/src/claim-office.ts:52— (anonymous) has cyclomatic complexity 29 and cognitive complexity 76; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 29, cognitive 50) experiments/runs/2026-05-15_07-33-51_claim-office-example-mapping_v5-exact-single-context_opus-4-7-no-thinking/src/claim-office.ts:65— (anonymous) has cyclomatic complexity 29 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function tryParseExportStatement (cyclomatic 28, cognitive 41) experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/lexer.js:334— tryParseExportStatement has cyclomatic complexity 28 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 26, cognitive 65) experiments/runs/2026-07-25_03-22-18_claim-office-example-mapping_v6.2-with-why-cleaned-pi_deepseek-v4-pro/src/claim-office.ts:65— (anonymous) has cyclomatic complexity 26 and cognitive complexity 65; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 26, cognitive 59) experiments/runs/2026-05-16_22-34-24_claim-office-example-mapping_v7-hybrid-green-refactor_opus-4-7-no-thinking/src/claim-office.ts:38— (anonymous) has cyclomatic complexity 26 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function processScenario (cyclomatic 26, cognitive 57) experiments/runs/2026-05-26_06-48-59_claim-office-example-mapping_v5.1-testlist-scope-fix-oc_mistral-medium-3-5/src/claim-office.ts:93— processScenario has cyclomatic complexity 26 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function claimOffice (cyclomatic 24, cognitive 58) experiments/runs/2026-05-21_15-29-15_claim-office-example-mapping_v4.1-testlist-scope-fix_opus-4-6-portkey-no-thinking-2/src/claim-office.ts:35— claimOffice has cyclomatic complexity 24 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 24, cognitive 57) experiments/runs/2026-07-25_03-18-36_claim-office-example-mapping_v6.2-with-why-cleaned-pi_deepseek-v4-pro-no-thinking/src/claim-office.ts:110— (anonymous) has cyclomatic complexity 24 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 24, cognitive 50) experiments/runs/2026-05-11_23-37-46_claim-office-example-mapping_v5-exact-single-context_opus-4-6-portkey-no-thinking/src/claim-office.ts:52— (anonymous) has cyclomatic complexity 24 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity· Complex function main (cyclomatic 23, cognitive 48) · ×1
Complex function main (cyclomatic 23, cognitive 48) experiments/runs/2026-05-09_09-02-47_claim-office-example-mapping_v3-basic-tdd_haiku-4-5/src/cli.ts:43— main has cyclomatic complexity 23 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function processClaim (cyclomatic 22, cognitive 31) experiments/runs/2026-05-16_09-56-09_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking/src/claim.ts:49— processClaim has cyclomatic complexity 22 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function processClaim (cyclomatic 22, cognitive 27) experiments/runs/2026-05-25_09-28-06_claim-office-example-mapping_v5.1-testlist-scope-fix-oc_kimi-k2-6/src/engine.ts:180— processClaim has cyclomatic complexity 22 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function tryParseImportStatement (cyclomatic 22, cognitive 27) experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/lexer.js:246— tryParseImportStatement has cyclomatic complexity 22 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function computeClaim (cyclomatic 22, cognitive 26) experiments/runs/2026-10-20_04-41-17_claim-office-example-mapping_exact-subagents-v1-cc_opus-4-6-requesty-no-thinking/src/claim-office.ts:114— computeClaim has cyclomatic complexity 22 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function isExpressionKeyword (cyclomatic 22, cognitive 16) experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/lexer.js:878— isExpressionKeyword has cyclomatic complexity 22 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity· Complex function run (cyclomatic 21, cognitive 56) · ×1
Complex function run (cyclomatic 21, cognitive 56) experiments/runs/2026-10-19_06-21-05_claim-office-example-mapping_exact-single-context-v2-testlist-fix-oc_deepseek-v4-pro-requesty/src/cli.ts:75— run has cyclomatic complexity 21 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function extglobClose (cyclomatic 21, cognitive 25) experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/lib/parse.js:539— extglobClose has cyclomatic complexity 21 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function readEscapedChar (cyclomatic 21, cognitive 15) experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/lexer.js:526— readEscapedChar has cyclomatic complexity 21 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function runScenario (cyclomatic 20, cognitive 54) experiments/runs/2026-09-24_04-50-54_claim-office-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex-5/src/office.ts:10— runScenario has cyclomatic complexity 20 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function _encodeGeneratedRanges (cyclomatic 20, cognitive 28) experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/src/scopes.ts:243— _encodeGeneratedRanges has cyclomatic complexity 20 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function processClaim (cyclomatic 20, cognitive 27) experiments/runs/2026-05-25_09-15-01_claim-office-example-mapping_v5.1-testlist-scope-fix-oc_gemini-3-5-flash/src/claim-office.ts:125— processClaim has cyclomatic complexity 20 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity· Complex function main (cyclomatic 19, cognitive 46) · ×1
Complex function main (cyclomatic 19, cognitive 46) experiments/runs/2026-05-19_00-48-02_claim-office-example-mapping_v4-exact-subagents_opus-4-6-portkey-no-thinking-2/src/cli.ts:51— main has cyclomatic complexity 19 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function processScenario (cyclomatic 19, cognitive 44) experiments/runs/2026-05-21_10-56-34_claim-office-example-mapping_v3-basic-tdd_opus-4-6-portkey-no-thinking/src/claim-office.ts:177— processScenario has cyclomatic complexity 19 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function parseRepeatedExtglob (cyclomatic 19, cognitive 34) experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/lib/parse.js:164— parseRepeatedExtglob has cyclomatic complexity 19 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 19, cognitive 31) experiments/runs/2026-08-16_21-17-00_claim-office-example-mapping_v3-basic-tdd-pi_gpt-5-6-sol-codex-2/src/claim-office.ts:103— (anonymous) has cyclomatic complexity 19 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function handleClaim (cyclomatic 19, cognitive 25) experiments/runs/2026-05-25_16-40-46_claim-office-example-mapping_v5.1-testlist-scope-fix-oc_gemini-3-5-flash/src/claim-office.ts:131— handleClaim has cyclomatic complexity 19 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function nextGeneration (cyclomatic 19, cognitive 25) experiments/runs/2026-07-25_12-20-43_game-of-life-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/src/game-of-life.ts:24— nextGeneration has cyclomatic complexity 19 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R3 · Large Files· experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/lib/parse.js · ×1
experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/lib/parse.js: 1140 lines of code experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/lib/parse.js:1— experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/lib/parse.js has 1140 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/lexer.js · ×1
experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/lexer.js: 932 lines of code experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/lexer.js:1— experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/lexer.js has 932 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· experiments/runs/2026-10-19_00-53-39_claim-office-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking-2/src/claim-office.ts · ×1
experiments/runs/2026-10-19_00-53-39_claim-office-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking-2/src/claim-office.ts: 496 lines of code experiments/runs/2026-10-19_00-53-39_claim-office-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking-2/src/claim-office.ts:1— experiments/runs/2026-10-19_00-53-39_claim-office-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking-2/src/claim-office.ts has 496 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· experiments/runs/2026-08-11_01-07-01_claim-office-example-mapping_v6.6-lab-split-cc_opus-5-no-thinking/src/claim-office.ts · ×1
experiments/runs/2026-08-11_01-07-01_claim-office-example-mapping_v6.6-lab-split-cc_opus-5-no-thinking/src/claim-office.ts: 489 lines of code experiments/runs/2026-08-11_01-07-01_claim-office-example-mapping_v6.6-lab-split-cc_opus-5-no-thinking/src/claim-office.ts:1— experiments/runs/2026-08-11_01-07-01_claim-office-example-mapping_v6.6-lab-split-cc_opus-5-no-thinking/src/claim-office.ts has 489 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· experiments/runs/2026-08-10_18-13-18_claim-office-example-mapping_v6.6-lab-split-cc_opus-5-no-thinking/src/claim-office.ts · ×1
experiments/runs/2026-08-10_18-13-18_claim-office-example-mapping_v6.6-lab-split-cc_opus-5-no-thinking/src/claim-office.ts: 451 lines of code experiments/runs/2026-08-10_18-13-18_claim-office-example-mapping_v6.6-lab-split-cc_opus-5-no-thinking/src/claim-office.ts:1— experiments/runs/2026-08-10_18-13-18_claim-office-example-mapping_v6.6-lab-split-cc_opus-5-no-thinking/src/claim-office.ts has 451 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· experiments/runs/2026-09-04_14-03-39_claim-office-example-mapping_v6.1.4-continuation-guard-cc_opus-5-no-thinking/src/claim-office.ts · ×1
experiments/runs/2026-09-04_14-03-39_claim-office-example-mapping_v6.1.4-continuation-guard-cc_opus-5-no-thinking/src/claim-office.ts: 449 lines of code experiments/runs/2026-09-04_14-03-39_claim-office-example-mapping_v6.1.4-continuation-guard-cc_opus-5-no-thinking/src/claim-office.ts:1— experiments/runs/2026-09-04_14-03-39_claim-office-example-mapping_v6.1.4-continuation-guard-cc_opus-5-no-thinking/src/claim-office.ts has 449 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· experiments/runs/2026-09-03_23-16-54_claim-office-example-mapping_v6.1.1-lab-split-cc_opus-5-no-thinking/src/claim-office.ts · ×1
experiments/runs/2026-09-03_23-16-54_claim-office-example-mapping_v6.1.1-lab-split-cc_opus-5-no-thinking/src/claim-office.ts: 448 lines of code experiments/runs/2026-09-03_23-16-54_claim-office-example-mapping_v6.1.1-lab-split-cc_opus-5-no-thinking/src/claim-office.ts:1— experiments/runs/2026-09-03_23-16-54_claim-office-example-mapping_v6.1.1-lab-split-cc_opus-5-no-thinking/src/claim-office.ts has 448 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· experiments/runs/2026-09-12_23-52-37_claim-office-example-mapping_exact-hybrid-v2.9-stack-profile-cc_opus-5-no-thinking/src/claim-office.ts · ×1
experiments/runs/2026-09-12_23-52-37_claim-office-example-mapping_exact-hybrid-v2.9-stack-profile-cc_opus-5-no-thinking/src/claim-office.ts: 444 lines of code experiments/runs/2026-09-12_23-52-37_claim-office-example-mapping_exact-hybrid-v2.9-stack-profile-cc_opus-5-no-thinking/src/claim-office.ts:1— experiments/runs/2026-09-12_23-52-37_claim-office-example-mapping_exact-hybrid-v2.9-stack-profile-cc_opus-5-no-thinking/src/claim-office.ts has 444 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· experiments/runs/2026-09-17_00-24-43_claim-office-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking-4/src/claim-office.ts · ×1
experiments/runs/2026-09-17_00-24-43_claim-office-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking-4/src/claim-office.ts: 438 lines of code experiments/runs/2026-09-17_00-24-43_claim-office-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking-4/src/claim-office.ts:1— experiments/runs/2026-09-17_00-24-43_claim-office-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-no-thinking-4/src/claim-office.ts has 438 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· experiments/runs/2026-08-17_07-30-11_claim-office-example-mapping_v6.2-with-why-cleaned_opus-5-no-thinking/src/claim-office.ts · ×1
experiments/runs/2026-08-17_07-30-11_claim-office-example-mapping_v6.2-with-why-cleaned_opus-5-no-thinking/src/claim-office.ts: 430 lines of code experiments/runs/2026-08-17_07-30-11_claim-office-example-mapping_v6.2-with-why-cleaned_opus-5-no-thinking/src/claim-office.ts:1— experiments/runs/2026-08-17_07-30-11_claim-office-example-mapping_v6.2-with-why-cleaned_opus-5-no-thinking/src/claim-office.ts has 430 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· experiments/runs/2026-08-17_08-46-28_claim-office-example-mapping_v6.2-with-why-cleaned_opus-5-no-thinking/src/claim-office.ts · ×1
experiments/runs/2026-08-17_08-46-28_claim-office-example-mapping_v6.2-with-why-cleaned_opus-5-no-thinking/src/claim-office.ts: 425 lines of code experiments/runs/2026-08-17_08-46-28_claim-office-example-mapping_v6.2-with-why-cleaned_opus-5-no-thinking/src/claim-office.ts:1— experiments/runs/2026-08-17_08-46-28_claim-office-example-mapping_v6.2-with-why-cleaned_opus-5-no-thinking/src/claim-office.ts has 425 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· experiments/runs/2026-09-05_09-40-45_claim-office-example-mapping_v6.1.5-pure-split-cc_opus-5-no-thinking/src/claim-office.ts · ×1
experiments/runs/2026-09-05_09-40-45_claim-office-example-mapping_v6.1.5-pure-split-cc_opus-5-no-thinking/src/claim-office.ts: 425 lines of code experiments/runs/2026-09-05_09-40-45_claim-office-example-mapping_v6.1.5-pure-split-cc_opus-5-no-thinking/src/claim-office.ts:1— experiments/runs/2026-09-05_09-40-45_claim-office-example-mapping_v6.1.5-pure-split-cc_opus-5-no-thinking/src/claim-office.ts has 425 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· experiments/runs/2026-08-11_01-43-28_claim-office-example-mapping_v6.6-lab-split-cc_opus-5-no-thinking/src/claim-office.ts · ×1
experiments/runs/2026-08-11_01-43-28_claim-office-example-mapping_v6.6-lab-split-cc_opus-5-no-thinking/src/claim-office.ts: 404 lines of code experiments/runs/2026-08-11_01-43-28_claim-office-example-mapping_v6.6-lab-split-cc_opus-5-no-thinking/src/claim-office.ts:1— experiments/runs/2026-08-11_01-43-28_claim-office-example-mapping_v6.6-lab-split-cc_opus-5-no-thinking/src/claim-office.ts has 404 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R6 · Tooling· The declared test suite includes a file that cannot be loaded · ×1
The declared test suite includes a file that cannot be loaded experiments/runs/2026-05-12_04-33-35_claim-office-prose_v5-exact-single-context_haiku-4-5-portkey/src/claim-office.spec.ts:2— This repository declares test tooling, and the ✓ above records that declaration — but experiments/runs/2026-05-12_04-33-35_claim-office-prose_v5-exact-single-context_haiku-4-5-portkey/src/claim-office.spec.ts and 19 other test file(s) in this workspace cannot be loaded at all: it imports a module that names no file in this repository, so the runner throws while collecting it and none of its cases execute. The wiring is present and the suite it points at does not run as written, which is why the tooling tick must not be read as a statement that the tests pass. Fix the unloadable file(s) — each one is reported with its failing import under Test Coverage — then the declared script exercises what it claims to.
Unlisted import 'lightningcss' experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/types/internal/lightningcssOptions.d.ts:4— Imported only as a TYPE and declared in no reachable package.json. The import is erased at compile time, so nothing is installed and no runtime resolution depends on it — but type-checking a clean clone will fail. Declare the typings it resolves through (or the package itself) in the owning package.json.
Unused dependency 'pathe' experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package.json:21— Declared in experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
Unused dependency 'std-env' experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package.json:22— Declared in experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
Unused dependency 'tinyrainbow' experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package.json:23— Declared in experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
Unused dependency '@eslint/js' experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/package.json:52— Declared in experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
Unused dependency '@web/dev-server-rollup' experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/package.json:54— Declared in experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
Unused dependency '@web/test-runner' experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/package.json:55— Declared in experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
Unused dependency '@web/test-runner-playwright' experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/package.json:56— Declared in experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
Unused dependency 'globals' experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/package.json:64— Declared in experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/package/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
redundant comment experiments/runs/2026-05-08_15-43-45_claim-office-example-mapping_v5-exact-single-context_opus-4-7-no-thinking/src/claim-office.spec.ts:5— "Empty / processing fee" repeats the code it sits on: 3 of its 3 words (empty, processing, fee) are already in `it("empty item list yields premium of 5 G (processing fee only)", () =>`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment experiments/runs/2026-05-08_15-54-26_claim-office-example-mapping_v5-exact-single-context_opus-4-7-no-thinking/src/claim-office.spec.ts:5— "Empty / processing fee" repeats the code it sits on: 3 of its 3 words (empty, processing, fee) are already in `it("empty item list yields premium of 5 G (processing fee only)", () =>`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment experiments/runs/2026-05-08_15-54-26_claim-office-example-mapping_v5-exact-single-context_opus-4-7-no-thinking/src/claim-office.spec.ts:229— "Unknown item type" repeats the code it sits on: 3 of its 3 words (unknown, item, type) are already in `it("quote with unknown item type causes runScenario to throw", () =>`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment experiments/runs/2026-05-08_15-54-26_claim-office-example-mapping_v5-exact-single-context_opus-4-7-no-thinking/src/claim-office.spec.ts:419— "Claim payout rounding" repeats the code it sits on: 3 of its 3 words (claim, payout, rounding) are already in `it("claim payout with fractional value rounds DOWN to whole G in MHPCO favor", () =>`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment experiments/runs/2026-05-09_09-02-47_claim-office-example-mapping_v3-basic-tdd_haiku-4-5/src/cli.ts:45— "Read input from stdin" repeats the code it sits on: 3 of its 3 words (read, input, stdin) are already in `const input = await readStdin();`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment experiments/runs/2026-05-09_09-02-47_claim-office-example-mapping_v3-basic-tdd_haiku-4-5/src/engine.ts:228— "Cap the total payout" repeats the code it sits on: 3 of its 3 words (cap, total, payout) are already in `const cappedPayout = Math.min(totalPayout, policy.remainingCap);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment experiments/runs/2026-05-09_09-08-31_claim-office-example-mapping_v3-basic-tdd_haiku-4-5/src/core.ts:80— "Calculate base premium for items" repeats the code it sits on: 4 of its 4 words (calculate, base, premium, items) are already in `const basePremium = calculateBasePremium(items);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment experiments/runs/2026-05-09_14-02-30_claim-office-example-mapping_v3-basic-tdd_haiku-4-5-no-thinking/src/pricing.ts:144— "Calculate base premium for all items" repeats the code it sits on: 4 of its 4 words (calculate, base, premium, items) are already in `const basePremium = calculateBasePremium(items);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment experiments/runs/2026-05-09_14-24-02_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking/src/claim-office.ts:107— "Base premium for components" repeats the code it sits on: 3 of its 3 words (base, premium, components) are already in `policyBase += computeComponentsPremium(components);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment experiments/runs/2026-05-09_17-39-40_claim-office-example-mapping_v4-exact-subagents_haiku-4-5-no-thinking/src/mhpco.spec.ts:139— "Dragon material: 100% reimbursement" repeats the code it sits on: 4 of its 4 words (dragon, material, 100, reimbursement) are already in `it.todo("should apply 100% reimbursement for dragon material");`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment experiments/runs/2026-05-10_11-41-24_claim-office-example-mapping_v4-exact-subagents_opus-4-7/src/claim-office.spec.ts:135— "Claim: basic deductible" repeats the code it sits on: 3 of its 3 words (claim, basic, deductible) are already in `it("should subtract 100 G deductible per damaged item from a basic claim", () =>`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment experiments/runs/2026-05-10_14-27-28_claim-office-example-mapping_v4-exact-subagents_opus-4-7-no-thinking/src/claim-office.spec.ts:5— "Empty / processing fee" repeats the code it sits on: 3 of its 3 words (empty, processing, fee) are already in `it("empty item list yields premium of 5 G (processing fee only)", () =>`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment experiments/runs/2026-05-10_15-33-36_claim-office-example-mapping_v4-exact-subagents_opus-4-7-no-thinking/src/claim-office.spec.ts:187— "Claim: dragon material" repeats the code it sits on: 3 of its 3 words (claim, dragon, material) are already in `it("claim on dragon-material sword enchantment 5 with damage 800 returns payout 700 (full reimbursement, then 100 deduct …`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment experiments/runs/2026-05-12_03-53-21_claim-office-user-story_v5-exact-single-context_haiku-4-5-portkey/src/claim-office.ts:86— "Find the item for this damage" repeats the code it sits on: 3 of its 3 words (find, item, damage) are already in `const item = items.find(i => i.type === damage.itemType);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment experiments/runs/2026-05-12_03-53-21_claim-office-user-story_v5-exact-single-context_haiku-4-5-portkey/src/claim-office.ts:106— "Cap at 2x insurance sum" repeats the code it sits on: 3 of its 3 words (cap, insurance, sum) are already in `const cap = insuranceSum * 2;`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment experiments/runs/2026-05-12_06-23-47_claim-office-user-story_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/claim-office.spec.ts:17— "Surcharges: cursed items" repeats the code it sits on: 3 of its 3 words (surcharges, cursed, items) are already in `it.todo("should add 50% surcharge for cursed main items");`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment experiments/runs/2026-05-12_06-23-47_claim-office-user-story_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/claim-office.spec.ts:20— "Surcharges: enchanted items" repeats the code it sits on: 3 of its 3 words (surcharges, enchanted, items) are already in `it.todo("should add 30% surcharge for highly enchanted items (level >= 5)");`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment experiments/runs/2026-05-12_06-23-47_claim-office-user-story_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/claim-office.spec.ts:23— "Discounts: customer loyalty" repeats the code it sits on: 3 of its 3 words (discounts, customer, loyalty) are already in `it.todo("should apply 20% loyalty discount for long-standing customers (>= 2 years)");`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment experiments/runs/2026-05-12_07-44-08_claim-office-example-mapping_v5-exact-single-context_opus-4-6-portkey-no-thinking/src/claim-office.spec.ts:315— "Quote: integration — newcomer with cursed sword" repeats the code it sits on: 4 of its 5 words (integration, newcomer, cursed, sword) are already in `it("should return 165G for newcomer with cursed sword (integration example 1)", () =>`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment experiments/runs/2026-05-12_07-44-08_claim-office-example-mapping_v5-exact-single-context_opus-4-6-portkey-no-thinking/src/claim-office.spec.ts:332— "Quote: integration — long-standing customer second contract" repeats the code it sits on: 6 of its 7 words (integration, long, standing, customer, second, contract) are already in `it("should return 160G for long-standing customer second contract with cursed+enchanted sword (integration example 2)", …`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment experiments/runs/2026-05-12_07-44-08_claim-office-example-mapping_v5-exact-single-context_opus-4-6-portkey-no-thinking/src/claim-office.spec.ts:634— "Claim: error — more damages than insured items" repeats the code it sits on: 4 of its 5 words (error, damages, insured, items) are already in `it("should throw error when damages exceed insured item count for a type", () =>`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment experiments/runs/2026-05-12_07-44-08_claim-office-example-mapping_v5-exact-single-context_opus-4-6-portkey-no-thinking/src/claim-office.spec.ts:685— "Quote: error — unknown item type" repeats the code it sits on: 5 of its 5 words (quote, error, unknown, item, type) are already in `it("should throw error for unknown item type in quote", () =>`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment experiments/runs/2026-05-12_07-51-23_claim-office-prose_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/mhpco.spec.ts:49— "Multiple claims on same policy" repeats the code it sits on: 3 of its 3 words (multiple, claims, policy) are already in `it.todo("should process multiple claims on same policy sequentially");`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment experiments/runs/2026-05-12_08-36-07_claim-office-example-mapping_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/mhpco.ts:75— "Calculate insurance sum from policy items" repeats the code it sits on: 4 of its 5 words (insurance, sum, policy, items) are already in `const insuranceSum = sumItemValues(policy.items || [], getItemInsuranceValue);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment experiments/runs/2026-05-12_09-36-31_claim-office-user-story_v5-exact-single-context_haiku-4-5-portkey/src/claim-office.spec.ts:42— "Claims Processing - Multiple Damages" repeats the code it sits on: 4 of its 4 words (claims, processing, multiple, damages) are already in `it.todo("should process claim with multiple damage items");`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
Duplicated predicate experiments/runs/2026-09-20_06-35-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOffice.java:231— `!value.isIntegralNumber() || !value.canConvertToInt()` appears character-identically in 2 files — experiments/runs/2026-09-20_06-35-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOffice.java, experiments/runs/2026-09-20_06-35-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOffice.java. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate experiments/runs/2026-09-20_06-35-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOffice.java:184— `"rune".equals(type) || "moonstone".equals(type)` appears character-identically in 6 files — experiments/runs/2026-09-20_06-35-29_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOffice.java, experiments/runs/2026-09-20_06-41-39_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOfficeCli.java, experiments/runs/2026-09-20_06-41-41_claim-office-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOffice.java, experiments/runs/2026-09-20_07-18-54_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/PriceList.java. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate experiments/runs/2026-09-20_06-48-34_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/PriceList.java:29— `MAIN_ITEMS.containsKey(type) || isComponent(type)` appears character-identically in 2 files — experiments/runs/2026-09-20_06-48-34_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/PriceList.java, experiments/runs/2026-09-20_07-28-11_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/PriceList.java. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate experiments/runs/2026-09-20_07-18-13_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/Incident.java:33— `available == null || available.isEmpty()` appears character-identically in 2 files — experiments/runs/2026-09-20_07-18-13_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/Incident.java, experiments/runs/2026-09-20_07-18-54_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/Policy.java. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate experiments/runs/2026-09-20_07-18-13_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/Incident.java:47— `item.enchantment() != null && item.enchantment() >= HIGH_ENCHANTMENT` appears character-identically in 2 files — experiments/runs/2026-09-20_07-18-13_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/Incident.java, experiments/runs/2026-09-20_07-18-13_claim-office-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/Quote.java. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate experiments/runs/2026-09-20_06-39-36_game-of-life-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/GameOfLife.java:41— `liveNeighbors == 2 || liveNeighbors == 3` appears character-identically in 4 files — experiments/runs/2026-09-20_06-39-36_game-of-life-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/GameOfLife.java, experiments/runs/2026-09-20_08-53-33_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-2/src/main/java/LifeRules.java, experiments/runs/2026-09-20_08-53-34_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex-3/src/main/java/GameOfLifeRules.java, experiments/runs/2026-09-20_08-53-34_game-of-life-java-example-mapping_exact-ptdd-v1.1-refactor-subagent-pi_gpt-5-6-sol-codex/src/main/java/CellFate.java. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate experiments/runs/2026-09-20_06-56-38_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/gol/GameOfLife.java:26— `liveNeighbours == 3 || (liveNeighbours == 2 && aliveCells.contains(cell))` appears character-identically in 2 files — experiments/runs/2026-09-20_06-56-38_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/gol/GameOfLife.java, experiments/runs/2026-09-20_06-59-41_game-of-life-java-example-mapping_baseline-inline-tdd-v1-cc_opus-5-no-thinking/src/main/java/gameoflife/GameOfLife.java. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate experiments/runs/2026-09-20_06-58-06_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLife.java:30— `livingNeighbours == 2 || livingNeighbours == 3` appears character-identically in 8 files — experiments/runs/2026-09-20_06-58-06_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLife.java, experiments/runs/2026-09-20_06-58-08_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLife.java, experiments/runs/2026-09-20_06-59-43_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLife.java, experiments/runs/2026-09-20_07-01-23_game-of-life-java-example-mapping_exact-ptdd-v1-cc_opus-5-no-thinking/src/main/java/GameOfLife.java. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate experiments/runs/2026-09-20_06-35-28_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOfficeCli.java:196— `matching == null || occurrence >= matching.size()` appears character-identically in 2 files — experiments/runs/2026-09-20_06-35-28_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex-2/src/main/java/ClaimOfficeCli.java, experiments/runs/2026-09-20_06-35-28_claim-office-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/ClaimOffice.java. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate experiments/runs/2026-09-20_06-39-36_game-of-life-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLife.java:37— `neighborCount >= 2 && neighborCount <= 3` appears character-identically in 2 files — experiments/runs/2026-09-20_06-39-36_game-of-life-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLife.java, experiments/runs/2026-09-20_06-39-44_game-of-life-java-example-mapping_exact-ptdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLife.java. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate experiments/runs/2026-09-20_06-28-51_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLife.java:44— `x >= Integer.MIN_VALUE && x <= Integer.MAX_VALUE && y >= Integer.MIN_VALUE && y <= Integer.MAX_VALUE` appears character-identically in 3 files — experiments/runs/2026-09-20_06-28-51_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLife.java, experiments/runs/2026-09-20_06-35-28_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLife.java, experiments/runs/2026-09-20_06-35-29_game-of-life-java-example-mapping_baseline-inline-tdd-v1-pi_gpt-5-6-sol-codex/src/main/java/GameOfLife.java. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate experiments/runs/2026-05-12_07-48-29_claim-office-example-mapping_v5-exact-single-context_opus-4-6-portkey/src/claim-office.ts:70— `!(item.type in BASE_PREMIUMS) && !COMPONENT_TYPES.has(item.type)` appears character-identically in 2 files — experiments/runs/2026-05-12_07-48-29_claim-office-example-mapping_v5-exact-single-context_opus-4-6-portkey/src/claim-office.ts, experiments/runs/2026-05-19_17-10-58_claim-office-example-mapping_v6-hybrid_opus-4-6-portkey-no-thinking-5/src/claim-office.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate experiments/runs/2026-09-24_04-50-54_claim-office-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex-2/src/office.ts:44— `!Number.isFinite(damage.amount) || damage.amount < 0` appears character-identically in 7 files — experiments/runs/2026-09-24_04-50-54_claim-office-example-mapping_baseline-inline-tdd-v1-pi_gpt-6-sol-codex-2/src/office.ts, experiments/runs/2026-10-01_03-07-32_claim-office-example-mapping_baseline-inline-tdd-v1.1-local-git-cc_opus-5-5-no-thinking/src/claim.ts, experiments/runs/2026-10-01_03-40-37_claim-office-example-mapping_baseline-inline-tdd-v1.1-local-git-cc_opus-5-5-no-thinking/src/policy.ts, experiments/runs/2026-10-01_07-23-14_claim-office-example-mapping_baseline-inline-tdd-v1.1-local-git-cc_opus-5-5-no-thinking-2/src/claim.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate experiments/runs/2026-07-25_04-54-56_claim-office-example-mapping_v6.2-with-why-cleaned-pi_gpt-5-6-terra/src/claim-office.ts:56— `!Number.isInteger(damage.amount) || damage.amount < 0` appears character-identically in 19 files — experiments/runs/2026-07-25_04-54-56_claim-office-example-mapping_v6.2-with-why-cleaned-pi_gpt-5-6-terra/src/claim-office.ts, experiments/runs/2026-08-10_06-39-55_claim-office-example-mapping_v4.1-testlist-scope-fix-pi_gpt-5-6-sol/src/claim-office.ts, experiments/runs/2026-08-10_09-45-55_claim-office-example-mapping_v3-basic-tdd-pi_gpt-5-6-sol/src/claim-office.ts, experiments/runs/2026-08-10_09-46-02_claim-office-example-mapping_v3-basic-tdd-pi_gpt-5-6-sol/src/claim-office.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate experiments/runs/2026-07-24_00-28-34_claim-office-prose_v6.2-with-why-cleaned-pi_opus-4-7-portkey-no-thinking/.pi/extensions/subagent/index.ts:746— `!details || details.results.length === 0` appears character-identically in 328 files — experiments/runs/2026-07-24_00-28-34_claim-office-prose_v6.2-with-why-cleaned-pi_opus-4-7-portkey-no-thinking/.pi/extensions/subagent/index.ts, experiments/runs/2026-07-24_00-39-23_claim-office-prose_v6.2-with-why-cleaned-pi_opus-4-7-portkey-no-thinking/.pi/extensions/subagent/index.ts, experiments/runs/2026-07-24_15-24-24_claim-office-example-mapping_v6.2-with-why-cleaned-pi_opus-4-8-2/.pi/extensions/subagent/index.ts, experiments/runs/2026-07-24_15-24-24_claim-office-example-mapping_v6.2-with-why-cleaned-pi_opus-4-8-3/.pi/extensions/subagent/index.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate experiments/runs/2026-07-24_00-28-34_claim-office-prose_v6.2-with-why-cleaned-pi_opus-4-7-portkey-no-thinking/.pi/extensions/subagent/agents.ts:42— `!entry.isFile() && !entry.isSymbolicLink()` appears character-identically in 328 files — experiments/runs/2026-07-24_00-28-34_claim-office-prose_v6.2-with-why-cleaned-pi_opus-4-7-portkey-no-thinking/.pi/extensions/subagent/agents.ts, experiments/runs/2026-07-24_00-39-23_claim-office-prose_v6.2-with-why-cleaned-pi_opus-4-7-portkey-no-thinking/.pi/extensions/subagent/agents.ts, experiments/runs/2026-07-24_15-24-24_claim-office-example-mapping_v6.2-with-why-cleaned-pi_opus-4-8-2/.pi/extensions/subagent/agents.ts, experiments/runs/2026-07-24_15-24-24_claim-office-example-mapping_v6.2-with-why-cleaned-pi_opus-4-8-3/.pi/extensions/subagent/agents.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate experiments/runs/2026-07-24_19-26-36_claim-office-example-mapping_v6.2-with-why-cleaned-pi_kimi-k2-7-no-thinking/src/claim-office.ts:138— `!entry.used && entry.item.type === damage.itemType` appears character-identically in 3 files — experiments/runs/2026-07-24_19-26-36_claim-office-example-mapping_v6.2-with-why-cleaned-pi_kimi-k2-7-no-thinking/src/claim-office.ts, experiments/runs/2026-09-14_14-13-56_claim-office-example-mapping_external-tcr-kentbeck-2026-09-14-pi_gpt-5-6-sol-codex/src/claim-office.ts, experiments/runs/2026-09-14_14-21-35_claim-office-example-mapping_external-tcr-kentbeck-2026-09-14-pi_gpt-5-6-sol-codex/src/claim-office.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate experiments/runs/2026-07-24_00-28-34_claim-office-prose_v6.2-with-why-cleaned-pi_opus-4-7-portkey-no-thinking/.pi/extensions/subagent/agents.ts:54— `!frontmatter.name || !frontmatter.description` appears character-identically in 328 files — experiments/runs/2026-07-24_00-28-34_claim-office-prose_v6.2-with-why-cleaned-pi_opus-4-7-portkey-no-thinking/.pi/extensions/subagent/agents.ts, experiments/runs/2026-07-24_00-39-23_claim-office-prose_v6.2-with-why-cleaned-pi_opus-4-7-portkey-no-thinking/.pi/extensions/subagent/agents.ts, experiments/runs/2026-07-24_15-24-24_claim-office-example-mapping_v6.2-with-why-cleaned-pi_opus-4-8-2/.pi/extensions/subagent/agents.ts, experiments/runs/2026-07-24_15-24-24_claim-office-example-mapping_v6.2-with-why-cleaned-pi_opus-4-8-3/.pi/extensions/subagent/agents.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate experiments/runs/2026-05-16_21-39-21_game-of-life-example-mapping_v7-hybrid-green-refactor_opus-4-7-no-thinking/src/game-of-life.ts:29— `!isAlive(cell) && liveNeighborCount(cell) === 3` appears character-identically in 2 files — experiments/runs/2026-05-16_21-39-21_game-of-life-example-mapping_v7-hybrid-green-refactor_opus-4-7-no-thinking/src/game-of-life.ts, experiments/runs/2026-05-25_07-01-23_game-of-life-example-mapping_v6.2-with-why-cleaned_opus-4-7-portkey-no-thinking/src/game-of-life.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate experiments/runs/2026-05-19_17-10-58_claim-office-example-mapping_v6-hybrid_opus-4-6-portkey-no-thinking-7/src/claim-office.ts:23— `!isComponent(item) && !(item.type in BASE_PREMIUMS)` appears character-identically in 2 files — experiments/runs/2026-05-19_17-10-58_claim-office-example-mapping_v6-hybrid_opus-4-6-portkey-no-thinking-7/src/claim-office.ts, experiments/runs/2026-10-23_07-26-09_claim-office-example-mapping_exact-ptdd-v1-pi_qwen3-8-flash-next-4/src/scenario.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate experiments/runs/2026-05-25_18-36-34_claim-office-example-mapping_v8a-delayed-refactor-agent_opus-4-7-portkey-no-thinking/src/claim-office.ts:85— `!isMainItem(item.type) && !isComponent(item.type)` appears character-identically in 2 files — experiments/runs/2026-05-25_18-36-34_claim-office-example-mapping_v8a-delayed-refactor-agent_opus-4-7-portkey-no-thinking/src/claim-office.ts, experiments/runs/2026-08-17_06-39-23_claim-office-example-mapping_v3-basic-tdd_opus-4-8-no-thinking-5/src/premium.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate experiments/runs/2026-08-16_21-17-00_claim-office-example-mapping_v3-basic-tdd-pi_gpt-5-6-sol-codex-3/src/claim-office.ts:179— `!isObject(input) || !isObject(input.customer) || !Array.isArray(input.steps)` appears character-identically in 4 files — experiments/runs/2026-08-16_21-17-00_claim-office-example-mapping_v3-basic-tdd-pi_gpt-5-6-sol-codex-3/src/claim-office.ts, experiments/runs/_archive/2026-09-23_06-40-48_claim-office-example-mapping_baseline-inline-tdd-v1.1-local-git-cc_opus-5-5-no-thinking/src/scenario.ts, experiments/runs/_archive/2026-09-23_06-43-20_claim-office-example-mapping_baseline-inline-tdd-v1.1-local-git-cc_opus-5-5-no-thinking/src/scenario.ts, experiments/runs/_archive/2026-09-23_06-45-41_claim-office-example-mapping_baseline-inline-tdd-v1.1-local-git-cc_opus-5-5-no-thinking/src/scenario.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate experiments/runs/2026-08-16_21-17-00_claim-office-example-mapping_v3-basic-tdd-pi_gpt-5-6-sol-codex-3/src/claim-office.ts:60— `!isObject(value) || typeof value.type !== 'string'` appears character-identically in 2 files — experiments/runs/2026-08-16_21-17-00_claim-office-example-mapping_v3-basic-tdd-pi_gpt-5-6-sol-codex-3/src/claim-office.ts, experiments/runs/2026-09-14_14-20-11_claim-office-example-mapping_external-tcr-kentbeck-2026-09-14-pi_gpt-5-6-sol-codex/src/claim-office.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate experiments/runs/2026-05-26_10-32-44_claim-office-example-mapping_v5.1-testlist-scope-fix-oc_mistral-medium-3-5/src/claim-office.ts:131— `!policyStep || policyStep.op !== "quote"` appears character-identically in 3 files — experiments/runs/2026-05-26_10-32-44_claim-office-example-mapping_v5.1-testlist-scope-fix-oc_mistral-medium-3-5/src/claim-office.ts, experiments/runs/2026-07-25_09-45-21_claim-office-example-mapping_v6.2.1-phase-continuation-pi_qwen3-235b/src/claim-office.ts, experiments/runs/2026-07-25_19-51-19_claim-office-example-mapping_v6.2-with-why-cleaned-oc_opus-4-8-requesty/src/cli.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate experiments/runs/2026-05-03_17-23-33_game-of-life-user-story_v5-exact-single-context_opus-4-7-no-thinking/src/game-of-life.ts:8— `!sameCell(a, b) && Math.abs(a[0] - b[0]) <= 1 && Math.abs(a[1] - b[1]) <= 1` appears character-identically in 2 files — experiments/runs/2026-05-03_17-23-33_game-of-life-user-story_v5-exact-single-context_opus-4-7-no-thinking/src/game-of-life.ts, experiments/runs/2026-05-29_17-00-27_game-of-life-example-mapping_v4-exact-subagents_opus-4-8/src/game-of-life.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Silent fallback default in catch experiments/runs/2026-09-30_23-06-29_claim-office-example-mapping_external-kesseler-2026-09-30-cc_opus-5-5-no-thinking/tdd-reporter.mjs:89— `nextSeq` swallows every exception into `return 1` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch experiments/runs/2026-10-01_00-00-05_game-of-life-example-mapping_exact-hybrid-v2.4-lab-split-cc_opus-5-5-no-thinking/tdd-reporter.mjs:89— `nextSeq` swallows every exception into `return 1` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch experiments/runs/2026-10-01_00-00-05_game-of-life-example-mapping_exact-subagents-v1-cc_opus-5-5-no-thinking/tdd-reporter.mjs:89— `nextSeq` swallows every exception into `return 1` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch experiments/runs/2026-10-01_00-00-05_game-of-life-example-mapping_external-tcrdd-bsene-2026-09-14-cc_opus-5-5-no-thinking/tdd-reporter.mjs:89— `nextSeq` swallows every exception into `return 1` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch experiments/runs/2026-10-01_00-49-48_claim-office-example-mapping_exact-hybrid-v2-testlist-fix-cc_opus-5-5-no-thinking-2/tdd-reporter.mjs:98— `nextSeq` swallows every exception into `return 1` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch experiments/runs/2026-10-01_00-49-48_claim-office-example-mapping_exact-hybrid-v2-testlist-fix-cc_opus-5-5-no-thinking-3/tdd-reporter.mjs:98— `nextSeq` swallows every exception into `return 1` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch experiments/runs/2026-10-01_00-49-48_claim-office-example-mapping_exact-hybrid-v2-testlist-fix-cc_opus-5-5-no-thinking-4/tdd-reporter.mjs:98— `nextSeq` swallows every exception into `return 1` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch experiments/runs/2026-10-01_00-49-48_claim-office-example-mapping_exact-hybrid-v2-testlist-fix-cc_opus-5-5-no-thinking-5/tdd-reporter.mjs:98— `nextSeq` swallows every exception into `return 1` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch experiments/runs/2026-10-01_00-49-48_claim-office-example-mapping_exact-hybrid-v2-testlist-fix-cc_opus-5-5-no-thinking/tdd-reporter.mjs:98— `nextSeq` swallows every exception into `return 1` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch experiments/runs/2026-10-01_01-06-09_claim-office-example-mapping_exact-hybrid-v2.4-lab-split-cc_opus-5-5-no-thinking/tdd-reporter.mjs:98— `nextSeq` swallows every exception into `return 1` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch experiments/runs/2026-10-01_01-07-05_claim-office-example-mapping_exact-hybrid-v2.4-lab-split-cc_opus-5-5-no-thinking/tdd-reporter.mjs:98— `nextSeq` swallows every exception into `return 1` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch experiments/runs/2026-10-01_01-09-27_claim-office-example-mapping_exact-hybrid-v2.4-lab-split-cc_opus-5-5-no-thinking/tdd-reporter.mjs:98— `nextSeq` swallows every exception into `return 1` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch experiments/runs/2026-10-01_01-10-03_claim-office-example-mapping_exact-hybrid-v2.4-lab-split-cc_opus-5-5-no-thinking/tdd-reporter.mjs:98— `nextSeq` swallows every exception into `return 1` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch experiments/runs/2026-10-01_01-11-50_claim-office-example-mapping_exact-hybrid-v2.4-lab-split-cc_opus-5-5-no-thinking/tdd-reporter.mjs:98— `nextSeq` swallows every exception into `return 1` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch experiments/runs/2026-10-01_01-25-47_claim-office-example-mapping_external-superpowers-2026-09-04-cc_opus-5-5-no-thinking/tdd-reporter.mjs:98— `nextSeq` swallows every exception into `return 1` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch experiments/runs/2026-10-01_01-26-14_claim-office-example-mapping_external-superpowers-2026-09-04-cc_opus-5-5-no-thinking/tdd-reporter.mjs:98— `nextSeq` swallows every exception into `return 1` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch experiments/runs/2026-10-01_01-29-48_claim-office-example-mapping_external-superpowers-2026-09-04-cc_opus-5-5-no-thinking/tdd-reporter.mjs:98— `nextSeq` swallows every exception into `return 1` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch experiments/runs/2026-10-01_01-31-44_claim-office-example-mapping_external-superpowers-2026-09-04-cc_opus-5-5-no-thinking/tdd-reporter.mjs:98— `nextSeq` swallows every exception into `return 1` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch experiments/runs/2026-10-01_01-32-09_claim-office-example-mapping_external-pocock-2026-09-04-cc_opus-5-5-no-thinking/tdd-reporter.mjs:98— `nextSeq` swallows every exception into `return 1` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch experiments/runs/2026-10-01_01-33-11_claim-office-example-mapping_external-pocock-2026-09-04-cc_opus-5-5-no-thinking/tdd-reporter.mjs:98— `nextSeq` swallows every exception into `return 1` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch experiments/runs/2026-10-01_01-34-46_claim-office-example-mapping_external-superpowers-2026-09-04-cc_opus-5-5-no-thinking/tdd-reporter.mjs:98— `nextSeq` swallows every exception into `return 1` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch experiments/runs/2026-10-01_01-37-11_claim-office-example-mapping_external-kesseler-2026-09-30-cc_opus-5-5-no-thinking/tdd-reporter.mjs:98— `nextSeq` swallows every exception into `return 1` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch experiments/runs/2026-10-01_01-37-28_claim-office-example-mapping_external-pocock-2026-09-04-cc_opus-5-5-no-thinking/tdd-reporter.mjs:98— `nextSeq` swallows every exception into `return 1` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch experiments/runs/2026-10-01_01-38-09_claim-office-example-mapping_external-pocock-2026-09-04-cc_opus-5-5-no-thinking/tdd-reporter.mjs:98— `nextSeq` swallows every exception into `return 1` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch experiments/runs/2026-10-01_01-38-10_claim-office-example-mapping_external-kesseler-2026-09-30-cc_opus-5-5-no-thinking/tdd-reporter.mjs:98— `nextSeq` swallows every exception into `return 1` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
No direct assertions: should return an empty grid for an empty grid — [] → [] experiments/runs/2026-08-10_16-37-38_game-of-life-example-mapping_v5.1-testlist-scope-fix_opus-5-no-thinking/src/game-of-life.spec.ts:14— No conventional assertion call was detected, and 9 of 9 tests in `experiments/runs/2026-08-10_16-37-38_game-of-life-example-mapping_v5.1-testlist-scope-fix_opus-5-no-thinking` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
No direct assertions: should kill a single lonely cell — [(0,0)] → [] experiments/runs/2026-08-10_16-37-38_game-of-life-example-mapping_v5.1-testlist-scope-fix_opus-5-no-thinking/src/game-of-life.spec.ts:17— No conventional assertion call was detected, and 9 of 9 tests in `experiments/runs/2026-08-10_16-37-38_game-of-life-example-mapping_v5.1-testlist-scope-fix_opus-5-no-thinking` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
No direct assertions: Rule 1 – Underpopulation: two adjacent cells each with 1 neighbor die — [(0,1), (1,1)] → [] experiments/runs/2026-08-10_16-37-38_game-of-life-example-mapping_v5.1-testlist-scope-fix_opus-5-no-thinking/src/game-of-life.spec.ts:20— No conventional assertion call was detected, and 9 of 9 tests in `experiments/runs/2026-08-10_16-37-38_game-of-life-example-mapping_v5.1-testlist-scope-fix_opus-5-no-thinking` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
No direct assertions: Rule 4 – Reproduction: dead cell (1,1) with exactly 3 live neighbors becomes alive — [(0,0), (1,0), (0,1)] → [(0,0), (1,0), (0,1), (1,1)] experiments/runs/2026-08-10_16-37-38_game-of-life-example-mapping_v5.1-testlist-scope-fix_opus-5-no-thinking/src/game-of-life.spec.ts:26— No conventional assertion call was detected, and 9 of 9 tests in `experiments/runs/2026-08-10_16-37-38_game-of-life-example-mapping_v5.1-testlist-scope-fix_opus-5-no-thinking` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
No direct assertions: Rule 2 – Survival: live cell (1,0) with 2 live neighbors lives on — [(0,0), (1,0), (2,0), (1,2)] → [(1,-1), (0,1), (1,0), (2,1)] experiments/runs/2026-08-10_16-37-38_game-of-life-example-mapping_v5.1-testlist-scope-fix_opus-5-no-thinking/src/game-of-life.spec.ts:43— No conventional assertion call was detected, and 9 of 9 tests in `experiments/runs/2026-08-10_16-37-38_game-of-life-example-mapping_v5.1-testlist-scope-fix_opus-5-no-thinking` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
No direct assertions: Rule 3 – Overpopulation: overcrowded center cell (1,1) dies — [(0,0), (1,0), (2,0), (1,1), (0,2), (1,2), (2,2)] → [(1,-1), (0,0), (1,0), (2,0), (0,2), (1,2), (2,2), (1,3)] experiments/runs/2026-08-10_16-37-38_game-of-life-example-mapping_v5.1-testlist-scope-fix_opus-5-no-thinking/src/game-of-life.spec.ts:61— No conventional assertion call was detected, and 9 of 9 tests in `experiments/runs/2026-08-10_16-37-38_game-of-life-example-mapping_v5.1-testlist-scope-fix_opus-5-no-thinking` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
No direct assertions: Block (still life): [(0,0), (1,0), (0,1), (1,1)] stays unchanged experiments/runs/2026-08-10_16-37-38_game-of-life-example-mapping_v5.1-testlist-scope-fix_opus-5-no-thinking/src/game-of-life.spec.ts:81— No conventional assertion call was detected, and 9 of 9 tests in `experiments/runs/2026-08-10_16-37-38_game-of-life-example-mapping_v5.1-testlist-scope-fix_opus-5-no-thinking` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
No direct assertions: Blinker gen 0 → gen 1: vertical [(0,0), (0,1), (0,2)] becomes horizontal [(-1,1), (0,1), (1,1)] experiments/runs/2026-08-10_16-37-38_game-of-life-example-mapping_v5.1-testlist-scope-fix_opus-5-no-thinking/src/game-of-life.spec.ts:94— No conventional assertion call was detected, and 9 of 9 tests in `experiments/runs/2026-08-10_16-37-38_game-of-life-example-mapping_v5.1-testlist-scope-fix_opus-5-no-thinking` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
No direct assertions: Blinker gen 1 → gen 2: horizontal [(-1,1), (0,1), (1,1)] becomes vertical [(0,0), (0,1), (0,2)] experiments/runs/2026-08-10_16-37-38_game-of-life-example-mapping_v5.1-testlist-scope-fix_opus-5-no-thinking/src/game-of-life.spec.ts:105— No conventional assertion call was detected, and 9 of 9 tests in `experiments/runs/2026-08-10_16-37-38_game-of-life-example-mapping_v5.1-testlist-scope-fix_opus-5-no-thinking` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
README/code drift README.md:385— README.md links to `site/docs/README.md`, but `site/docs/README.md` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift README.md:942— README.md links to `experiments/workflows/MARKERS.md`, but `experiments/workflows/MARKERS.md` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift README.md:1321— README.md links to `HUMAN-IN-THE-LOOP.md`, but `HUMAN-IN-THE-LOOP.md` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
D10 · Test Quality· Test project verifies nothing · ×1
Test project verifies nothing: experiments/runs/2026-08-10_16-37-38_game-of-life-example-mapping_v5.1-testlist-scope-fix_opus-5-no-thinking experiments/runs/2026-08-10_16-37-38_game-of-life-example-mapping_v5.1-testlist-scope-fix_opus-5-no-thinking/src/game-of-life.spec.ts:14— No conventional assertion call was detected in 9 of 9 tests in `experiments/runs/2026-08-10_16-37-38_game-of-life-example-mapping_v5.1-testlist-scope-fix_opus-5-no-thinking` — the project as a whole, not one method. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a suite that genuinely checks nothing. If it is the latter, this project passes unconditionally and cannot fail.
DM9 · Scattered domain decisions· Rule about [enchantment, material] decided in 9 places · ×1
Rule about [enchantment, material] decided in 9 places — experiments.runs.2026-05-08_11-36-07_claim-office-example-mapping_v3-basic-tdd_opus-4-7-no-thinking.src.types.Item's [enchantment, material] are judged in experiments.runs.2026-05-09_09-02-47_claim-office-example-mapping_v3-basic-tdd_haiku-4-5.src.engine.Engine, experiments.runs.2026-05-09_09-08-31_claim-office-example-mapping_v3-basic-tdd_haiku-4-5.src.core, experiments.runs.2026-05-11_23-09-36_claim-office-prose_v5-exact-single-context_opus-4-6-portkey.src.claim-office, experiments.runs.2026-05-12_01-06-17_claim-office-user-story_v5-exact-single-context_opus-4-6-portkey-2.src.claim-office, experiments.runs.2026-05-12_01-06-46_claim-office-user-story_v5-exact-single-context_opus-4-6-portkey-no-thinking.src.claim-office, experiments.runs.2026-05-12_01-37-27_claim-office-user-story_v5-exact-single-context_opus-4-6-portkey-no-thinking.src.claim-office, experiments.runs.2026-05-12_01-37-28_claim-office-user-story_v5-exact-single-context_opus-4-6-portkey.src.claim-office, experiments.runs.2026-07-25_09-45-21_claim-office-example-mapping_v6_2_1-phase-continuation-pi_qwen3-235b.src.claim-office, experiments.runs.2026-08-10_06-39-55_claim-office-example-mapping_v4_1-testlist-scope-fix-pi_gpt-5-6-sol-4.src.claim-office — the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it.
IC1 · Incompleteness & stubs· Empty method body · ×1
Empty method body experiments/runs/2026-05-12_08-47-44_claim-office-user-story_v5-exact-single-context_haiku-4-5-portkey-no-thinking/src/claim-office.ts:6— `processClaim` has an empty body — confirm it's an intentional no-op and not an unfinished method.
No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
No dependency-update automation .claude/skills/exact-coding-baseline-export/distribution-root/templates/typescript-vitest/files/package.json:11— `.claude/skills/exact-coding-baseline-export/distribution-root/templates/typescript-vitest/files/package.json` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`.
P4 · Deployment & Rollback· No rollback/health safety · ×1
No rollback/health safety — Deployment is orchestrated by compose, but no service declares a `healthcheck:` and nothing pins a previous image to fall back to — the runtime can tell that the container is up, not that it is serving, so a bad release is harder to detect and reverse.
Changelog looks stale/thin — The changelog this check read carries 2 versioned entries, against a bar of 3. Counted as either the distinct `x.y.z` versions it names (a link's target is not counted) or its version-shaped section headings (`## [1.2.0]`, `## V14.x.x`, `## Updates in 8.0.x`), whichever is the larger — so a log sectioned by minor series counts its sections, not its individual patch numbers. Entries recorded somewhere this check does not read — release notes generated at tag time from a generator config it did not recognise, or a log kept outside the repository — are not counted here, and this row is about what is re-findable in the tree rather than about how often you release.
Null assertions (`!`) override strict null checking — ~2.1 `!` null assertions per 1k TypeScript source lines — 59 assertion(s) across the 27559 source line(s) of the 469 TypeScript file(s) read, which is the only code the operator asserts anything in (a `!` in a `.js` file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: site/src/trophy.ts (17), experiments/runs/2026-05-12_05-53-15_claim-office-user-story_v5-exact-single-context_sonnet-4-6-portkey/src/claim-office.ts (6), experiments/runs/2026-05-11_23-09-36_claim-office-prose_v5-exact-single-context_opus-4-6-portkey/src/claim-office.ts (5). Each one tells the compiler to trust the author about null, suppressing the very diagnostic `strictNullChecks` exists to produce. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first.
Skipped (documented): more damages of a type than insured -> non-zero exit, whole claim rejected experiments/runs/_archive/2026-09-23_16-10-32_claim-office-example-mapping_exact-ptdd-v1.1-refactor-subagent-cc_opus-5-5-no-thinking/src/claim-office.spec.ts:274— Skipped with a documented reason — a deferral, not lazy debt: declared with it.todo — a placeholder that registers a name and runs nothing
Skipped (documented): single staff: base 80 G + 5 fee = 85 G experiments/runs/2026-10-23_04-10-12_claim-office-example-mapping_exact-ptdd-v1-pi_minimax-m3/src/claim-office.spec.ts:46— Skipped with a documented reason — a deferral, not lazy debt: declared with it.todo — a placeholder that registers a name and runs nothing
Skipped (documented): single potion: base 40 G + 5 fee = 45 G experiments/runs/2026-10-23_04-10-12_claim-office-example-mapping_exact-ptdd-v1-pi_minimax-m3/src/claim-office.spec.ts:47— Skipped with a documented reason — a deferral, not lazy debt: declared with it.todo — a placeholder that registers a name and runs nothing
Skipped (documented): 2 runes: 50 G base + 5 fee = 55 G (no block) experiments/runs/2026-10-23_04-10-12_claim-office-example-mapping_exact-ptdd-v1-pi_minimax-m3/src/claim-office.spec.ts:51— Skipped with a documented reason — a deferral, not lazy debt: declared with it.todo — a placeholder that registers a name and runs nothing
Skipped (documented): 3 runes: 60 G base + 5 fee = 65 G (block applies) experiments/runs/2026-10-23_04-10-12_claim-office-example-mapping_exact-ptdd-v1-pi_minimax-m3/src/claim-office.spec.ts:52— Skipped with a documented reason — a deferral, not lazy debt: declared with it.todo — a placeholder that registers a name and runs nothing
Skipped (documented): 4 runes: 100 G base + 5 fee = 105 G (no block, requires exactly 3) experiments/runs/2026-10-23_04-10-12_claim-office-example-mapping_exact-ptdd-v1-pi_minimax-m3/src/claim-office.spec.ts:53— Skipped with a documented reason — a deferral, not lazy debt: declared with it.todo — a placeholder that registers a name and runs nothing
Skipped (documented): 7 runes: 175 G base + 5 fee = 180 G (no block) experiments/runs/2026-10-23_04-10-12_claim-office-example-mapping_exact-ptdd-v1-pi_minimax-m3/src/claim-office.spec.ts:54— Skipped with a documented reason — a deferral, not lazy debt: declared with it.todo — a placeholder that registers a name and runs nothing
Skipped (documented): 2 runes + 1 moonstone: 75 G base + 5 fee = 80 G (no block, different types) experiments/runs/2026-10-23_04-10-12_claim-office-example-mapping_exact-ptdd-v1-pi_minimax-m3/src/claim-office.spec.ts:55— Skipped with a documented reason — a deferral, not lazy debt: declared with it.todo — a placeholder that registers a name and runs nothing
Skipped (documented): 3 runes + 3 moonstones: 120 G base + 5 fee = 125 G (two separate blocks) experiments/runs/2026-10-23_04-10-12_claim-office-example-mapping_exact-ptdd-v1-pi_minimax-m3/src/claim-office.spec.ts:56— Skipped with a documented reason — a deferral, not lazy debt: declared with it.todo — a placeholder that registers a name and runs nothing
Skipped (documented): cursed sword (steel, enchantment 3, first contract, 0 years): 165 G experiments/runs/2026-10-23_04-10-12_claim-office-example-mapping_exact-ptdd-v1-pi_minimax-m3/src/claim-office.spec.ts:60— Skipped with a documented reason — a deferral, not lazy debt: declared with it.todo — a placeholder that registers a name and runs nothing
Skipped (documented): cursed sword with enchantment 5 (first contract, 0 years): 195 G (curse + high enchant) experiments/runs/2026-10-23_04-10-12_claim-office-example-mapping_exact-ptdd-v1-pi_minimax-m3/src/claim-office.spec.ts:61— Skipped with a documented reason — a deferral, not lazy debt: declared with it.todo — a placeholder that registers a name and runs nothing
Skipped (documented): cursed sword with enchantment 4 (first contract, 0 years): 165 G (no high enchant) experiments/runs/2026-10-23_04-10-12_claim-office-example-mapping_exact-ptdd-v1-pi_minimax-m3/src/claim-office.spec.ts:62— Skipped with a documented reason — a deferral, not lazy debt: declared with it.todo — a placeholder that registers a name and runs nothing
Skipped (documented): sword with enchantment 5 (not cursed, first contract, 0 years): 145 G experiments/runs/2026-10-23_04-10-12_claim-office-example-mapping_exact-ptdd-v1-pi_minimax-m3/src/claim-office.spec.ts:63— Skipped with a documented reason — a deferral, not lazy debt: declared with it.todo — a placeholder that registers a name and runs nothing
Skipped (documented): cursed sword + plain amulet (first contract, 0 years): 231 G (210 + 16 + 5) experiments/runs/2026-10-23_04-10-12_claim-office-example-mapping_exact-ptdd-v1-pi_minimax-m3/src/claim-office.spec.ts:64— Skipped with a documented reason — a deferral, not lazy debt: declared with it.todo — a placeholder that registers a name and runs nothing
Skipped (documented): loyalty discount: sword with exactly 2 years, first contract: 95 G experiments/runs/2026-10-23_04-10-12_claim-office-example-mapping_exact-ptdd-v1-pi_minimax-m3/src/claim-office.spec.ts:68— Skipped with a documented reason — a deferral, not lazy debt: declared with it.todo — a placeholder that registers a name and runs nothing
Skipped (documented): loyalty applies to amulet too: amulet with 2 years, first contract: 59 G experiments/runs/2026-10-23_04-10-12_claim-office-example-mapping_exact-ptdd-v1-pi_minimax-m3/src/claim-office.spec.ts:69— Skipped with a documented reason — a deferral, not lazy debt: declared with it.todo — a placeholder that registers a name and runs nothing
Skipped (documented): follow-up contract: sword with 1 year, second quote: 100 G experiments/runs/2026-10-23_04-10-12_claim-office-example-mapping_exact-ptdd-v1-pi_minimax-m3/src/claim-office.spec.ts:70— Skipped with a documented reason — a deferral, not lazy debt: declared with it.todo — a placeholder that registers a name and runs nothing
Skipped (documented): loyalty + follow-up: sword with 2+ years, second quote: 80 G experiments/runs/2026-10-23_04-10-12_claim-office-example-mapping_exact-ptdd-v1-pi_minimax-m3/src/claim-office.spec.ts:71— Skipped with a documented reason — a deferral, not lazy debt: declared with it.todo — a placeholder that registers a name and runs nothing
Skipped (documented): newcomer with cursed sword (steel, enchantment 3): 165 G experiments/runs/2026-10-23_04-10-12_claim-office-example-mapping_exact-ptdd-v1-pi_minimax-m3/src/claim-office.spec.ts:75— Skipped with a documented reason — a deferral, not lazy debt: declared with it.todo — a placeholder that registers a name and runs nothing
Skipped (documented): long-standing customer's second contract with cursed sword (steel, enchantment 7): 160 G experiments/runs/2026-10-23_04-10-12_claim-office-example-mapping_exact-ptdd-v1-pi_minimax-m3/src/claim-office.spec.ts:76— Skipped with a documented reason — a deferral, not lazy debt: declared with it.todo — a placeholder that registers a name and runs nothing
Skipped (documented): premium rounded up: 2 cursed runes, 3 years, 2nd quote -> 67.5 G -> 68 G experiments/runs/2026-10-23_04-10-12_claim-office-example-mapping_exact-ptdd-v1-pi_minimax-m3/src/claim-office.spec.ts:82— Skipped with a documented reason — a deferral, not lazy debt: declared with it.todo — a placeholder that registers a name and runs nothing
Skipped (documented): throws when item type is unknown (e.g. broomstick) experiments/runs/2026-10-23_04-10-12_claim-office-example-mapping_exact-ptdd-v1-pi_minimax-m3/src/claim-office.spec.ts:88— Skipped with a documented reason — a deferral, not lazy debt: declared with it.todo — a placeholder that registers a name and runs nothing
Skipped (documented): regular sword (steel, enchantment 3), damage 500 -> payout 400 G experiments/runs/2026-10-23_04-10-12_claim-office-example-mapping_exact-ptdd-v1-pi_minimax-m3/src/claim-office.spec.ts:92— Skipped with a documented reason — a deferral, not lazy debt: declared with it.todo — a placeholder that registers a name and runs nothing
Skipped (documented): rune damage 200 -> payout 100 G (no special clauses) experiments/runs/2026-10-23_04-10-12_claim-office-example-mapping_exact-ptdd-v1-pi_minimax-m3/src/claim-office.spec.ts:93— Skipped with a documented reason — a deferral, not lazy debt: declared with it.todo — a placeholder that registers a name and runs nothing
Skipped (documented): dragon sword (enchantment 5), damage 800 -> payout 700 G (full reimbursement) experiments/runs/2026-10-23_04-10-12_claim-office-example-mapping_exact-ptdd-v1-pi_minimax-m3/src/claim-office.spec.ts:97— Skipped with a documented reason — a deferral, not lazy debt: declared with it.todo — a placeholder that registers a name and runs nothing
doc comments repeat the names experiments/runs/2026-05-09_14-24-02_claim-office-example-mapping_v3-basic-tdd_sonnet-4-6-no-thinking/src/claim-office.ts:92— 1 of 23 documented parameters and 5 of 2358 summaries in `tdd-experiment-run` only repeat the member or parameter name (e.g. "the customer" for `customer`). Delete the restating tags, or add what the name does not say.
Appendix B — Reproduction & audit trail
Every external tool invocation behind a deep-scan dimension — the tool, its captured version, the exact command, how many findings it yielded, and a link to the retained raw output. To reproduce any finding: check out the same commit and run the command shown (repo-relative — never an absolute scratch path). The complete raw scanner output is retained verbatim under artifacts/raw/ (indexed in artifacts/raw/index.json); per-invocation exit codes and wall-clock durations are in sidecar.json — kept out of this table so the rendered report stays byte-identical across runs of the same commit.
semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that. semgrep could not parse 2 file(s) — `experiments/runs/2026-05-12_04-33-35_claim-office-prose_v5-exact-single-context_sonnet-4-6-portkey-no-thinking/bin/claim-office.js`, `misc/qwen3-tampering-2026-08-05/refactor.js` — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.
provenance: not applicable — No CI/build pipeline found (.github/.forgejo/.gitea workflows, .circleci, .buildkite, .woodpecker, .teamcity, .gitlab-ci.yml, .travis.yml, bitbucket-pipelines.yml, .drone.yml, .cirrus.yml, .woodpecker.yml, appveyor.yml, azure-pipelines*.yml, .pipelines/, .vsts-ci/, .azuredevops/, Jenkinsfile); there is no build to attest provenance for.
disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
Run 01a1e7c0-b0dd-750f-b230-124af29b77aa · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 520 · Warnings: 943 · Recommendations: 257 · Info: 2223 — Appendix A · all findings · full markdown report.
Generated by the Canine Code Analyzer: deterministic code-health analysis. 17-11-2026 @ 04:25 UTC.
Downloadable artifacts
Machine-readable and reproducible from this commit + frozen rubric — drop them straight into a contract appendix, a CRA dossier, or a downstream SCA / VEX tool.