{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"s01-agent-loop.AgentLoop (cyclomatic 36): s01-agent-loop.AgentLoop has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 8 of the 36 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 254, 211). 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s01-agent-loop.tsx"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"512224ec4bba0fb48b7e4ff8ca9d6960e5086bf6e1198297bd97e1bf2e979b70"}},{"ruleId":"D1","level":"warning","message":{"text":"page.ComparePage (cyclomatic 26): page.ComparePage has cyclomatic complexity 26 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 2 belong 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/[locale]/(learn)/compare/page.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a370ef7c255d4498380ff2d87b027246a92b9791818e0119c6279eea85d231"}},{"ruleId":"D1","level":"warning","message":{"text":"s02-tool-dispatch.ToolDispatch (cyclomatic 25): s02-tool-dispatch.ToolDispatch has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 11 of the 25 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 255, 234, 347). 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s02-tool-dispatch.tsx"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f2a502d3627d3b7bff900b2c3202d13635490132f0d3c824d9f96c36744b31"}},{"ruleId":"D1","level":"warning","message":{"text":"s12-cron-scheduler.CronSchedulerVisualization (cyclomatic 25): s12-cron-scheduler.CronSchedulerVisualization has cyclomatic complexity 25 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 2 belong 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s12-cron-scheduler.tsx"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51845faf2b9882c1f5f2a7c29dc7e9e7d4c7c3c0f730adfb60d5c9955e657a7"}},{"ruleId":"D1","level":"warning","message":{"text":"s06-subagent.SubagentIsolation (cyclomatic 24): s06-subagent.SubagentIsolation has cyclomatic complexity 24 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 8 belong to 4 function literals inside it that branch. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s06-subagent.tsx"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df05b0addd3591d967403d05b238085eff2542e71085975f20564c8f3cf1da8"}},{"ruleId":"D1","level":"warning","message":{"text":"TeammateManager._loop (cyclomatic 23): TeammateManager._loop 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s_full.py"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9a052c698e3733d7e942ef84a4e65bf0f0f78ca9fd938f53f9ed0fbc2b783c"}},{"ruleId":"D1","level":"warning","message":{"text":"code.create_worktree (cyclomatic 23): code.create_worktree 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5ea865335b676d5237f773e74917c934e27fdaaa3ef849b34a2f7c5596ca29"}},{"ruleId":"D1","level":"warning","message":{"text":"code.create_worktree (cyclomatic 23): code.create_worktree 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s15_integrated_harness/code.py"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2a260c0094d30741fa280e344fef01241bbd4d37884b84d354672485454213"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleJsonSchema.validate (cyclomatic 23): SimpleJsonSchema.validate 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s16_workflow_runtime/code.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62342e518c078848330130ba663862475ad62a7abe412cbeed7605b18bccb6c"}},{"ruleId":"D1","level":"warning","message":{"text":"s09-memory.MemoryVisualization (cyclomatic 23): s09-memory.MemoryVisualization has cyclomatic complexity 23 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 10 belong to 2 function literals inside it that branch. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s09-memory.tsx"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"2caa644126a1f70648479a89b6b512208455b8e15db7c4c60169509e1e967d60"}},{"ruleId":"D1","level":"warning","message":{"text":"s08-context-compact.ContextCompact (cyclomatic 22): s08-context-compact.ContextCompact has cyclomatic complexity 22 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s08-context-compact.tsx"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37f1f511f0108dc811721bcdd4a761da3a3fd0b4e292ac853f45c63ee739865"}},{"ruleId":"D1","level":"warning","message":{"text":"s11-background-tasks.BackgroundTasks (cyclomatic 22): s11-background-tasks.BackgroundTasks has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 5 of the 22 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 279, 441, 346). 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s11-background-tasks.tsx"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"569febfb2d939ec9325b8a4e16199186d5e8afc1177f7b924cb19782248c7208"}},{"ruleId":"D1","level":"warning","message":{"text":"code.remove_worktree (cyclomatic 20): code.remove_worktree has cyclomatic complexity 20 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s15_integrated_harness/code.py"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b9a2418f87f568147f3eb2b2088013be14b3d7e27faf8284ff0d2877197a5a"}},{"ruleId":"D1","level":"warning","message":{"text":"code.agent_loop (cyclomatic 20): code.agent_loop 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s15_integrated_harness/code.py"},"region":{"startLine":3155}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f5ce2a572071f5aa54cd58294eeb92532505ec4d015f7fa31616906e660b96"}},{"ruleId":"D1","level":"warning","message":{"text":"TeammateManager._loop (cyclomatic 19): TeammateManager._loop 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s11_autonomous_agents.py"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2015b15bc8b6073a5815b1594901b29b032a9b5ffff69d2440598be22fb254"}},{"ruleId":"D1","level":"warning","message":{"text":"extract-content.assignmentBody (cyclomatic 19): extract-content.assignmentBody 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/extract-content.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9e065ce54800e108945af54d6ab01014f505b970e0183f43a58722f73c3a81"}},{"ruleId":"D1","level":"warning","message":{"text":"execution-flow.getEdgePath (cyclomatic 19): execution-flow.getEdgePath 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/architecture/execution-flow.tsx"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b086b166e1623dccde7ece5d5599ade7919661bd1d8e1f7591d9f1721673cac7"}},{"ruleId":"D1","level":"warning","message":{"text":"s06_context_compact.micro_compact (cyclomatic 18): s06_context_compact.micro_compact 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s06_context_compact.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7e1cade7794dd79038a07db5063cbb96a9dc5716f5030657c9559603e12780"}},{"ruleId":"D1","level":"warning","message":{"text":"source-viewer.highlightLine (cyclomatic 18): source-viewer.highlightLine has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 5 of the 18 points are its own statements and the rest belongs to one function literal inside it that branches (line 45). The decisions are inside the literal, 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 literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/code/source-viewer.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1488d75ed2034eb3f1dc23052b6ef006363d03f683778979ed7b3acde2b0f8a"}},{"ruleId":"D1","level":"warning","message":{"text":"s07-skill-loading.SkillLoading (cyclomatic 18): s07-skill-loading.SkillLoading has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s07-skill-loading.tsx"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"32fe42d88fb72eb2b0f20e22c236e0065bb39963414f800247a2ed61881cb347"}},{"ruleId":"D1","level":"warning","message":{"text":"code._validate_cron_field (cyclomatic 17): code._validate_cron_field 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s12_cron_scheduler/code.py"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"16109d34fe5ff0d2b65d9cad8f720c1ce9ca905807b5ebc2b1307e753293f455"}},{"ruleId":"D1","level":"warning","message":{"text":"code.remove_worktree (cyclomatic 17): code.remove_worktree 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca274e41ffee47e7826c7ac6fae73f92601bf31ce8289a502f1add3a3abafbd0"}},{"ruleId":"D1","level":"warning","message":{"text":"code._validate_cron_field (cyclomatic 17): code._validate_cron_field 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s15_integrated_harness/code.py"},"region":{"startLine":2453}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6dda3b6e07fec1b426156cfc35a1de017a78453ce2207a751e639500941a013"}},{"ruleId":"D1","level":"warning","message":{"text":"s14-mcp-tools.McpToolsVisualization (cyclomatic 17): s14-mcp-tools.McpToolsVisualization has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s14-mcp-tools.tsx"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"f037586604c169187399f5f615de1ebf91f7c6acda049f00a27d647418068738"}},{"ruleId":"D1","level":"warning","message":{"text":"code.consolidate_memories (cyclomatic 16): code.consolidate_memories has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s09_memory/code.py"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4aa28b099e5464dbb6a7a40ce485a1c720d48d7df5da29a61172a4fd5ebdf86"}},{"ruleId":"D1","level":"warning","message":{"text":"mechanism-flow.MechanismFlow (cyclomatic 16): mechanism-flow.MechanismFlow has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 216, 257). 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/shared/mechanism-flow.tsx"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d57215d562818ae26177d239ee6ffc9021a8d221ceeb1e1fc173f3fda59c35e"}},{"ruleId":"D2","level":"warning","message":{"text":"TeammateManager._loop (cognitive 63): TeammateManager._loop has cognitive complexity 63 (threshold 15). Drivers by points: if/else 12 (41 pts), loops 7 (18 pts), error handling 1 (3 pts), boolean chains 1 (nesting depth added 42). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s_full.py"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"807babb268109c3c954b211f188ef21bb70fef1c906d965d0a0a88412c00c85d"}},{"ruleId":"D2","level":"warning","message":{"text":"TeammateManager._loop (cognitive 59): TeammateManager._loop has cognitive complexity 59 (threshold 15). Drivers by points: if/else 12 (41 pts), loops 6 (15 pts), error handling 1 (3 pts) (nesting depth added 40). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s11_autonomous_agents.py"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8be09474735eeae0b82ad0a04317f975f88be99c227642543b475b5ec80aa7"}},{"ruleId":"D2","level":"warning","message":{"text":"code.agent_loop (cognitive 47): code.agent_loop has cognitive complexity 47 (threshold 15). Drivers by points: if/else 14 (35 pts), error handling 2 (6 pts), loops 3 (5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s15_integrated_harness/code.py"},"region":{"startLine":3155}}}],"partialFingerprints":{"codehealthFindingId/v1":"861604068df089eedaff1a1a584187a71bd332e10e84406863e5f9050bb4e7bf"}},{"ruleId":"D2","level":"warning","message":{"text":"s01-agent-loop.AgentLoop (cognitive 46): s01-agent-loop.AgentLoop has cognitive complexity 46 (threshold 15). Drivers by points: ternaries 22 (32 pts), boolean chains 7, if/else 2 (4 pts), loops 2 (3 pts) (nesting depth added 13). Most of this is not in the body itself: 10 of the 46 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 254, 211). 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s01-agent-loop.tsx"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c308a1f56c5000bb665ebea3f1f9ea115c683f729b383f366f3f0512e7ab699"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleJsonSchema.validate (cognitive 42): SimpleJsonSchema.validate has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 3 (7 pts), ternaries 4 (7 pts), boolean chains 2 (nesting depth added 20). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s16_workflow_runtime/code.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e1c9d4b43e9d8ada34329a3b4d365abfdb32440eb61fd031bb0d997f166bdf"}},{"ruleId":"D2","level":"warning","message":{"text":"extract-content.assignmentBody (cognitive 36): extract-content.assignmentBody has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (31 pts), boolean chains 3, loops 1, ternaries 1 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/extract-content.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"44bcbaec4076569eecb613848736ab5bd9657d8eb003a897bcd1513465d4ede7"}},{"ruleId":"D2","level":"warning","message":{"text":"s06_context_compact.micro_compact (cognitive 35): s06_context_compact.micro_compact has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 5 (10 pts), boolean chains 4 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s06_context_compact.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb4a3f06fdd4e918290fbf4b0c54b7973eb0b669815aa88751fbaca6fe0e6da"}},{"ruleId":"D2","level":"warning","message":{"text":"s_full.agent_loop (cognitive 33): s_full.agent_loop has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (19 pts), ternaries 2 (6 pts), error handling 1 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 20). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s_full.py"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e7b5807712349e970f9ff4618c3e9f21d71275921264a51911fba7a91c3ec7"}},{"ruleId":"D2","level":"warning","message":{"text":"s06_context_compact.agent_loop (cognitive 27): s06_context_compact.agent_loop has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (14 pts), error handling 1 (5 pts), ternaries 1 (5 pts), loops 2 (3 pts) (nesting depth added 17). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s06_context_compact.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"2668087c26b8dd389a44617c30e1832276ec716f3e8da44b166a0f4c4f449705"}},{"ruleId":"D2","level":"warning","message":{"text":"code.agent_loop (cognitive 26): code.agent_loop has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (15 pts), ternaries 2 (5 pts), error handling 1 (3 pts), loops 2 (3 pts) (nesting depth added 15). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s05_todo_write/code.py"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8416b75923865005190268a3cf8bbbb8a0af046c0441b2298b4a1c97e280ef4"}},{"ruleId":"D2","level":"warning","message":{"text":"code.create_worktree (cognitive 26): code.create_worktree has cognitive complexity 26 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 3, error handling 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7b55631760e819171cbd2e6c42f55125f2948bf30ef3f5f876e8b369085bb5"}},{"ruleId":"D2","level":"warning","message":{"text":"code.create_worktree (cognitive 26): code.create_worktree has cognitive complexity 26 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 3, error handling 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s15_integrated_harness/code.py"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01f88d0de7cfe34e5af05460f09665b5b7b697a7a2a4201d7c25da128ce482a"}},{"ruleId":"D2","level":"warning","message":{"text":"s06-subagent.SubagentIsolation (cognitive 26): s06-subagent.SubagentIsolation has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 10 (13 pts), boolean chains 8, if/else 5 (nesting depth added 3). Of this number, 18 points are the body\u0027s own statements and 8 belong to 4 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s06-subagent.tsx"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b543d8693d24defc1529550aedbef9e29b2f3b1e2f3112d3056db268effa5bb9"}},{"ruleId":"D2","level":"warning","message":{"text":"code.consolidate_memories (cognitive 25): code.consolidate_memories has cognitive complexity 25 (threshold 15). Drivers by points: error handling 4 (9 pts), if/else 6 (9 pts), loops 4 (6 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s09_memory/code.py"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aabae519f6e1f240c867c47f612684a78f536f4fc88f99825f91de884e40ba5"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentSession._run_query (cognitive 25): AgentSession._run_query has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (13 pts), error handling 1 (4 pts), loops 2 (3 pts), ternaries 1 (3 pts), boolean chains 2 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s17_goal_loop/code.py"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca9f56f453aa3cffa86af7fe761b82940dcf7455243904e65848ad1b28631aa"}},{"ruleId":"D2","level":"warning","message":{"text":"s03_todo_write.agent_loop (cognitive 24): s03_todo_write.agent_loop has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (11 pts), ternaries 2 (6 pts), error handling 1 (4 pts), loops 2 (3 pts) (nesting depth added 15). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s03_todo_write.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b4ae3e5355eefaa2e08c17c37020a73be13b4e978e2785d441367c2813c98f"}},{"ruleId":"D2","level":"warning","message":{"text":"code.check_permission (cognitive 24): code.check_permission has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 1 (2 pts), boolean chains 1 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":1710}}}],"partialFingerprints":{"codehealthFindingId/v1":"7587ef36d7edc20dc660e8eafb7df909562ca9f7c817a7a0c41fc327c29334c2"}},{"ruleId":"D2","level":"warning","message":{"text":"code.permission_hook (cognitive 24): code.permission_hook has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 1 (2 pts), boolean chains 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s14_mcp_plugin/code.py"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"885d65e28ad7ba6f9dd04f4f0feb3e17254904720e01516e0e017795b189ca3a"}},{"ruleId":"D2","level":"warning","message":{"text":"code-diff.SplitView (cognitive 24): code-diff.SplitView has cognitive complexity 24 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 5 (9 pts), boolean chains 5 (nesting depth added 10). Of this number, 20 points are the body\u0027s own statements and 4 belong 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/diff/code-diff.tsx"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a07edf7e146b04a93dd4aa01d9c5507fb0a061338637f20ff1a3f5e84fc0965"}},{"ruleId":"D2","level":"warning","message":{"text":"code._validate_cron_field (cognitive 23): code._validate_cron_field has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 4, loops 1 (2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s12_cron_scheduler/code.py"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"7932e58927152053b1d8913b45a2f1d6e6f1b76f3adefad2a9f6766e81ebc1b7"}},{"ruleId":"D2","level":"warning","message":{"text":"code.permission_hook (cognitive 23): code.permission_hook has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 1 (2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s15_integrated_harness/code.py"},"region":{"startLine":1811}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a214e7727f96cb6d401f764af2fa69581a98464f5e28a5930154e470f893a2b"}},{"ruleId":"D2","level":"warning","message":{"text":"code._validate_cron_field (cognitive 23): code._validate_cron_field has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 4, loops 1 (2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s15_integrated_harness/code.py"},"region":{"startLine":2453}}}],"partialFingerprints":{"codehealthFindingId/v1":"82bcb37c5529bbc3bb991896af46c0269bda2ad8e38a0f94f6d4c3cc5e936983"}},{"ruleId":"D2","level":"warning","message":{"text":"s02-tool-dispatch.ToolDispatch (cognitive 23): s02-tool-dispatch.ToolDispatch has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 15, boolean chains 8. Most of this is not in the body itself: 9 of the 23 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 255, 234, 347). 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s02-tool-dispatch.tsx"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"0871700362ea239bdad5c07d60444857b74e7b6641654c9763c2e53ca216baba"}},{"ruleId":"D2","level":"warning","message":{"text":"s11-background-tasks.BackgroundTasks (cognitive 23): s11-background-tasks.BackgroundTasks has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 8 (11 pts), boolean chains 8, if/else 4 (nesting depth added 3). Most of this is not in the body itself: 4 of the 23 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 441, 279, 346). 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s11-background-tasks.tsx"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d594bd160d9e79c69234e627605c24231d1a6cd18cd2d5ccf672d5a8d29e855"}},{"ruleId":"D2","level":"warning","message":{"text":"TeammateManager._teammate_loop (cognitive 22): TeammateManager._teammate_loop has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (5 pts), error handling 1 (2 pts), ternaries 1 (2 pts), boolean chains 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s10_team_protocols.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e37d40ada39dd4b2ba6638911d7e776519ed462b418019f1b8a1a3c92b0dfe"}},{"ruleId":"D2","level":"warning","message":{"text":"code.agent_loop (cognitive 22): code.agent_loop has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (3 pts), error handling 1 (2 pts), boolean chains 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s08_context_compact/code.py"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff5c942ef6e6ede9f6b5badb286965b3a12942ca870ab17968480fcab2084f9"}},{"ruleId":"D2","level":"warning","message":{"text":"code.agent_loop (cognitive 21): code.agent_loop has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (12 pts), error handling 2 (5 pts), loops 3 (4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s12_cron_scheduler/code.py"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"5313e892d9bfec9eb045a3a2532183efdb0a006a9a25d878d69b9edfcc5d06c1"}},{"ruleId":"D2","level":"warning","message":{"text":"execution-flow.getEdgePath (cognitive 21): execution-flow.getEdgePath has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 8 (14 pts), if/else 6 (7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/architecture/execution-flow.tsx"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"1275830f683908a3c8528b0150a05f55f3ab2224e254b0b697c0b1749e3072db"}},{"ruleId":"D2","level":"warning","message":{"text":"s09-memory.MemoryVisualization (cognitive 21): s09-memory.MemoryVisualization has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 18, ternaries 3. Of this number, 12 points are the body\u0027s own statements and 9 belong to 2 function literals inside it that branch. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s09-memory.tsx"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a890c58dc34a13fea8d6197d0e83cefbac658dc07bdada76ffc19f53624fcb8"}},{"ruleId":"D2","level":"warning","message":{"text":"code.remove_worktree (cognitive 20): code.remove_worktree has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 2, error handling 1, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s15_integrated_harness/code.py"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"598953cd8ba59e0e2175e8565ce480e54a71e577b14e406292d8108680ed1d60"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentSession._permission_hook (cognitive 20): AgentSession._permission_hook has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s17_goal_loop/code.py"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"302e10678a27a0e3636ae56eb62dbfc624c42d8e17d28f029dec42b76e9c0207"}},{"ruleId":"D2","level":"warning","message":{"text":"s12-cron-scheduler.CronSchedulerVisualization (cognitive 20): s12-cron-scheduler.CronSchedulerVisualization has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 12, ternaries 8. Of this number, 18 points are the body\u0027s own statements and 2 belong 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s12-cron-scheduler.tsx"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e59e0e83a1cc66ddc036d20a6de3d371e4df7624635f6fa18b2b46a37184d49"}},{"ruleId":"D2","level":"warning","message":{"text":"TeammateRuntime.wait_for_work (cognitive 19): TeammateRuntime.wait_for_work has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), ternaries 2 (4 pts), loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":1328}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1415cabd56698ba5fea6b91eb049982ff73909aa1faf598ce1ef4759f3e104a"}},{"ruleId":"D2","level":"warning","message":{"text":"s03-permission.CheckRow (cognitive 19): s03-permission.CheckRow has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 8 (17 pts), boolean chains 2 (nesting depth added 9). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s03-permission.tsx"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"80907702e53cb10a961f6450cacfc9458d0e9e65da87705b3d9a563fb154c13f"}},{"ruleId":"D2","level":"warning","message":{"text":"s13-team-runtime.RuntimePanel (cognitive 19): s13-team-runtime.RuntimePanel has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 11 (19 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s13-team-runtime.tsx"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b8badbe6ce7d7e55616ae7543447a5b76dfb57918f26c37eb34fab6bfc0d7d"}},{"ruleId":"D2","level":"warning","message":{"text":"mechanism-flow.FlowNode (cognitive 19): mechanism-flow.FlowNode has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 12 (17 pts), boolean chains 1, if/else 1 (nesting depth added 5). Of this number, 16 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/shared/mechanism-flow.tsx"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"192817e236872b0c23c8c671908dc2a20de99756a8c53b1e6e01b6a5b6cfa32b"}},{"ruleId":"D2","level":"warning","message":{"text":"s04_subagent.agent_loop (cognitive 18): s04_subagent.agent_loop has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), ternaries 1 (5 pts), loops 2 (3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s04_subagent.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"273a2d78fdd6410e078d0af7381af2d26fc36fc85028fe1e27505df268be7c28"}},{"ruleId":"D2","level":"warning","message":{"text":"s09_agent_teams.agent_loop (cognitive 18): s09_agent_teams.agent_loop has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (7 pts), error handling 1 (4 pts), ternaries 1 (4 pts), loops 2 (3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s09_agent_teams.py"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"925c3417270b94f3d56b0639b427046c9576e92a3ce231e333cb5c967caeec97"}},{"ruleId":"D2","level":"warning","message":{"text":"s10_team_protocols.agent_loop (cognitive 18): s10_team_protocols.agent_loop has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (7 pts), error handling 1 (4 pts), ternaries 1 (4 pts), loops 2 (3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s10_team_protocols.py"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba3f3350bbad6f2380f7033204ca2ef21cb148b91c3f16404b03d051825b03f"}},{"ruleId":"D2","level":"warning","message":{"text":"s11_autonomous_agents.agent_loop (cognitive 18): s11_autonomous_agents.agent_loop has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (7 pts), error handling 1 (4 pts), ternaries 1 (4 pts), loops 2 (3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s11_autonomous_agents.py"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b0abf63a93a14d76656f42eeb44ae2668523582332755fd5b8465c246067a1"}},{"ruleId":"D2","level":"warning","message":{"text":"code.permission_hook (cognitive 18): code.permission_hook has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s04_hooks/code.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"5292b73841d28b7442a122469b8c78394945c240135184b7c2fe8f696172e529"}},{"ruleId":"D2","level":"warning","message":{"text":"TodoManager.update (cognitive 18): TodoManager.update has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), error handling 2 (5 pts), loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s05_todo_write/code.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5d9bc82ca250c73b5e6c996d4a34f0320227e4d7a145fbf0a2f964c9e83b57"}},{"ruleId":"D2","level":"warning","message":{"text":"code.permission_hook (cognitive 18): code.permission_hook has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s05_todo_write/code.py"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f6b7dabaaa860e52d33a198e36676510273edeeb0bffb4e44ae84b34c576c2"}},{"ruleId":"D2","level":"warning","message":{"text":"code.permission_hook (cognitive 18): code.permission_hook has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s06_subagent/code.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3c5281a6cae6e04418ccae7aeafe0faf605a3b108596c5afbc76cabd307efc"}},{"ruleId":"D2","level":"warning","message":{"text":"code.permission_hook (cognitive 18): code.permission_hook has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s07_skill_loading/code.py"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"645a681d691420e833ff4b8f3ae108637fd70f147473e608f4a6323d1547ecdb"}},{"ruleId":"D2","level":"warning","message":{"text":"code.permission_hook (cognitive 18): code.permission_hook has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s08_context_compact/code.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"461c170b10d507105ec14fccea4848b5137c9725882dc1043d7d5299e67edb14"}},{"ruleId":"D2","level":"warning","message":{"text":"code.permission_hook (cognitive 18): code.permission_hook has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s09_memory/code.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55cd36e7aa414a1a255ba2d8dac9da1225cfe2cdc73d112e26aafeb916a0412"}},{"ruleId":"D2","level":"warning","message":{"text":"code.permission_hook (cognitive 18): code.permission_hook has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s10_task_system/code.py"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"31093da3e5fd9badba86a45bd08cd7f8fe52f900d1c22f3f8f0559c7b9b8ff02"}},{"ruleId":"D2","level":"warning","message":{"text":"code.permission_hook (cognitive 18): code.permission_hook has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s11_background_tasks/code.py"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34baf3b894487541dc6025f67d74bfd9b3ce5e32de3f4f8d314e91d1933ecce"}},{"ruleId":"D2","level":"warning","message":{"text":"code.spawn_subagent (cognitive 18): code.spawn_subagent has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s15_integrated_harness/code.py"},"region":{"startLine":1944}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dfebe859edbf6c42bf661f6b6cbe741b275b1ac4bd548157b3ce2187f1deac0"}},{"ruleId":"D2","level":"warning","message":{"text":"page.ComparePage (cognitive 18): page.ComparePage has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 15, ternaries 2, if/else 1. Of this number, 16 points are the body\u0027s own statements and 2 belong 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/[locale]/(learn)/compare/page.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef290c154a36a1c2a8f9bfa39e768474ad93a3734ef50b8f9286d9a241997ef"}},{"ruleId":"D2","level":"warning","message":{"text":"s_full.microcompact (cognitive 17): s_full.microcompact has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s_full.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdaab9ddfcf6f995826af7fe4d91ba17c8492bdccf7e912459cf647f50a7558d"}},{"ruleId":"D2","level":"warning","message":{"text":"code.acknowledge_cron_jobs (cognitive 17): code.acknowledge_cron_jobs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (7 pts), 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s12_cron_scheduler/code.py"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"517bb472d62f88e69fa62cde17a3f3565272b3c06933723d7b15f5fd4814b3a5"}},{"ruleId":"D2","level":"warning","message":{"text":"code.remove_worktree (cognitive 17): code.remove_worktree has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 1, error handling 1, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"201e7a6ae9e44701b69f71e6e40500384abd4ae4121fb69b93f6649aad037fcb"}},{"ruleId":"D2","level":"warning","message":{"text":"code._stop_process_group (cognitive 17): code._stop_process_group has cognitive complexity 17 (threshold 15). Drivers by points: error handling 4 (10 pts), if/else 2 (4 pts), loops 2 (3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s15_integrated_harness/code.py"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b6932d0314d7007b0dcedfc6080ae8ea2c0444a8693e6444f59e18b9ea4274a"}},{"ruleId":"D2","level":"warning","message":{"text":"s05_skill_loading.agent_loop (cognitive 16): s05_skill_loading.agent_loop has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (5 pts), error handling 1 (4 pts), ternaries 1 (4 pts), loops 2 (3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s05_skill_loading.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ed4014ef9e95dc482bc5ce902e62d16a23b4c5f4c8783ca93b03164e204a6e"}},{"ruleId":"D2","level":"warning","message":{"text":"s07_task_system.agent_loop (cognitive 16): s07_task_system.agent_loop has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (5 pts), error handling 1 (4 pts), ternaries 1 (4 pts), loops 2 (3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s07_task_system.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b0dad598b129622e2ef1411975acf33a1a8c4d9d52fe79f320a37a168bbd1c"}},{"ruleId":"D2","level":"warning","message":{"text":"s08_background_tasks.agent_loop (cognitive 16): s08_background_tasks.agent_loop has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (5 pts), error handling 1 (4 pts), ternaries 1 (4 pts), loops 2 (3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s08_background_tasks.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"f067a874a6b4019b377151b1964495a791d9bf6f9cb0812fabbb154fadae76f8"}},{"ruleId":"D2","level":"warning","message":{"text":"TeammateManager._exec (cognitive 16): TeammateManager._exec has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), ternaries 2 (5 pts) (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s11_autonomous_agents.py"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c330405f47c047663f5b3bc95e9cd405ddcab21b32907494f6a1098d038d60a"}},{"ruleId":"D2","level":"warning","message":{"text":"s12_worktree_task_isolation.agent_loop (cognitive 16): s12_worktree_task_isolation.agent_loop has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (5 pts), error handling 1 (4 pts), ternaries 1 (4 pts), loops 2 (3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s12_worktree_task_isolation.py"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"7480c13345b1498c17e46563f4e80b0d5a6aea44ae195f9dcd81c0ec002fd5d4"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskManager.update (cognitive 16): TaskManager.update has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s_full.py"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"56311d72e8bdc3e4df1fd236b5a5396328046866b69b998d49998507ab2de17e"}},{"ruleId":"D2","level":"warning","message":{"text":"code.agent_loop (cognitive 16): code.agent_loop has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (3 pts), ternaries 1 (3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s04_hooks/code.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"d173b2391102005b80bee45b0355a2e585f5600f805ca30e6124e2a3e4deea58"}},{"ruleId":"D2","level":"warning","message":{"text":"code.with_retry (cognitive 16): code.with_retry has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), boolean chains 3, error handling 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s15_integrated_harness/code.py"},"region":{"startLine":2258}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c24e38e2a1a51251044b43bc75b4242f1a59aee8f09827c9b8f50c1e1d29ba3"}},{"ruleId":"D2","level":"warning","message":{"text":"ExecutionState.agent (cognitive 16): ExecutionState.agent has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s16_workflow_runtime/code.py"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"082fa9a5796aee1aa6f0c3adfa52d22f8cf5b6f3d446eec43620f121c468cc9f"}},{"ruleId":"D2","level":"warning","message":{"text":"code.main (cognitive 16): code.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), error handling 1 (2 pts), loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s17_goal_loop/code.py"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"e87cdbafc665475fc9aff03f78223cd790891bf2dfe5e444c1429d7f9cd4e678"}},{"ruleId":"D2","level":"warning","message":{"text":"s07-skill-loading.SkillLoading (cognitive 16): s07-skill-loading.SkillLoading has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 10, ternaries 5 (6 pts) (nesting depth added 1). Of this number, 14 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s07-skill-loading.tsx"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c80db876ca06eb19830db8c2ae13767eaeb8c56c6ce48072e835564d7ca8eb3"}},{"ruleId":"D2","level":"warning","message":{"text":"s08-context-compact.ContextCompact (cognitive 16): s08-context-compact.ContextCompact has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, ternaries 7 (8 pts) (nesting depth added 1). Of this number, 10 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s08-context-compact.tsx"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4a1f506c36a2d211b699dc9903ea92b94fed4131d94e5bb9b5101c8ff1ff93"}},{"ruleId":"D2","level":"warning","message":{"text":"s13-team-runtime.WorkspacePanel (cognitive 16): s13-team-runtime.WorkspacePanel has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 12 (15 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s13-team-runtime.tsx"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82e98b9470774e8e15b0af7e8e69371909af2b965622e8f31aec84100033256"}},{"ruleId":"D2","level":"warning","message":{"text":"s14-mcp-tools.McpToolsVisualization (cognitive 16): s14-mcp-tools.McpToolsVisualization has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, ternaries 8. Of this number, 15 points are the body\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s14-mcp-tools.tsx"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5ecac86f88d3ff999bb15411ad59dadf4f24077707d7c2ae83b5fb62bf7503"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: s15_integrated_harness/code.py: FileTooLong \u2014 2704 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2204 over it, 5.41\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s15_integrated_harness/code.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de55fb1e1dc81d6f539204ab52af32fe0ac3aa219f9ccb351eed7e26e853ccf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: s11-background-tasks.BackgroundTasks: FunctionTooLong \u2014 BackgroundTasks runs 432 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 332 over it, 4.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s11-background-tasks.tsx"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87001e4443040dacfd3a11de8960cce2beb375cd1d03217561bd43e38cc2cca"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: s13_agent_teams/code.py: FileTooLong \u2014 1525 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1025 over it, 3.05\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bbe81bbee5b10ddff6f8c2c3e2cf76271cf9cfad34ab4801b7aa1b90b2b9845"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: s07-skill-loading.SkillLoading: FunctionTooLong \u2014 SkillLoading runs 279 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 179 over it, 2.79\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s07-skill-loading.tsx"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d0f302732e77af1794fc063eb4cedebec8b489adf5a2fd68a077c8e28864b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: s02-tool-dispatch.ToolDispatch: FunctionTooLong \u2014 ToolDispatch runs 258 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 158 over it, 2.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s02-tool-dispatch.tsx"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d92d99887c3d9f12e52e39fcacf35144812787ef09b0e588a32c4683a783e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: page.ComparePage: FunctionTooLong \u2014 ComparePage runs 256 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 156 over it, 2.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/[locale]/(learn)/compare/page.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"5549f7fcb4d87a52d947234c8cd28e60bb0ce99c697f01f99d13a02336a26e16"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: s08-context-compact.ContextCompact: FunctionTooLong \u2014 ContextCompact runs 247 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 147 over it, 2.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s08-context-compact.tsx"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"f09717cf94b4dddd1f3a29b5559c916ee240588f184218bdd7db2f95570d0810"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: s01-agent-loop.AgentLoop: FunctionTooLong \u2014 AgentLoop runs 243 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 143 over it, 2.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s01-agent-loop.tsx"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"b061d191de8719cd77951a06e6d2e6e3083f4a406faa66c3a44c54600ed82c52"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: s06-subagent.SubagentIsolation: FunctionTooLong \u2014 SubagentIsolation runs 211 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 111 over it, 2.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s06-subagent.tsx"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"7259ed9bdbeb3358c90622e8eb94ae3030317d392dba87faad42da95d9c63c52"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: page.HomePage: FunctionTooLong \u2014 HomePage runs 181 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 81 over it, 1.81\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/[locale]/page.tsx"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4943816da54221d58b5d2d700e43be247b743729e1a243c50de8fbe9755e2a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: diff-content.DiffPageContent: FunctionTooLong \u2014 DiffPageContent runs 159 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/[locale]/(learn)/[version]/diff/diff-content.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"409241fe435aecb89eaf4936fc91dc1005cef5b4df664621a3f06c823b5c6bc1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: s09-memory.MemoryVisualization: FunctionTooLong \u2014 MemoryVisualization runs 158 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s09-memory.tsx"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"0042a791c8bc289367d0d28c15db2381df29a37406c5dfae6d37bb78324475b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: timeline.Timeline: FunctionTooLong \u2014 Timeline runs 143 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/timeline/timeline.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd09e2bd50d9b6805b610350d7b813d10c251dccccb5701a49b8d74c325aea76"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: s17_goal_loop/code.py: FileTooLong \u2014 702 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 202 over it, 1.40\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s17_goal_loop/code.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8d481f26f72a9280653eda639da9c82a46ad3b8d403a9b8367d157e3e81192"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: s14-mcp-tools.McpToolsVisualization: FunctionTooLong \u2014 McpToolsVisualization runs 137 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s14-mcp-tools.tsx"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3d95201aa4c2c56663b6e8f828fcea5987678bf51311a84053efea01653a9b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: s16_workflow_runtime/code.py: FileTooLong \u2014 658 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 158 over it, 1.32\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s16_workflow_runtime/code.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16516ed667eaa4efd04b626dc093a46c873dab645681ee9e41e829aac343910e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: s09_memory/code.py: FileTooLong \u2014 638 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 138 over it, 1.28\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s09_memory/code.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9db81d799ce84cd39e121db3e761d2b57bf2ee5bf3bbedc42abd1d3a46fb10"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: s12_cron_scheduler/code.py: FileTooLong \u2014 624 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 124 over it, 1.25\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s12_cron_scheduler/code.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fedc265b424bc1d57720b871a6d0da8ed0cdf7c8fbdd69895b5e04d95f15990"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agents/s_full.py: FileTooLong \u2014 622 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 122 over it, 1.24\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s_full.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"549e2f773e885e3b4dd0f1689ea17d3e72e8a8ec3fda3618c20f86c0fb07a4e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: s15-integrated-harness.ComprehensiveVisualization: FunctionTooLong \u2014 ComprehensiveVisualization runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s15-integrated-harness.tsx"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24c17efdb823f95289ae3137b5564637bb6ab1c6d02369c711fc1b6307579ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: header.Header: FunctionTooLong \u2014 Header runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/layout/header.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"8293cf1f9ed0a5ef708e069e76f06f58f9969eecca906689aa276dc692e1ff2f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: s12-cron-scheduler.CronSchedulerVisualization: FunctionTooLong \u2014 CronSchedulerVisualization runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s12-cron-scheduler.tsx"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6f5bbbd89a148659adbe7f1844c839e703ce1cc069b0fc7e03946337aa8741"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agents/s12_worktree_task_isolation.py: FileTooLong \u2014 589 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 89 over it, 1.18\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s12_worktree_task_isolation.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"201e81588f0ea30941b15a8f2fd5ab7f1e6396fa1f107b51058ec5411c2e30f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arch-diagram.ArchDiagram: FunctionTooLong \u2014 ArchDiagram runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/architecture/arch-diagram.tsx"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca42e22a50dce9e1bb77bb0848ae68f24a9ad4c03ab1fba90005f36256e080da"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: visualizations/s11-background-tasks.tsx: FileTooLong \u2014 532 significant lines (blank, comment-only and punctuation-only lines excluded), about 81% of them inside a single declaration: BackgroundTasks (151-624). The bar is 500 significant lines; this is 32 over it, 1.06\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s11-background-tasks.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e5456ca881701b7b054e5f666dc3789752f916e0c49cb8103c00138bbeb10c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mechanism-flow.MechanismFlow: FunctionTooLong \u2014 MechanismFlow runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/shared/mechanism-flow.tsx"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6229e9d9886536e44dff1eb671014e0a91652410e93a1a0fed6e6f2ff10076"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): s13_agent_teams/code.py:312-338 | s15_integrated_harness/code.py:402-428 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8ea8812119382a2107c59fc9166ed136ef7d26df5c8bc17494748f8f4be089"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (24 members, 50\u002B identical tokens): agents/s02_tool_use.py:90-98 | agents/s03_todo_write.py:136-144 | agents/s04_subagent.py:92-100 | agents/s05_skill_loading.py:161-169 | agents/s06_context_compact.py:178-186 | agents/s07_task_system.py:168-176 | agents/s08_background_tasks.py:158-166 | agents/s09_agent_teams.py:305-313 | agents/s10_team_protocols.py:346-354 | agents/s11_autonomous_agents.py:432-440 | agents/s12_worktree_task_isolation.py:531-539 | agents/s_full.py:117-125 | s02_tool_use/code.py:109-117 | s03_permission/code.py:107-115 | s04_hooks/code.py:91-99 | s05_todo_write/code.py:93-101 | s06_subagent/code.py:97-105 | s07_skill_loading/code.py:182-190 | s08_context_compact/code.py:118-126 | s09_memory/code.py:583-591 | s10_task_system/code.py:321-329 | s11_background_tasks/code.py:176-184 | s12_cron_scheduler/code.py:104-112 | s15_integrated_harness/code.py:1004-1012 \u2014 These 24 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 \u2014 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 24 times. The repair is at the members\u0027 grain \u2014 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 24 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s02_tool_use.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"183e1d48ced33923cbeacbbfc79c3faaa8e742d7c6414d0c683d598ffa2cd327"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (12 members, 50\u002B identical tokens): agents/s01_agent_loop.py:82-101 | agents/s02_tool_use.py:122-138 | agents/s03_todo_write.py:171-198 | agents/s05_skill_loading.py:195-214 | agents/s06_context_compact.py:212-249 | agents/s07_task_system.py:211-230 | agents/s08_background_tasks.py:225-248 | agents/s09_agent_teams.py:353-385 | agents/s10_team_protocols.py:434-466 | agents/s11_autonomous_agents.py:526-558 | agents/s12_worktree_task_isolation.py:736-765 | agents/s_full.py:700-744 \u2014 These 12 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 \u2014 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 12 times. The repair is at the members\u0027 grain \u2014 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 12 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s01_agent_loop.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"86fe1980291332be38481f201325a9d94bf5e846a999c5fe661bb41c74045947"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (11 members, 50\u002B identical tokens): agents/s03_todo_write.py:118-124 | agents/s04_subagent.py:74-80 | agents/s05_skill_loading.py:143-149 | agents/s06_context_compact.py:160-166 | agents/s07_task_system.py:150-156 | agents/s08_background_tasks.py:140-146 | agents/s09_agent_teams.py:285-291 | agents/s10_team_protocols.py:326-332 | agents/s11_autonomous_agents.py:412-418 | agents/s12_worktree_task_isolation.py:511-517 | agents/s_full.py:99-105 \u2014 These 11 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 \u2014 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 11 times. The repair is at the members\u0027 grain \u2014 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 11 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s03_todo_write.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"4206d294692e20f9ffd90c421816cf6efea08984c2f09cc4f75e42b553197bfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (11 members, 50\u002B identical tokens): s02_tool_use/code.py:89-95 | s03_permission/code.py:87-93 | s04_hooks/code.py:72-79 | s05_todo_write/code.py:75-81 | s06_subagent/code.py:77-83 | s07_skill_loading/code.py:162-168 | s08_context_compact/code.py:98-104 | s10_task_system/code.py:301-307 | s11_background_tasks/code.py:155-162 | s12_cron_scheduler/code.py:83-90 | s13_agent_teams/code.py:695-701 \u2014 These 11 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 \u2014 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 11 times. The repair is at the members\u0027 grain \u2014 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 11 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s02_tool_use/code.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f9e33a0aa47ac4aa17519709dccfd8734993bff92388fa847fac5a3015f12e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (11 members, 50\u002B identical tokens): s02_tool_use/code.py:121-133 | s03_permission/code.py:119-131 | s04_hooks/code.py:102-114 | s05_todo_write/code.py:104-116 | s06_subagent/code.py:109-121 | s07_skill_loading/code.py:194-206 | s08_context_compact/code.py:130-140 | s09_memory/code.py:594-605 | s10_task_system/code.py:333-344 | s11_background_tasks/code.py:188-199 | s12_cron_scheduler/code.py:116-127 \u2014 These 11 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 \u2014 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 11 times. The repair is at the members\u0027 grain \u2014 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 11 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s02_tool_use/code.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"00700ee00f4295008013371e4e393632ef37feb7266c56c096c747b55ea2e528"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): s04_hooks/code.py:163-186 | s05_todo_write/code.py:239-262 | s06_subagent/code.py:175-199 | s07_skill_loading/code.py:263-287 | s08_context_compact/code.py:199-219 | s09_memory/code.py:654-674 | s10_task_system/code.py:464-487 | s11_background_tasks/code.py:269-292 \u2014 These 8 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 \u2014 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 8 times. The repair is at the members\u0027 grain \u2014 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 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s04_hooks/code.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"e983c4289c2d9bd66e4dd1569f3ec4cb54062a92b9a27e85cab9869252b5ac70"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): s03_permission/code.py:97-103 | s04_hooks/code.py:82-88 | s05_todo_write/code.py:84-90 | s06_subagent/code.py:87-93 | s07_skill_loading/code.py:172-178 \u2014 These 5 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 \u2014 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 5 times. The repair is at the members\u0027 grain \u2014 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s03_permission/code.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0bba78ce8b99af885bd325e951066ab85c861094d6601136523d0391266f9c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): s08_context_compact/code.py:108-114 | s09_memory/code.py:574-580 | s10_task_system/code.py:311-317 | s11_background_tasks/code.py:166-172 | s12_cron_scheduler/code.py:94-100 \u2014 These 5 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 \u2014 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 5 times. The repair is at the members\u0027 grain \u2014 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s08_context_compact/code.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"541c54361252b88d05b8cdc3fd0ce43471b5b51471677d407b443a96074d3e6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): agents/s09_agent_teams.py:154-171 | agents/s10_team_protocols.py:164-181 | agents/s11_autonomous_agents.py:202-219 | agents/s_full.py:428-439 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s09_agent_teams.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d412c5fb85392b94c1eaa9c8431ceeb8dafd913c02980bf2e607acaad29edd"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): s08_context_compact/code.py:240-249 | s09_memory/code.py:711-722 | s10_task_system/code.py:533-544 | s12_cron_scheduler/code.py:621-631 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s08_context_compact/code.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c72f057a2653fcac024d26d3602b9135504ab9cac2d14f83094cf2d468a4dea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): s13_agent_teams/code.py:569-618 | s15_integrated_harness/code.py:659-716 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"2634bcea48d8cf9d97babd78d10633b340daaec0c0b3c07fdabf248f13f7ab53"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): agents/s10_team_protocols.py:231-264 | agents/s11_autonomous_agents.py:312-346 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s10_team_protocols.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8f3fc6c5904b296d7247c1bf32b44581f6e1d5a978c3ff6e2a0aef33fcdbda"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): agents/s09_agent_teams.py:174-211 | agents/s10_team_protocols.py:184-227 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s09_agent_teams.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"439026ce78c413ce62320de2f50ca191b720a443fa8495430d5226afc12dcf55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): s04_hooks/code.py:225-258 | s05_todo_write/code.py:299-346 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s04_hooks/code.py"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f4d9ce411c5529094ef263425b311fc8ca446707dc3208d5ee6d012629fbb15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): s12_cron_scheduler/code.py:325-353 | s15_integrated_harness/code.py:2454-2482 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s12_cron_scheduler/code.py"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6824042a05360c4a2d4e69128eb67c57c6c99946d7057be344ba533cb80829d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): s13_agent_teams/code.py:1711-1733 | s14_mcp_plugin/code.py:404-429 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":1711}}}],"partialFingerprints":{"codehealthFindingId/v1":"880c9421613d93eefdc934e2f4a09782bb63147b6c4a69156dcea9bc9adc38a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): s13_agent_teams/code.py:1494-1515 | s15_integrated_harness/code.py:1760-1784 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":1494}}}],"partialFingerprints":{"codehealthFindingId/v1":"e501e27bda7105a507a363b80e0b294ed4ad3d368e3388b37999c1e42e364438"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): s08_context_compact/code.py:369-386 | s15_integrated_harness/code.py:2088-2108 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s08_context_compact/code.py"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff039dbfc79a0d93cb626b2255ea8ac93009b8d91700f9bc58c513a650618e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): s11_background_tasks/code.py:111-141 | s15_integrated_harness/code.py:933-960 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s11_background_tasks/code.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"2304283f9d4cfaa972b91c0793c7d51339a2937ed914aa3bf928d47573194a0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): s02_tool_use/code.py:164-185 | s03_permission/code.py:220-248 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s02_tool_use/code.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41baffce99d1b223b39b6f0deaeb77ec6bac871c8c005804c9193b5f9b5c979"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): s08_context_compact/code.py:399-419 | s15_integrated_harness/code.py:2123-2146 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s08_context_compact/code.py"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"325c211217a4dafdcb68fb96aedebd93a8285e4c2ceb184570c0ec2468655ce9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): agents/s03_todo_write.py:63-81 | agents/s_full.py:134-148 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s03_todo_write.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"e549586e90cb84d5a66480965067bd68839fb24d8cb1d759fe4e5f461ebab2f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): s07_skill_loading/code.py:90-113 | s15_integrated_harness/code.py:749-773 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s07_skill_loading/code.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"956d53a12cd5cd76509f8fbfda350392e7780265d499eb53f3c8dd14919dee12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): s13_agent_teams/code.py:1012-1035 | s15_integrated_harness/code.py:1708-1727 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"3196129dccced8b146b0aa4d3dfd57c307160b21842ad635c8e8cefc0060976c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 29\u002B corresponding lines): s07_skill_loading/code.py:349-377 | s10_task_system/code.py:550-578 | s11_background_tasks/code.py:494-523 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 29 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s07_skill_loading/code.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"940a7cc216086b2722ac3bac19fe10a83b1b5f11a200f37b5f6aa7d3c793b16b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): agents/s12_worktree_task_isolation.py:208-223 | agents/s_full.py:315-323 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s12_worktree_task_isolation.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f191d3c620620b675f64278fd155000ccbb7332b4ed97873c0adc1c55ea6ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 30\u002B corresponding lines): s01_agent_loop/code.py:97-126 | s13_agent_teams/code.py:1797-1837 | s14_mcp_plugin/code.py:489-528 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 30 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s01_agent_loop/code.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28a480d77e74bbf6da5dfea5f610f1357bb06b1f19884a6a7a3d926a14393bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): s08_context_compact/code.py:321-338 | s15_integrated_harness/code.py:2037-2053 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s08_context_compact/code.py"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"64aee12763185a6becb879c616af151c2c204dd8f4a5d81eeab39a8ea595d902"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): s10_task_system/code.py:361-380 | s13_agent_teams/code.py:797-809 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s10_task_system/code.py"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"065f2b2c0d19387acfcb171b3e88960cdc8c3e2ee0d0254a8f630752c4df6204"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): s12_cron_scheduler/code.py:300-321 | s15_integrated_harness/code.py:2432-2450 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s12_cron_scheduler/code.py"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea575a63afa62bfae8e0fb40003eb9c12bd8f143848621b76eb1721d7709ab6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): s13_agent_teams/code.py:72-89 | s15_integrated_harness/code.py:160-181 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"677e61bb465b2982447d8fa21a22f46ab871ced6a28021c31c83060276914d53"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): agents/s04_subagent.py:60-71 | s02_tool_use/code.py:64-76 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s04_subagent.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb3d6842a095c843571850e49b1a9d3a0ba93812d6cb7e562795cd0fcfc0db7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): s13_agent_teams/code.py:673-690 | s14_mcp_plugin/code.py:64-81 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"59478a12fc852ebcadb2c35beac56940a15d15e9fa6ae27b5b96f01121bcb113"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): agents/s03_todo_write.py:84-92 | agents/s_full.py:151-159 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s03_todo_write.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c6842bea981945f95ebea7af6baa7b17ac7b3d474a2390acbaa83b0133a38b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): s11_background_tasks/code.py:65-91 | s15_integrated_harness/code.py:887-913 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s11_background_tasks/code.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"9996bed724cba55cd9a815ff6b92e49b07488d3a487b4905b789fb1662ff5549"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): s14_mcp_plugin/code.py:290-302 | s15_integrated_harness/code.py:2754-2765 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s14_mcp_plugin/code.py"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ec4da1d1faa260349fbff83ce985c838719f8c2ecf7bea6bb041befedbfad8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): s12_cron_scheduler/code.py:286-296 | s15_integrated_harness/code.py:2417-2428 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s12_cron_scheduler/code.py"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1f86c9c0d2da50e992faca183364408a08dd3ee1e674a51299cade515a1fe8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): s13_agent_teams/code.py:971-980 | s15_integrated_harness/code.py:1233-1242 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d0e0bfbb6993a29fee879f8451667f3d1e9488c0c2a8ef3dc822965ba0629d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): s13_agent_teams/code.py:1780-1791 | s14_mcp_plugin/code.py:472-483 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":1780}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b892a5ef3d0b2047ef9fca5703d5b23578adfd89979278226171b374133686e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): s13_agent_teams/code.py:1466-1480 | s15_integrated_harness/code.py:1733-1746 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d05f9d0d971b2ee2241d4a241fd7d098b53e35b0f4d869f69715060735ccd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): s08_context_compact/code.py:349-361 | s15_integrated_harness/code.py:2066-2078 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s08_context_compact/code.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcca2b4360a8fb9732303295344b5d74c5789ad0f2ff707d429bb64dce359464"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): s13_agent_teams/code.py:984-992 | s15_integrated_harness/code.py:1246-1253 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"248bfbf31fd23b1716efaa6a31b4ef1143f9da615dbf559bccac299dd67d8598"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): agents/s02_tool_use.py:69-76 | skills/agent-builder/references/tool-templates.py:184-203 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s02_tool_use.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03c2b7ac65a3a10df2d94820d762a7622f32c0c4ff64915cde847789435f42a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): s06_subagent/code.py:246-257 | s07_skill_loading/code.py:334-345 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s06_subagent/code.py"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"e562d01419909545e75bd4873e7d1951b2a57fbb574ab224244ec12f1a8a40bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): s13_agent_teams/code.py:716-725 | s14_mcp_plugin/code.py:105-114 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"11eb5b2eb32989f3a4b1481b5d350039e70055232582febb6fd5c8bc7fecb723"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): agents/s08_background_tasks.py:63-70 | agents/s_full.py:340-343 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s08_background_tasks.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1d9a120e05267dba3ce6bf4483f6dd75af58bcc1084a296216cf0c6a7d3127"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 5\u002B corresponding lines): agents/s09_agent_teams.py:247-252 | agents/s10_team_protocols.py:288-293 | agents/s11_autonomous_agents.py:374-379 | agents/s_full.py:540-544 \u2014 These 4 members are one piece of code written 4 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s09_agent_teams.py"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb0095cd9942acabaee40fa7d62a646bd971686e9c0fad01bfafd63b271f308"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): s08_context_compact/code.py:389-396 | s15_integrated_harness/code.py:2112-2119 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s08_context_compact/code.py"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2665a32bbd5d7c5a67c7b7ac32962e2afe8de023af2d94babf3465decd76fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): s05_todo_write/code.py:282-287 | s06_subagent/code.py:223-235 | s07_skill_loading/code.py:311-323 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s05_todo_write/code.py"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b36041a10fa05dc3988342067a9a504cc975075bc9fc8331a6af667868ad92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): s08_context_compact/code.py:313-318 | s15_integrated_harness/code.py:2184-2189 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s08_context_compact/code.py"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f2154f78d19e97e1770847b97ac7cab0a7ba4af810086fe641a33ffc624aea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): s09_memory/code.py:563-571 | s14_mcp_plugin/code.py:85-91 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s09_memory/code.py"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"1332b08c9b28477555ddc09a84915ec707c9ece35a706b27cf66303c8531c9d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): s08_context_compact/code.py:341-345 | s15_integrated_harness/code.py:2057-2061 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s08_context_compact/code.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"45129eca3031b32eb1d8214fb27c2f9cbaa8aacef57cc3943e17d41511c0cb2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): s12_cron_scheduler/code.py:549-558 | s15_integrated_harness/code.py:2598-2605 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s12_cron_scheduler/code.py"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecef14f02d525dc8c562e329ba2299a89f5d3a51cb3944cee5c995ff51e01a99"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): s13_agent_teams/code.py:248-260 | s15_integrated_harness/code.py:340-350 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"855ee0a3112f4c462d03f1515162f22db7c48693ebaa7455f60cce36c2fbe397"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): s12_cron_scheduler/code.py:568-571 | s15_integrated_harness/code.py:2610-2613 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s12_cron_scheduler/code.py"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1af226c5ab512c3783faacbbcc1e678b7d19084b1b57899861fd9abc000d84a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): s06_subagent/code.py:267-273 | s15_integrated_harness/code.py:1929-1934 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s06_subagent/code.py"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9f27869db5190aa36c2f60391145536dacf4877afc3688107a00fb3d4bff4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 4\u002B corresponding lines): s04_hooks/code.py:189-192 | s05_todo_write/code.py:265-268 | s06_subagent/code.py:203-206 | s07_skill_loading/code.py:291-294 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s04_hooks/code.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4d15595530ddbfc8f9de58841774f908e9d66b9db96ae6eae9007f51a86a79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 4\u002B corresponding lines): s10_task_system/code.py:497-502 | s11_background_tasks/code.py:302-307 | s12_cron_scheduler/code.py:232-237 | s15_integrated_harness/code.py:1853-1856 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s10_task_system/code.py"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d90698caf3e03c0c34ebbf783b8296b079d7f7d9ae37fdf46b99d6aa085e57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 3\u002B corresponding lines): agents/s09_agent_teams.py:140-142 | agents/s10_team_protocols.py:150-152 | agents/s11_autonomous_agents.py:182-184 | agents/s_full.py:415-417 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 3 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s09_agent_teams.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd43332da4a0d8d6a017ddbd92733068a6e60bff06ec57edb32f770775d2537"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 3\u002B corresponding lines): s04_hooks/code.py:195-198 | s05_todo_write/code.py:271-274 | s06_subagent/code.py:210-213 | s07_skill_loading/code.py:298-301 | s08_context_compact/code.py:229-231 | s09_memory/code.py:682-684 | s13_agent_teams/code.py:1747-1749 | s14_mcp_plugin/code.py:439-441 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 3 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\u0027 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 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s04_hooks/code.py"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"edea3e2dd2e84a7be66f092857a356e5ae358bd4990f92ce48213a6b1af7cd78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): s13_agent_teams/code.py:779-781 | s15_integrated_harness/code.py:2822-2824 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1424dd6c8548e9de690dcd384b2ae838b736ac599d202d65a4c4ab3ae21fa50"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): s13_agent_teams/code.py:1005-1008 | s15_integrated_harness/code.py:1303-1306 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"574f767df8a78a3ee2da38948514c34dbb8b3ea20e36eae020d5b364350aa0b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): s07_skill_loading/code.py:116-121 | s15_integrated_harness/code.py:780-784 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s07_skill_loading/code.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b939a7a996d5d4eddceba05e99981ed82b8ea8ab2bc05a4752277bad51a6b13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): s13_agent_teams/code.py:1459-1462 | s15_integrated_harness/code.py:2890-2893 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":1459}}}],"partialFingerprints":{"codehealthFindingId/v1":"518be8bec3c9cdcc063fa93735248a83c496d726f2bbd1b0a144934384d93053"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (76 lines \u00D7 2): s13_agent_teams/code.py:490-565 | s15_integrated_harness/code.py:580-655 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7a7e93fdb991ab1ff3d20d0a44cdf6d0e643b84fca874cd4657a2d89b2bae6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38\u201340 lines \u00D7 2): s14_mcp_plugin/code.py:329-368 | s15_integrated_harness/code.py:2774-2811 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s14_mcp_plugin/code.py"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5904af79f834273f5c307470f3790d140009083846ddc9424a4257ed02f4ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): s13_agent_teams/code.py:172-202 | s15_integrated_harness/code.py:264-294 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"7618061da2baf5f99a62a42fffa730da6ea12f2d439504eb4f74ebabaace886c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201331 lines \u00D7 2): s13_agent_teams/code.py:590-618 | s15_integrated_harness/code.py:686-716 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060s15_integrated_harness/code.py:686\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f886e06bae810c6f4d6a3c46691fe33e260b822f94c00c54fab6363a01d1914"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): s13_agent_teams/code.py:1061-1088 | s15_integrated_harness/code.py:1324-1351 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"e198cbb8747f47ec05eae2fa3d68797f97f740197d05a4beea37b3b66110cb0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): s13_agent_teams/code.py:282-308 | s15_integrated_harness/code.py:372-398 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"881e887152746b15603292a4aaa315c7c09656b29954c9d7509f6bd42641b16b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201324 lines \u00D7 2): s11_background_tasks/code.py:65-88 | s15_integrated_harness/code.py:887-908 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s11_background_tasks/code.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4bce5dbd95cf89009b097baf4bc6bf78f36866fe6f742d48917745a84627b95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): s13_agent_teams/code.py:1402-1425 | s15_integrated_harness/code.py:1388-1411 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b6819a5241e3ce971b75ff67b565b3bcea806cd61a45fbe5c17a36b1b6f7ba4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 4): s06_subagent/code.py:177-199 | s07_skill_loading/code.py:265-287 | s10_task_system/code.py:465-487 | s11_background_tasks/code.py:270-292 \u2014 \u0060s06_subagent/code.py\u0060 and \u0060s07_skill_loading/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 17 separate duplicated blocks between them, totalling at least 168 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s06_subagent/code.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"123f3d2a984808c5ab9543e72409763a2622f2829450d3a4c9b92c2b3696222d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): agents/s09_agent_teams.py:184-206 | agents/s10_team_protocols.py:198-220 \u2014 before extracting anything, compare \u0060agents/s09_agent_teams.py\u0060 and \u0060agents/s10_team_protocols.py\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 207 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060agents/s10_team_protocols.py:221\u0060 calls \u0060get\u0060 and \u0060agents/s09_agent_teams.py:207\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s09_agent_teams.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7818b703173ba3ef8d9d5ff4430300d4c7e5fdde52486e34a4bdf7f0afd3ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): s04_hooks/code.py:165-186 | s05_todo_write/code.py:241-262 \u2014 \u0060s04_hooks/code.py\u0060 and \u0060s05_todo_write/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 16 separate duplicated blocks between them, totalling at least 162 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s04_hooks/code.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"73199148a8376801c1dc58e88a845507ff2e66fe30cbf0cf528404c5b33543c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): s07_skill_loading/code.py:67-87 | s15_integrated_harness/code.py:725-745 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s07_skill_loading/code.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ff47d52f823b03d0dafdef83e68d689a5b71c3a1595198b4cbad5f8734f84b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): s08_context_compact/code.py:199-219 | s09_memory/code.py:654-674 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s08_context_compact/code.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"463e005d6afc01c12b070c8f6ef8f91bc1f150a4ac170a4e81697e680bdd40da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): s13_agent_teams/code.py:312-332 | s15_integrated_harness/code.py:402-422 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea324e5d9552d01413577fef3463b783ca8baa036d8bae99ae1f75af2c9b5291"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): s13_agent_teams/code.py:569-589 | s15_integrated_harness/code.py:659-678 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b90aab9e10f25cfa7d31146ab4b431429fa2d4e48881fbadc727949e7f5a7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): s13_agent_teams/code.py:134-153 | s15_integrated_harness/code.py:226-245 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8654bfdf79a501fbdd83e6e910a936acee1be7ec68f673d496d74df417dc551"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): s13_agent_teams/code.py:435-454 | s15_integrated_harness/code.py:525-544 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dec94b06ee2c0ea87f077b39310bcedb57336667093a428d9478b5a61a093b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): agents/s09_agent_teams.py:353-370 | agents/s10_team_protocols.py:434-451 | agents/s11_autonomous_agents.py:526-543 \u2014 before extracting anything, compare \u0060agents/s09_agent_teams.py\u0060 and \u0060agents/s10_team_protocols.py\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 207 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s09_agent_teams.py"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5cca6c594a553d47965a648e67ed5ba9d1de919dda270ddc88605b42a13c813"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): s07_skill_loading/code.py:360-377 | s10_task_system/code.py:561-578 | s11_background_tasks/code.py:506-523 \u2014 \u0060s07_skill_loading/code.py\u0060 and \u0060s10_task_system/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 13 separate duplicated blocks between them, totalling at least 149 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060s07_skill_loading/code.py:360\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s07_skill_loading/code.py"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"00181facf8fca3b3c13a78a263cd49ddfb1ae02d7d9c0c3e1f59646b30cdb09d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): s12_cron_scheduler/code.py:325-342 | s15_integrated_harness/code.py:2454-2471 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s12_cron_scheduler/code.py"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"4147696053197eb411b62a943fc88a5066ef70297b0cc233b210ffb451da3d42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): s13_agent_teams/code.py:1092-1109 | s15_integrated_harness/code.py:1355-1372 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef3330043d1712cd42185e0087ede25d16f22df59e2787b5f1ff58f06b9002e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201317 lines \u00D7 3): s01_agent_loop/code.py:99-115 | s02_tool_use/code.py:166-178 | s03_permission/code.py:222-234 \u2014 \u0060s01_agent_loop/code.py\u0060 and \u0060s02_tool_use/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 3 separate duplicated blocks between them, totalling at least 38 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060s01_agent_loop/code.py:99\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s01_agent_loop/code.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89c0f49ae5b4776653bab4fd042c844b3526eb3a4ce4423ab483213e1a4250a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): s13_agent_teams/code.py:93-109 | s15_integrated_harness/code.py:185-201 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"249a33bfd9e453ad208110e5814f5e36265cf60e11cb1bbda330c237a0af9e62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): s13_agent_teams/code.py:408-423 | s15_integrated_harness/code.py:498-513 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fbde9928f17ffe320370e09c64b83921ac1905547faaa8133650702cb8395bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): s13_agent_teams/code.py:390-404 | s15_integrated_harness/code.py:480-494 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9335bf5a0b3a6705e7adafbe0a11c471ad520a0dc57f618a169b78c63c502d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201314 lines \u00D7 13): agents/s02_tool_use.py:58-65 | agents/s03_todo_write.py:109-115 | agents/s04_subagent.py:63-69 | agents/s05_skill_loading.py:134-140 | agents/s06_context_compact.py:151-157 | agents/s07_task_system.py:141-147 | agents/s08_background_tasks.py:131-137 | agents/s_full.py:90-96 | s02_tool_use/code.py:67-74 | s03_permission/code.py:77-83 | s04_hooks/code.py:63-69 | s05_todo_write/code.py:66-72 | skills/agent-builder/references/tool-templates.py:165-178 \u2014 before extracting anything, compare \u0060agents/s02_tool_use.py\u0060 and \u0060agents/s03_todo_write.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060agents/s04_subagent.py:70\u0060 calls \u0060except\u0060 and \u0060agents/s02_tool_use.py:68\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s02_tool_use.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc9bc2082a9f1be9666beefd3d138a011259c7ce63225029e568e0391ac22aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 9): agents/s01_agent_loop.py:83-95 | agents/s02_tool_use.py:123-132 | agents/s05_skill_loading.py:196-205 | agents/s07_task_system.py:212-221 | agents/s08_background_tasks.py:230-239 | agents/s09_agent_teams.py:360-372 | agents/s10_team_protocols.py:441-453 | agents/s11_autonomous_agents.py:533-545 | agents/s12_worktree_task_isolation.py:737-750 \u2014 before extracting anything, compare \u0060agents/s02_tool_use.py\u0060 and \u0060agents/s05_skill_loading.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 68 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060agents/s08_background_tasks.py:229\u0060 calls \u0060inject_background_notifications\u0060 and \u0060agents/s01_agent_loop.py:82\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s01_agent_loop.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"00653e8ffc392349a682a83ca005a415f62db41c6a623e1567d097365caac16e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 6): s04_hooks/code.py:227-237 | s05_todo_write/code.py:302-312 | s06_subagent/code.py:335-348 | s07_skill_loading/code.py:351-364 | s10_task_system/code.py:552-565 | s11_background_tasks/code.py:497-510 \u2014 \u0060s04_hooks/code.py\u0060 and \u0060s05_todo_write/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 16 separate duplicated blocks between them, totalling at least 162 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060s04_hooks/code.py:227\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060s11_background_tasks/code.py:495\u0060 calls \u0060inject_background_results\u0060 and \u0060s06_subagent/code.py:333\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s04_hooks/code.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97276b95d8e7636c10d9c9c3abbb9cc87e13e7ab0def0858660fa66803e89ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): agents/s09_agent_teams.py:91-104 | agents/s10_team_protocols.py:101-114 | agents/s11_autonomous_agents.py:94-107 \u2014 before extracting anything, compare \u0060agents/s09_agent_teams.py\u0060 and \u0060agents/s10_team_protocols.py\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 207 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s09_agent_teams.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"35bdb8e1dbdfe3ad2b2d5dd216ddd8a4b91fcac5000176e41599643686d908f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): agents/s09_agent_teams.py:158-171 | agents/s10_team_protocols.py:168-181 \u2014 before extracting anything, compare \u0060agents/s09_agent_teams.py\u0060 and \u0060agents/s10_team_protocols.py\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 207 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s09_agent_teams.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb69c2264314d752b867ac0a8b64031227954785424990f0c32315da8ffe61f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): agents/s11_autonomous_agents.py:246-259 | agents/s_full.py:474-486 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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 \u0060agents/s11_autonomous_agents.py:246\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s11_autonomous_agents.py"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"d078e5e08a70b6562f3299fb30a0f8ab8ed2f027fc6d51eb4b8e1e0cb3262c6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): s08_context_compact/code.py:297-310 | s15_integrated_harness/code.py:2020-2033 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s08_context_compact/code.py"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"7557d7b14a842b2d38a54f4fb84d8eb3ae1f1b559fad066122b86e105546341e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): s08_context_compact/code.py:321-334 | s15_integrated_harness/code.py:2037-2049 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s08_context_compact/code.py"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"07de24670cd14bd45bf9f64e4fbda2f564cd95d7ccfe4d46cc90345d8bb3b8a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201313 lines \u00D7 9): agents/s09_agent_teams.py:273-281 | agents/s10_team_protocols.py:314-322 | agents/s11_autonomous_agents.py:400-408 | agents/s12_worktree_task_isolation.py:495-507 | s06_subagent/code.py:65-73 | s07_skill_loading/code.py:150-158 | s08_context_compact/code.py:86-94 | s09_memory/code.py:548-560 | s10_task_system/code.py:285-297 \u2014 before extracting anything, compare \u0060agents/s09_agent_teams.py\u0060 and \u0060agents/s10_team_protocols.py\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 207 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060agents/s12_worktree_task_isolation.py:493\u0060 calls \u0060any\u0060 and \u0060s10_task_system/code.py:284\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s09_agent_teams.py"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ceb3c962557d5c635891d227ce4f94aec4ec3fc3d2d1995011fa545aedbac2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 9): s01_agent_loop/code.py:98-110 | s02_tool_use/code.py:165-174 | s03_permission/code.py:221-230 | s04_hooks/code.py:226-235 | s05_todo_write/code.py:301-310 | s06_subagent/code.py:334-346 | s07_skill_loading/code.py:350-362 | s10_task_system/code.py:551-563 | s11_background_tasks/code.py:496-508 \u2014 \u0060s01_agent_loop/code.py\u0060 and \u0060s02_tool_use/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 3 separate duplicated blocks between them, totalling at least 38 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060s11_background_tasks/code.py:495\u0060 calls \u0060inject_background_results\u0060 and \u0060s01_agent_loop/code.py:97\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s01_agent_loop/code.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"763744a870e99f4912e9e6de3327b01e4d89c2e8d4f1b20cadcf5103fb908c84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): agents/s08_background_tasks.py:195-207 | agents/s_full.py:660-672 \u2014 before extracting anything, compare \u0060agents/s08_background_tasks.py\u0060 and \u0060agents/s_full.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s08_background_tasks.py"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"1febe5cdc288f398bf5e21a36640581eece7ff7699332116688f808625432887"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): s05_todo_write/code.py:307-319 | s08_context_compact/code.py:571-583 \u2014 \u0060s05_todo_write/code.py\u0060 and \u0060s08_context_compact/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 48 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s05_todo_write/code.py"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"b874f3e6978ec7adab0ea96a2cd20953d574c3a7ac2cd20e7fae6f26f9a9059c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): s13_agent_teams/code.py:458-470 | s15_integrated_harness/code.py:548-560 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"a569a5ac1ec752c4b38f3efd4a5fce23de0841a63c21ffe1681cf2a42cbca30a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): s13_agent_teams/code.py:474-486 | s15_integrated_harness/code.py:564-576 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"42cbf17517e07a0ce105862d12f99f3f42d4e4f0a02d3b51fa3fee5bbb4d83e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): s13_agent_teams/code.py:678-690 | s14_mcp_plugin/code.py:69-81 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s14_mcp_plugin/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 36 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060s13_agent_teams/code.py:678\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"32402981cc3ed0b3aef588957a09e7e40bee060fd6548022ac0937d2bf439c2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): s11_background_tasks/code.py:119-130 | s15_integrated_harness/code.py:939-949 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060s11_background_tasks/code.py:119\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s11_background_tasks/code.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb3730c6156eb0db78ba0b426efbbde522ea3c68959076da90b6781cbeabaf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): s13_agent_teams/code.py:206-217 | s15_integrated_harness/code.py:298-309 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"6223d73e8d6e83b6375d097a271e5e3bc9a0ac2f0c50c6512a88fdd7277aab00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): s13_agent_teams/code.py:1494-1505 | s15_integrated_harness/code.py:1760-1771 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":1494}}}],"partialFingerprints":{"codehealthFindingId/v1":"847c3bd80f6db2523c23460930ac1d34a1f9084ed48193fad8279c9ac1c60fe6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 7): s04_hooks/code.py:232-242 | s05_todo_write/code.py:307-317 | s06_subagent/code.py:343-353 | s07_skill_loading/code.py:359-369 | s08_context_compact/code.py:571-581 | s10_task_system/code.py:560-570 | s11_background_tasks/code.py:505-515 \u2014 \u0060s04_hooks/code.py\u0060 and \u0060s05_todo_write/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 16 separate duplicated blocks between them, totalling at least 162 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s04_hooks/code.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ef4e2ab369d09d22d62c510db546812bc1dca4a5594fd1108fe142e11ad10b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): agents/s09_agent_teams.py:154-164 | agents/s10_team_protocols.py:164-174 | agents/s11_autonomous_agents.py:202-212 \u2014 before extracting anything, compare \u0060agents/s09_agent_teams.py\u0060 and \u0060agents/s10_team_protocols.py\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 207 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/s09_agent_teams.py:154\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s09_agent_teams.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99b8aae56d4552d864ef82652b81961eae11d099a504b82cac87e12b0c8d21c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): agents/s09_agent_teams.py:215-226 | agents/s10_team_protocols.py:231-242 | agents/s11_autonomous_agents.py:312-323 \u2014 before extracting anything, compare \u0060agents/s09_agent_teams.py\u0060 and \u0060agents/s10_team_protocols.py\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 207 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s09_agent_teams.py"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1efad033f21acf10b59045e5de63173c956b4669012e18cd85f4478343e02b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 3): s08_context_compact/code.py:240-248 | s09_memory/code.py:711-721 | s10_task_system/code.py:533-543 \u2014 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 \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s08_context_compact/code.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8f8a1d05f2dd48efeb4c69e1ae7ebe2f4a3fbb2375258ab963be2b0fbaa47d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): agents/s01_agent_loop.py:66-76 | s01_agent_loop/code.py:81-91 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s01_agent_loop.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"d754e2c57a81c6e25ca3f117a1ad57a5af0d3ab5d40eb7d56e524552c1ce5f71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): agents/s10_team_protocols.py:370-380 | agents/s11_autonomous_agents.py:456-466 \u2014 before extracting anything, compare \u0060agents/s10_team_protocols.py\u0060 and \u0060agents/s11_autonomous_agents.py\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 199 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s10_team_protocols.py"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"390e3f88c72da79c5cb4da2b9ad86880c69c71cf5955eeab52bd8d36bf09207e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): agents/s11_autonomous_agents.py:234-244 | agents/s_full.py:465-472 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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 \u0060agents/s11_autonomous_agents.py:234\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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. 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s11_autonomous_agents.py"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ed3cf92b429d3f12c27222c8562c5f808f9f430ac51a6f90b4a7e538528a09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): s13_agent_teams/code.py:1126-1136 | s15_integrated_harness/code.py:1262-1272 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"e546a9023312e93d9b9e8b744d5a9acd467501251c350574fbca69d08bc01a31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 8): s04_hooks/code.py:230-239 | s05_todo_write/code.py:305-314 | s06_subagent/code.py:288-297 | s06_subagent/code.py:341-350 | s07_skill_loading/code.py:357-366 | s08_context_compact/code.py:570-578 | s10_task_system/code.py:558-567 | s11_background_tasks/code.py:503-512 \u2014 \u0060s04_hooks/code.py\u0060 and \u0060s05_todo_write/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 16 separate duplicated blocks between them, totalling at least 162 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s04_hooks/code.py"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"d07ad3266a58c57ba1121b8860e5cefa35b1ffcc88aa2c80aa6364298548767b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): agents/s09_agent_teams.py:376-385 | agents/s10_team_protocols.py:457-466 | agents/s11_autonomous_agents.py:549-558 | agents/s12_worktree_task_isolation.py:754-765 \u2014 before extracting anything, compare \u0060agents/s09_agent_teams.py\u0060 and \u0060agents/s10_team_protocols.py\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 207 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s09_agent_teams.py"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07e654d4922066a23971a560e2514ec76f7ddd40442206babbbb4e1835ffa3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): s02_tool_use/code.py:121-130 | s03_permission/code.py:119-128 | s04_hooks/code.py:102-111 | s05_todo_write/code.py:104-113 \u2014 \u0060s02_tool_use/code.py\u0060 and \u0060s03_permission/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 9 separate duplicated blocks between them, totalling at least 87 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s02_tool_use/code.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"a306e5eadb44c89b5f676a7f74c9c69d4a1b4be8644c08d615d76e8b518f22c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): s04_hooks/code.py:163-172 | s05_todo_write/code.py:239-248 | s06_subagent/code.py:175-184 | s07_skill_loading/code.py:263-272 \u2014 \u0060s04_hooks/code.py\u0060 and \u0060s05_todo_write/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 16 separate duplicated blocks between them, totalling at least 162 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s04_hooks/code.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd600363ec0a211dd8a9ab063c09a5517cc133b405f3a30c96343778750c758"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 4): s08_context_compact/code.py:242-249 | s09_memory/code.py:713-722 | s10_task_system/code.py:535-544 | s12_cron_scheduler/code.py:623-631 \u2014 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 \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060s09_memory/code.py:727\u0060 calls \u0060load_memories\u0060, \u0060build_system\u0060 and \u0060s10_task_system/code.py:550\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s08_context_compact/code.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf52b1c2bf0af4ca520d9754c96f9615765e89dc307ad34d352055679eca6f44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): agents/s09_agent_teams.py:107-116 | agents/s10_team_protocols.py:117-126 | agents/s11_autonomous_agents.py:110-119 \u2014 before extracting anything, compare \u0060agents/s09_agent_teams.py\u0060 and \u0060agents/s10_team_protocols.py\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 207 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s09_agent_teams.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ee591b135bc4575b5a568f371cfb4a6be4218f311ff273b4cf1bde9a7b06ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): agents/s06_context_compact.py:219-227 | agents/s_full.py:710-719 \u2014 before extracting anything, compare \u0060agents/s06_context_compact.py\u0060 and \u0060agents/s_full.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 88 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060agents/s_full.py:708\u0060 calls \u0060inject_pending_notifications\u0060 and \u0060agents/s06_context_compact.py:218\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s06_context_compact.py"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d5824a6cd24596b68f74216bcabb0a04a0cb1726b86508c6115882b7cd65cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agents/s10_team_protocols.py:254-263 | agents/s11_autonomous_agents.py:334-343 \u2014 before extracting anything, compare \u0060agents/s10_team_protocols.py\u0060 and \u0060agents/s11_autonomous_agents.py\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 199 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060agents/s11_autonomous_agents.py:345\u0060 calls \u0060claim_task\u0060 and \u0060agents/s10_team_protocols.py:264\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s10_team_protocols.py"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"2023457dcaca3f21f3862a353e1ca1971d08532d2d75ab91dd17affe3efd5dc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): s13_agent_teams/code.py:371-380 | s15_integrated_harness/code.py:461-470 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"266bfbea64d704fb067e4847250e3c8c5b343ab00f40e266e4223fbfb5faa6d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 7): s06_subagent/code.py:110-118 | s07_skill_loading/code.py:195-203 | s08_context_compact/code.py:130-137 | s09_memory/code.py:594-602 | s10_task_system/code.py:333-341 | s11_background_tasks/code.py:188-196 | s12_cron_scheduler/code.py:116-124 \u2014 \u0060s06_subagent/code.py\u0060 and \u0060s07_skill_loading/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 17 separate duplicated blocks between them, totalling at least 168 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s06_subagent/code.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aabad1b9fbba2092cd08ec9de259aca29cb375af3585d63314a6bda8e53c816"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): agents/s01_agent_loop.py:82-93 | agents/s02_tool_use.py:122-130 | agents/s03_todo_write.py:172-181 | agents/s05_skill_loading.py:195-203 | agents/s07_task_system.py:211-219 | agents/s12_worktree_task_isolation.py:736-748 \u2014 before extracting anything, compare \u0060agents/s02_tool_use.py\u0060 and \u0060agents/s03_todo_write.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s01_agent_loop.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de5430484f120cc4804ad7acb5182396bd35af1d101f4a3490d774c63c912b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): s04_hooks/code.py:164-172 | s05_todo_write/code.py:240-248 | s06_subagent/code.py:176-184 | s07_skill_loading/code.py:264-272 | s10_task_system/code.py:464-472 | s11_background_tasks/code.py:269-277 \u2014 \u0060s04_hooks/code.py\u0060 and \u0060s05_todo_write/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 16 separate duplicated blocks between them, totalling at least 162 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s04_hooks/code.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4f67c81bb26acd3bb7c110bab00d182ee7f488abc261dee75c15757c70f45f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): agents/s03_todo_write.py:174-182 | agents/s06_context_compact.py:219-227 | agents/s_full.py:710-719 \u2014 before extracting anything, compare \u0060agents/s03_todo_write.py\u0060 and \u0060agents/s06_context_compact.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060agents/s_full.py:708\u0060 calls \u0060inject_pending_notifications\u0060 and \u0060agents/s06_context_compact.py:218\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s03_todo_write.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcdeef8cf59265277e79fac61355bcc4e6a499bd53fd59853f454dde139f0e29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): agents/s03_todo_write.py:188-195 | agents/s_full.py:728-736 \u2014 before extracting anything, compare \u0060agents/s03_todo_write.py\u0060 and \u0060agents/s_full.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 73 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s03_todo_write.py"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"121de820f0ddafd3692e2304be6a3e58faecb62029732ec10e5cdeeb0283e2c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): s13_agent_teams/code.py:785-793 | s15_integrated_harness/code.py:2828-2836 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be859316234ee75d51a38147f6d3dccc3396cd958f32dee59705b89f39791ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): s13_agent_teams/code.py:901-909 | s15_integrated_harness/code.py:1162-1170 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a4456ab849475bb9f1ba3236b814f40ab3937a783cffa694ea58c6d2b7a3d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): s13_agent_teams/code.py:1012-1020 | s15_integrated_harness/code.py:1708-1716 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060s13_agent_teams/code.py:1012\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44e7f76ecc8ee2bc749d384cbc0cca72773a2e3c3e5dce7d224722bb1835f35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): s13_agent_teams/code.py:1507-1514 | s15_integrated_harness/code.py:1773-1781 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":1507}}}],"partialFingerprints":{"codehealthFindingId/v1":"814b9bfb3539188a7b5a51b4e866aecb877b23b4c96d72b25eabbdd72d80938c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 10): agents/s02_tool_use.py:90-97 | agents/s03_todo_write.py:136-143 | agents/s04_subagent.py:92-99 | agents/s05_skill_loading.py:161-168 | agents/s06_context_compact.py:178-185 | agents/s07_task_system.py:168-175 | agents/s08_background_tasks.py:158-165 | agents/s12_worktree_task_isolation.py:531-538 | agents/s_full.py:117-124 | s02_tool_use/code.py:109-116 \u2014 before extracting anything, compare \u0060agents/s02_tool_use.py\u0060 and \u0060agents/s03_todo_write.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s02_tool_use.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c408da39c9b4b451d12ab00edb1fdd4a08f6cabe4179702667eab66facd5b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 10): agents/s03_todo_write.py:185-191 | agents/s05_skill_loading.py:206-212 | agents/s06_context_compact.py:236-242 | agents/s07_task_system.py:222-228 | agents/s08_background_tasks.py:240-246 | agents/s09_agent_teams.py:373-379 | agents/s10_team_protocols.py:454-460 | agents/s11_autonomous_agents.py:546-552 | agents/s12_worktree_task_isolation.py:751-758 | agents/s_full.py:725-731 \u2014 before extracting anything, compare \u0060agents/s03_todo_write.py\u0060 and \u0060agents/s05_skill_loading.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/s12_worktree_task_isolation.py:751\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060agents/s06_context_compact.py:233\u0060 calls \u0060get\u0060 and \u0060agents/s_full.py:724\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s03_todo_write.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cac55473aa5c1b60b0d93463f01b1920cf9e349934ca5543408ec938df9c8b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): s02_tool_use/code.py:126-133 | s03_permission/code.py:124-131 | s04_hooks/code.py:107-114 | s05_todo_write/code.py:109-116 | s06_subagent/code.py:114-121 | s07_skill_loading/code.py:199-206 \u2014 \u0060s02_tool_use/code.py\u0060 and \u0060s03_permission/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 9 separate duplicated blocks between them, totalling at least 87 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060s02_tool_use/code.py:126\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s02_tool_use/code.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"f29d0668942cbbaf32d920e055715d384e2c36c6dbffb87139e41313a0fa1d07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 6): s04_hooks/code.py:174-180 | s05_todo_write/code.py:250-256 | s06_subagent/code.py:186-193 | s07_skill_loading/code.py:274-281 | s10_task_system/code.py:474-481 | s11_background_tasks/code.py:279-286 \u2014 \u0060s04_hooks/code.py\u0060 and \u0060s05_todo_write/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 16 separate duplicated blocks between them, totalling at least 162 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s04_hooks/code.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"404a9037f6388cefec11adba714bce398e364cdae8fce37d3bf62f7ea45caa85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 4): agents/s01_agent_loop.py:71-77 | agents/s04_subagent.py:65-71 | s01_agent_loop/code.py:86-92 | s02_tool_use/code.py:69-76 \u2014 before extracting anything, compare \u0060agents/s04_subagent.py\u0060 and \u0060s02_tool_use/code.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 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 \u0060agents/s01_agent_loop.py:71\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s01_agent_loop.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f7767cb49ac861dab438fc75af19b6725a898df7872e0dcfefd5ddc469f1d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): agents/s09_agent_teams.py:155-162 | agents/s10_team_protocols.py:165-172 | agents/s11_autonomous_agents.py:203-210 | agents/s_full.py:429-436 \u2014 before extracting anything, compare \u0060agents/s09_agent_teams.py\u0060 and \u0060agents/s10_team_protocols.py\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 207 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s09_agent_teams.py"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f21467b956d587cf8a8e9dd849e1d183eefb13aeae23ee712831dd0b86b18a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): agents/s06_context_compact.py:219-226 | agents/s08_background_tasks.py:230-237 | agents/s_full.py:710-718 \u2014 before extracting anything, compare \u0060agents/s06_context_compact.py\u0060 and \u0060agents/s08_background_tasks.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060agents/s_full.py:708\u0060 calls \u0060inject_pending_notifications\u0060 and \u0060agents/s06_context_compact.py:218\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s06_context_compact.py"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"3539c266ed3cb33429660b9662ac8c54d1fd5f253b42612d0fe4973113d9e321"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): agents/s09_agent_teams.py:305-312 | agents/s10_team_protocols.py:346-353 | agents/s11_autonomous_agents.py:432-439 \u2014 before extracting anything, compare \u0060agents/s09_agent_teams.py\u0060 and \u0060agents/s10_team_protocols.py\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 207 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s09_agent_teams.py"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"252a73d3583c9f73f4f0e738df89ab4d7ee2e70813264e7045a5d608dc1a12c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/s09_agent_teams.py:200-207 | agents/s11_autonomous_agents.py:261-268 \u2014 before extracting anything, compare \u0060agents/s09_agent_teams.py\u0060 and \u0060agents/s11_autonomous_agents.py\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 178 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s09_agent_teams.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"243e177693a23a674d8cd46cb7fddbaa12aaf085ed4163ca8b0de553fd4b7244"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agents/s10_team_protocols.py:359-366 | agents/s11_autonomous_agents.py:445-452 \u2014 before extracting anything, compare \u0060agents/s10_team_protocols.py\u0060 and \u0060agents/s11_autonomous_agents.py\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 199 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s10_team_protocols.py"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ccd372254b02d5870a4d1075157a1d343b363fe68e423da836800eff3eede7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): s13_agent_teams/code.py:221-228 | s15_integrated_harness/code.py:313-320 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bbebdb57851eb25f3ca61e77d9f7443b042da6e47a9913c6520ebcb93e08cbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): s13_agent_teams/code.py:718-725 | s14_mcp_plugin/code.py:107-114 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s14_mcp_plugin/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 36 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9085a2c921f679fe553a64b25f11e56ba583484942cd208a34e1c14ae28c90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): s13_agent_teams/code.py:878-886 | s15_integrated_harness/code.py:1140-1148 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060s13_agent_teams/code.py:878\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f73bf8302750b0b4424fcd96d265413689f6187ef957b11ee49b518261b7b91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): s13_agent_teams/code.py:1784-1791 | s14_mcp_plugin/code.py:476-483 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s14_mcp_plugin/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 36 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":1784}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b629f7c65f82fac5994531f79e9bc15a0d3d1b83389404ee3c50f66a452d41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): s14_mcp_plugin/code.py:179-188 | s15_integrated_harness/code.py:2661-2670 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s14_mcp_plugin/code.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"c931dd2a47d0b04cd20a69f2f86b711690bbb87d0e1e3a88e68cf31d2265e84b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 19): agents/s02_tool_use.py:92-98 | agents/s03_todo_write.py:138-144 | agents/s04_subagent.py:94-100 | agents/s05_skill_loading.py:163-169 | agents/s06_context_compact.py:180-186 | agents/s07_task_system.py:170-176 | agents/s08_background_tasks.py:160-166 | agents/s09_agent_teams.py:307-313 | agents/s10_team_protocols.py:348-354 | agents/s11_autonomous_agents.py:434-440 | agents/s12_worktree_task_isolation.py:533-539 | agents/s_full.py:119-125 | s02_tool_use/code.py:111-117 | s03_permission/code.py:109-115 | s04_hooks/code.py:93-99 | s05_todo_write/code.py:95-101 | s06_subagent/code.py:99-105 | s07_skill_loading/code.py:184-190 | s15_integrated_harness/code.py:1006-1012 \u2014 before extracting anything, compare \u0060agents/s02_tool_use.py\u0060 and \u0060agents/s03_todo_write.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s02_tool_use.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62417aa8ea6d834b6e2382f4821a947c28b3c23107c6a3fc7db106d51b246a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 10): s03_permission/code.py:107-113 | s04_hooks/code.py:91-97 | s05_todo_write/code.py:93-99 | s06_subagent/code.py:97-103 | s07_skill_loading/code.py:182-188 | s08_context_compact/code.py:118-124 | s09_memory/code.py:583-589 | s10_task_system/code.py:321-327 | s11_background_tasks/code.py:176-182 | s12_cron_scheduler/code.py:104-110 \u2014 \u0060s03_permission/code.py\u0060 and \u0060s04_hooks/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 9 separate duplicated blocks between them, totalling at least 78 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s03_permission/code.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3963bb8c85ba7aaf5d5ae74a4e15cbdb1c914fd49f6866dd0341357d834b47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): s03_permission/code.py:97-103 | s04_hooks/code.py:82-88 | s05_todo_write/code.py:84-90 | s06_subagent/code.py:87-93 | s07_skill_loading/code.py:172-178 \u2014 \u0060s03_permission/code.py\u0060 and \u0060s04_hooks/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 9 separate duplicated blocks between them, totalling at least 78 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s03_permission/code.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43effb38bf3d43da5d42a94f7d16e4e1c1e62d0072c1ef21a45dc6c63bbafa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): s08_context_compact/code.py:108-114 | s09_memory/code.py:574-580 | s10_task_system/code.py:311-317 | s11_background_tasks/code.py:166-172 | s12_cron_scheduler/code.py:94-100 \u2014 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 \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s08_context_compact/code.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"b695264426e32758a5d0b6009303898c394b9b364057278085a63bea1193fc6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): s12_cron_scheduler/code.py:290-296 | s15_integrated_harness/code.py:2422-2428 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s12_cron_scheduler/code.py"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"5152445bf988355ea9cb41a9441194b7604ea39d8e23a52f181b8d3f4e599641"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): s13_agent_teams/code.py:705-711 | s15_integrated_harness/code.py:993-999 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f201147b945178861538d5ce6df9d79025595250dbfcfe68b1ff57ee721565"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): s13_agent_teams/code.py:1721-1727 | s14_mcp_plugin/code.py:412-418 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s14_mcp_plugin/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 36 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":1721}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb9f2848d87da7c5b7628d1615e7c959e73b3eebe310bac899880b286312e0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): s15_integrated_harness/code.py:1485-1491 | s15_integrated_harness/code.py:2840-2846 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s15_integrated_harness/code.py"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"30fed66afeced57218167e020cd64a7e79a3a35c987188d91ec5837df63ea492"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 11): s02_tool_use/code.py:125-131 | s03_permission/code.py:123-129 | s04_hooks/code.py:106-112 | s05_todo_write/code.py:108-114 | s06_subagent/code.py:113-119 | s07_skill_loading/code.py:198-204 | s08_context_compact/code.py:133-138 | s09_memory/code.py:598-603 | s10_task_system/code.py:337-342 | s11_background_tasks/code.py:192-197 | s12_cron_scheduler/code.py:120-125 \u2014 \u0060s02_tool_use/code.py\u0060 and \u0060s03_permission/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 9 separate duplicated blocks between them, totalling at least 87 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060s02_tool_use/code.py:125\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s02_tool_use/code.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"7890848cd84cce0e12541c4966e3260ed28b780d91edd75e6b1d1a6e26a93435"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): s06_subagent/code.py:189-195 | s07_skill_loading/code.py:277-283 | s08_context_compact/code.py:210-216 | s09_memory/code.py:665-671 | s10_task_system/code.py:477-483 | s11_background_tasks/code.py:282-288 \u2014 \u0060s06_subagent/code.py\u0060 and \u0060s07_skill_loading/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 17 separate duplicated blocks between them, totalling at least 168 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s06_subagent/code.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9415fc3bb018ad6e522d4d1384737954294d297c0876e84f0cca7b903624a0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agents/s03_todo_write.py:71-76 | s05_todo_write/code.py:148-153 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060agents/s03_todo_write.py:70\u0060 calls \u0060str\u0060, \u0060get\u0060 and \u0060s05_todo_write/code.py:147\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s03_todo_write.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e871b45cb9a2fc9e5f3a646173ab81de3f4a475fae30d95835b80d1902542e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): s10_task_system/code.py:274-279 | s13_agent_teams/code.py:333-338 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s10_task_system/code.py"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a72f306e9d5d7eb0510fea2443cc1dd738baca493f74990a5d4463a3f7fe55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): s13_agent_teams/code.py:996-1001 | s15_integrated_harness/code.py:1294-1299 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1bd3dbc5af4f3447f80cfaa8e18133fb3c28d913418f94f5a59c8e4f848a85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 14): agents/s02_tool_use.py:55-60 | agents/s03_todo_write.py:106-110 | agents/s04_subagent.py:60-64 | agents/s05_skill_loading.py:131-135 | agents/s06_context_compact.py:148-152 | agents/s07_task_system.py:138-142 | agents/s08_background_tasks.py:128-132 | agents/s09_agent_teams.py:270-275 | agents/s10_team_protocols.py:311-316 | agents/s11_autonomous_agents.py:397-402 | agents/s12_worktree_task_isolation.py:492-501 | agents/s_full.py:87-91 | s02_tool_use/code.py:64-69 | skills/agent-builder/references/tool-templates.py:161-172 \u2014 before extracting anything, compare \u0060agents/s02_tool_use.py\u0060 and \u0060agents/s03_todo_write.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agents/s02_tool_use.py:55\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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. 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s02_tool_use.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b98990d4c9792dd5bba0ace4ea4f6db6793fc6e86ea0f7226e790cda57cd4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 11): agents/s03_todo_write.py:120-124 | agents/s04_subagent.py:76-80 | agents/s05_skill_loading.py:145-149 | agents/s06_context_compact.py:162-166 | agents/s07_task_system.py:152-156 | agents/s08_background_tasks.py:142-146 | agents/s09_agent_teams.py:287-291 | agents/s10_team_protocols.py:328-332 | agents/s11_autonomous_agents.py:414-418 | agents/s12_worktree_task_isolation.py:513-517 | agents/s_full.py:101-105 \u2014 before extracting anything, compare \u0060agents/s03_todo_write.py\u0060 and \u0060agents/s04_subagent.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s03_todo_write.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"2147b6c4b768912189ae21dd776eea8305db770d744864eff96120ad54c280f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 7): s02_tool_use/code.py:91-95 | s03_permission/code.py:89-93 | s04_hooks/code.py:75-79 | s05_todo_write/code.py:77-81 | s06_subagent/code.py:79-83 | s07_skill_loading/code.py:164-168 | s13_agent_teams/code.py:697-701 \u2014 \u0060s02_tool_use/code.py\u0060 and \u0060s03_permission/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 9 separate duplicated blocks between them, totalling at least 87 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s02_tool_use/code.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"02438e4c99c32db03bdf38594050010f9f8851e9528499dea1fb7492718f96f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): s08_context_compact/code.py:100-104 | s10_task_system/code.py:303-307 | s11_background_tasks/code.py:158-162 | s12_cron_scheduler/code.py:86-90 \u2014 \u0060s08_context_compact/code.py\u0060 and \u0060s10_task_system/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 97 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s08_context_compact/code.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a870f9a67f8df3bf991389251a55cbec9a9877aeadbc619fae0d1ec8602cf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): s04_hooks/code.py:72-77 | s11_background_tasks/code.py:155-160 | s12_cron_scheduler/code.py:83-88 \u2014 \u0060s04_hooks/code.py\u0060 and \u0060s11_background_tasks/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 9 separate duplicated blocks between them, totalling at least 85 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s04_hooks/code.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a81f45c787a3e12dafea5fc4c97814a80af7996fe0d5d1edafb191685061af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): s13_agent_teams/code.py:124-130 | s15_integrated_harness/code.py:216-222 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c340a9c8858e556ef6b5bbd96180dac50b0f2db3c41b31246a6266953ac7d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): agents/s02_tool_use.py:80-86 | agents/s_full.py:108-114 | s02_tool_use/code.py:99-105 \u2014 before extracting anything, compare \u0060agents/s02_tool_use.py\u0060 and \u0060agents/s_full.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s02_tool_use.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ebac33192da293ada67f6200ac435c9fcea95939b8ec225eb679055cd889f1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 7): agents/s03_todo_write.py:127-133 | agents/s04_subagent.py:83-89 | agents/s05_skill_loading.py:152-158 | agents/s06_context_compact.py:169-175 | agents/s07_task_system.py:159-165 | agents/s08_background_tasks.py:149-155 | agents/s12_worktree_task_isolation.py:521-527 \u2014 before extracting anything, compare \u0060agents/s03_todo_write.py\u0060 and \u0060agents/s04_subagent.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s03_todo_write.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"08cd935c7f175590b285091f8bf037fb8d7c9704d274b3efd9f93c64cf3df6c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): agents/s09_agent_teams.py:119-124 | agents/s10_team_protocols.py:129-134 | agents/s11_autonomous_agents.py:122-127 | agents/s_full.py:391-396 \u2014 before extracting anything, compare \u0060agents/s09_agent_teams.py\u0060 and \u0060agents/s10_team_protocols.py\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 207 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s09_agent_teams.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c7ebbd4a50cf13415bee3a56d14ddb2ded4c9a9635236fdd5b4aef7f1aa059"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): agents/s09_agent_teams.py:133-137 | agents/s10_team_protocols.py:143-147 | agents/s11_autonomous_agents.py:175-179 \u2014 before extracting anything, compare \u0060agents/s09_agent_teams.py\u0060 and \u0060agents/s10_team_protocols.py\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 207 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s09_agent_teams.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5519a520576288e9ca2d3d9577c8e61d27831d393efebbffbb7f811cfe0dd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): agents/s09_agent_teams.py:295-301 | agents/s10_team_protocols.py:336-342 | agents/s11_autonomous_agents.py:422-428 \u2014 before extracting anything, compare \u0060agents/s09_agent_teams.py\u0060 and \u0060agents/s10_team_protocols.py\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 207 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s09_agent_teams.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"063689c33697c2f6da24d139a58262ed23a3d18c550ba61e68151c6bd4168c4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): s13_agent_teams/code.py:157-168 | s15_integrated_harness/code.py:249-260 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b2de98d8ef6f612b83f695cb6bdc9f57b889e3992336c94bae49dea28cb9df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): s13_agent_teams/code.py:232-238 | s15_integrated_harness/code.py:324-330 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"10490b27d79054213c515b827ee1e2f3c7bd8fda1be95ed90530c5e8ee9b6967"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): s13_agent_teams/code.py:269-278 | s15_integrated_harness/code.py:359-368 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"9082b1af541eccb0b6bcd60525582a67b2e2c5e21710dea7af40a77b4539ed2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): s13_agent_teams/code.py:349-354 | s15_integrated_harness/code.py:439-444 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a1b9f8f1696b1f78d20502c4ca061e34c6ea3804543b4cef51bfb20535f396"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): s13_agent_teams/code.py:358-363 | s15_integrated_harness/code.py:448-453 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"247bda0caa933924245e6ed3e8f4641f243e138b5c39550b4aa7b6f635273306"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): s13_agent_teams/code.py:665-669 | s15_integrated_harness/code.py:875-879 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"7147cd2d3723eb979f97d8335cc421f64d66bd7cd398e0087a36b6c4574803f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): s13_agent_teams/code.py:822-827 | s15_integrated_harness/code.py:2858-2863 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac7db4b15e21b0243a0309f128b96a4008a224dad9810457d7273109247bf31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): s13_agent_teams/code.py:831-836 | s15_integrated_harness/code.py:2866-2871 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15dd5f0ff92b469f323488b82993a3a80c412763d908b140d94a1d339a08b68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): s13_agent_teams/code.py:860-865 | s15_integrated_harness/code.py:1122-1127 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4e89e9ab6aa891760ea6e521c7d10c13d24856faa285b35a5606dfca852ddd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): s13_agent_teams/code.py:868-874 | s15_integrated_harness/code.py:1130-1136 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"44bf6ec506f67663c23267c5f76930ed65c894339ec0f10fd09c7b1684e16496"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): s13_agent_teams/code.py:1113-1117 | s15_integrated_harness/code.py:1376-1380 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1670c374c9b3f0b5a000468fa7c29755f9f7bd7946750f38f7d04581b7c8842"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): s13_agent_teams/code.py:1146-1154 | s15_integrated_harness/code.py:1282-1290 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae0d21f6cf77e5dc6c573b82f94b7732a321c003b21355328a024ad0ecd2008"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): s13_agent_teams/code.py:1449-1455 | s15_integrated_harness/code.py:2880-2886 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a336cbf9254079b7ed85b28f77634eb1361dbfce3a4b9e5012891905a76690a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): s13_agent_teams/code.py:1484-1489 | s15_integrated_harness/code.py:1750-1755 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":1484}}}],"partialFingerprints":{"codehealthFindingId/v1":"32084ce41ca9679af39d710dd3946da7fa738d2fc465fddbaa17798507fea519"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): s14_mcp_plugin/code.py:191-197 | s15_integrated_harness/code.py:2673-2679 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s14_mcp_plugin/code.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"0122d423a2be8efe71b9ba81b1e327e3b0b55f8b2c9a796c16554fbe24c6b568"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): s13_agent_teams/code.py:813-818 | s15_integrated_harness/code.py:2850-2855 \u2014 \u0060s13_agent_teams/code.py\u0060 and \u0060s15_integrated_harness/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 44 separate duplicated blocks between them, totalling at least 613 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"97396e9bc74f2eea5406ad1950269e8d5727b0788986c90a2599722f3ebc1dfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agents/s06_context_compact.py:111-115 | agents/s_full.py:250-254 \u2014 before extracting anything, compare \u0060agents/s06_context_compact.py\u0060 and \u0060agents/s_full.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 88 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s06_context_compact.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a79635358a025d808bf63b955c83d6066c7e6f6e7ed30aa381896f2c8ba130e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): s02_tool_use/code.py:180-185 | s03_permission/code.py:243-248 \u2014 \u0060s02_tool_use/code.py\u0060 and \u0060s03_permission/code.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 9 separate duplicated blocks between them, totalling at least 87 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s02_tool_use/code.py"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"995fa8ac198899f01ff880863c7a094962f93550826047f5541d13050dee2ebe"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: s08_context_compact/code.py: s08_context_compact/code.py changed 15 times in last 90 days and 13 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is ContextCompactor.snip_compact at line 398), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(s08): preserve the complete active request after compaction (#603)\u201D; \u201Cfix: add hysteresis to message-count compaction (#582)\u201D; \u201Cfix: an empty REPL line no longer quits the chapter silently (#569)\u201D; \u201Cfix(s08): recognize Anthropic prompt overflow errors (#561)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 22:41:46 \u002B09:00\u0027 --until=\u00272026-11-15 22:41:46 \u002B09:00\u0027 --full-history --no-merges -- s08_context_compact/code.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s08_context_compact/code.py"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"03dbefa5edac19bf7cba694cc96426f415b60ad7c6f412e929d824503d7b31e2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: s11_background_tasks/code.py: s11_background_tasks/code.py changed 12 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is code.permission_hook at line 268), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(s11): document unreachable else branch in inject_background_results (#584)\u201D; \u201Cfix: an empty REPL line no longer quits the chapter silently (#569)\u201D; \u201Cfix: keep s11 and s15 process cleanup working on Windows (#586)\u201D; \u201Cfix: harden destructive command matching\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 22:41:46 \u002B09:00\u0027 --until=\u00272026-11-15 22:41:46 \u002B09:00\u0027 --full-history --no-merges -- s11_background_tasks/code.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s11_background_tasks/code.py"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"9546edfc313d53ef52a668304f527efb96d40b666bcef71224e3d3e31e0272df"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: s10_task_system/code.py: s10_task_system/code.py changed 11 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is TaskStore.update_dependencies at line 147), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: an empty REPL line no longer quits the chapter silently (#569)\u201D; \u201Cfix: harden destructive command matching\u201D; \u201Cfix(s03): match Windows del as a command word\u201D; \u201Cfix: harden subprocess output decoding across lessons\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 22:41:46 \u002B09:00\u0027 --until=\u00272026-11-15 22:41:46 \u002B09:00\u0027 --full-history --no-merges -- s10_task_system/code.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s10_task_system/code.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a13894e2cdf7a1b61b444161df832e9d01fcaf6904534aefe15ce9cdcfaff7e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: s03_permission/code.py: s03_permission/code.py changed 11 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is code.agent_loop at line 219), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: an empty REPL line no longer quits the chapter silently (#569)\u201D; \u201Cfix: harden destructive command matching\u201D; \u201Cfix(s03): match Windows del as a command word\u201D; \u201Cfix: harden subprocess output decoding across lessons\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 22:41:46 \u002B09:00\u0027 --until=\u00272026-11-15 22:41:46 \u002B09:00\u0027 --full-history --no-merges -- s03_permission/code.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s03_permission/code.py"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5005c1f70146b2c28c601069023fe2bd07252249bb221de821736a92eb07197"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: s04_hooks/code.py: s04_hooks/code.py changed 10 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is code.permission_hook at line 162), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: an empty REPL line no longer quits the chapter silently (#569)\u201D; \u201Cfix: harden destructive command matching\u201D; \u201Cfix(s03): match Windows del as a command word\u201D; \u201Cfix: harden subprocess output decoding across lessons\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 22:41:46 \u002B09:00\u0027 --until=\u00272026-11-15 22:41:46 \u002B09:00\u0027 --full-history --no-merges -- s04_hooks/code.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s04_hooks/code.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecbe550858f4ceb8dd9b3d6965127399faa8d841c36d057e80e2c3e7cbbcb9b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: s05_todo_write/code.py: s05_todo_write/code.py changed 10 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is TodoManager.update at line 125), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: an empty REPL line no longer quits the chapter silently (#569)\u201D; \u201Cfix: harden destructive command matching\u201D; \u201Cfix(s03): match Windows del as a command word\u201D; \u201Cfix: harden subprocess output decoding across lessons\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 22:41:46 \u002B09:00\u0027 --until=\u00272026-11-15 22:41:46 \u002B09:00\u0027 --full-history --no-merges -- s05_todo_write/code.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s05_todo_write/code.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe3f9852c9da81ab2d06955ceac7445bec481d94b888d47e7de85a69072068a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: s06_subagent/code.py: s06_subagent/code.py changed 10 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is code.permission_hook at line 174), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: an empty REPL line no longer quits the chapter silently (#569)\u201D; \u201Cfix: harden destructive command matching\u201D; \u201Cfix(s03): match Windows del as a command word\u201D; \u201Cfix: harden subprocess output decoding across lessons\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 22:41:46 \u002B09:00\u0027 --until=\u00272026-11-15 22:41:46 \u002B09:00\u0027 --full-history --no-merges -- s06_subagent/code.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s06_subagent/code.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f34b4d5f7c23a4b0a0f137d7ea9b92416f886113c9267e86924dd0308b2fd1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: s07_skill_loading/code.py: s07_skill_loading/code.py changed 10 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is code.permission_hook at line 262), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: an empty REPL line no longer quits the chapter silently (#569)\u201D; \u201Cfix: harden destructive command matching\u201D; \u201Cfix(s03): match Windows del as a command word\u201D; \u201Cfix: harden subprocess output decoding across lessons\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 22:41:46 \u002B09:00\u0027 --until=\u00272026-11-15 22:41:46 \u002B09:00\u0027 --full-history --no-merges -- s07_skill_loading/code.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s07_skill_loading/code.py"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4a2e58222e302ccdb70fe29747b6bfb6430aac245f99d677abf9408e7cdb57"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: s14_mcp_plugin/code.py: s14_mcp_plugin/code.py changed 8 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is code.permission_hook at line 403), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: keep tool input from overriding the MCP handler\u0027s tool (#613)\u201D; \u201Cfix: an empty REPL line no longer quits the chapter silently (#569)\u201D; \u201Cfix: harden destructive command matching\u201D; \u201Cfix(s03): match Windows del as a command word\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 22:41:46 \u002B09:00\u0027 --until=\u00272026-11-15 22:41:46 \u002B09:00\u0027 --full-history --no-merges -- s14_mcp_plugin/code.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s14_mcp_plugin/code.py"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b8482347ea7c729b4d74df332c8c4a8c16432dded6d149b2818b8ec8d63ee4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: s02_tool_use/code.py: s02_tool_use/code.py changed 7 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is code.agent_loop at line 163), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: an empty REPL line no longer quits the chapter silently (#569)\u201D; \u201Cfix: harden subprocess output decoding across lessons\u201D; \u201Cfix: complete readline prompt coverage\u201D; \u201Cfix: use UTF-8 for text file operations\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 22:41:46 \u002B09:00\u0027 --until=\u00272026-11-15 22:41:46 \u002B09:00\u0027 --full-history --no-merges -- s02_tool_use/code.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s02_tool_use/code.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f539a3a26735f9804183c1a04eaee6cc0c9b862971c5fac8574b19c5961041f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: s17_goal_loop/code.py: s17_goal_loop/code.py changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is code._parse_json_object at line 185), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: harden destructive command matching\u201D; \u201Cfix(s03): match Windows del as a command word\u201D; \u201Cfix: harden subprocess output decoding across lessons\u201D; \u201Cfix: support bounded recursive glob across lessons\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 22:41:46 \u002B09:00\u0027 --until=\u00272026-11-15 22:41:46 \u002B09:00\u0027 --full-history --no-merges -- s17_goal_loop/code.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s17_goal_loop/code.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b6f1d322e8d8ea7c9eb028fda2b0bed9bd804da0da7f024a27ba3e07e3f803"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: s01_agent_loop/code.py: s01_agent_loop/code.py changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is code.run_bash at line 80), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: an empty REPL line no longer quits the chapter silently (#569)\u201D; \u201Cfix: harden subprocess output decoding across lessons\u201D; \u201Cfix: complete readline prompt coverage\u201D; \u201Cfix: preserve wrapped input display in colored prompts\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 22:41:46 \u002B09:00\u0027 --until=\u00272026-11-15 22:41:46 \u002B09:00\u0027 --full-history --no-merges -- s01_agent_loop/code.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s01_agent_loop/code.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f842a64d26fc237f2405f748b1fc9674693deb9d6579c29178d5ef104f6fe96"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: skills/agent-builder/references/minimal-agent.py: skills/agent-builder/references/minimal-agent.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is minimal-agent.execute_tool at line 67), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(agent-builder): replace retired Sonnet 4 default (#602)\u201D; \u201Cfix: harden subprocess output decoding across lessons\u201D; \u201Cfix: use UTF-8 for text file operations\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 22:41:46 \u002B09:00\u0027 --until=\u00272026-11-15 22:41:46 \u002B09:00\u0027 --full-history --no-merges -- skills/agent-builder/references/minimal-agent.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/agent-builder/references/minimal-agent.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"df595225fb7c38b3c0c86ff693db81902f6cdcebb40ffbe127380e5b2253d238"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: skills/agent-builder/scripts/init_agent.py: skills/agent-builder/scripts/init_agent.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is init_agent.create_agent at line 220), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(agent-builder): replace retired Sonnet 4 default (#602)\u201D; \u201Cfix: harden subprocess output decoding across lessons\u201D; \u201Cfix: use UTF-8 for text file operations\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 22:41:46 \u002B09:00\u0027 --until=\u00272026-11-15 22:41:46 \u002B09:00\u0027 --full-history --no-merges -- skills/agent-builder/scripts/init_agent.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/agent-builder/scripts/init_agent.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5bdd65d9d03d01266ae2cd3405651c3f347efa3fa2230455fee59327f388bdd"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: agents/s02_tool_use.py: agents/s02_tool_use.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is s02_tool_use.agent_loop at line 121), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: harden subprocess output decoding across lessons\u201D; \u201Cfix: complete readline prompt coverage\u201D; \u201Cfix: use UTF-8 for text file operations\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 22:41:46 \u002B09:00\u0027 --until=\u00272026-11-15 22:41:46 \u002B09:00\u0027 --full-history --no-merges -- agents/s02_tool_use.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s02_tool_use.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"868fc0f4b149b9573664ed06c799a8eadab5ae3fce8e7eb7dc8e937b9b2d9593"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: agents/s03_todo_write.py: agents/s03_todo_write.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is s03_todo_write.agent_loop at line 170), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: harden subprocess output decoding across lessons\u201D; \u201Cfix: complete readline prompt coverage\u201D; \u201Cfix: use UTF-8 for text file operations\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 22:41:46 \u002B09:00\u0027 --until=\u00272026-11-15 22:41:46 \u002B09:00\u0027 --full-history --no-merges -- agents/s03_todo_write.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s03_todo_write.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6b4e671fbfb235998e3eaeae6266e49a62eee78875aae72d3695f6bf837201"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: agents/s04_subagent.py: agents/s04_subagent.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is s04_subagent.run_subagent at line 124), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: harden subprocess output decoding across lessons\u201D; \u201Cfix: complete readline prompt coverage\u201D; \u201Cfix: use UTF-8 for text file operations\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 22:41:46 \u002B09:00\u0027 --until=\u00272026-11-15 22:41:46 \u002B09:00\u0027 --full-history --no-merges -- agents/s04_subagent.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s04_subagent.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"69935b68c9ff98f50396893b082584c9dfec48c3733ddf30da1032a3a1183ac3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: agents/s05_skill_loading.py: agents/s05_skill_loading.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is s05_skill_loading.agent_loop at line 194), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: harden subprocess output decoding across lessons\u201D; \u201Cfix: complete readline prompt coverage\u201D; \u201Cfix: use UTF-8 for text file operations\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 22:41:46 \u002B09:00\u0027 --until=\u00272026-11-15 22:41:46 \u002B09:00\u0027 --full-history --no-merges -- agents/s05_skill_loading.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s05_skill_loading.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4edb9a6d12fc94ef021a50e832d3ef0c50d7d54e9640e45a8c2abc21f6a8ec"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: agents/s07_task_system.py: agents/s07_task_system.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is TaskManager.update at line 85), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: harden subprocess output decoding across lessons\u201D; \u201Cfix: complete readline prompt coverage\u201D; \u201Cfix: use UTF-8 for text file operations\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 22:41:46 \u002B09:00\u0027 --until=\u00272026-11-15 22:41:46 \u002B09:00\u0027 --full-history --no-merges -- agents/s07_task_system.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s07_task_system.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccefe8443138baeeec2bcf1b33491148295882d11cb6cd776ccbed9aaff506c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: agents/s08_background_tasks.py: agents/s08_background_tasks.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is s08_background_tasks.agent_loop at line 224), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: harden subprocess output decoding across lessons\u201D; \u201Cfix: complete readline prompt coverage\u201D; \u201Cfix: use UTF-8 for text file operations\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 22:41:46 \u002B09:00\u0027 --until=\u00272026-11-15 22:41:46 \u002B09:00\u0027 --full-history --no-merges -- agents/s08_background_tasks.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s08_background_tasks.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"8adcfdf168b1bd17d25ab765efd68d6b4fccef3332ea741bc786eaacb1cb1e55"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: agents/s09_agent_teams.py: agents/s09_agent_teams.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is TeammateManager._teammate_loop at line 173), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: harden subprocess output decoding across lessons\u201D; \u201Cfix: complete readline prompt coverage\u201D; \u201Cfix: use UTF-8 for text file operations\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 22:41:46 \u002B09:00\u0027 --until=\u00272026-11-15 22:41:46 \u002B09:00\u0027 --full-history --no-merges -- agents/s09_agent_teams.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s09_agent_teams.py"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0bca029509effed8fffabc859bfa022591215e331b21e31b1ba73ac728e6b34"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: agents/s10_team_protocols.py: agents/s10_team_protocols.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is TeammateManager._teammate_loop at line 183), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: harden subprocess output decoding across lessons\u201D; \u201Cfix: complete readline prompt coverage\u201D; \u201Cfix: use UTF-8 for text file operations\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 22:41:46 \u002B09:00\u0027 --until=\u00272026-11-15 22:41:46 \u002B09:00\u0027 --full-history --no-merges -- agents/s10_team_protocols.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s10_team_protocols.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f90397de349a7ad80de1e9e806f82f19139bac9fc411ea6ca81225f637c6d2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: agents/s12_worktree_task_isolation.py: agents/s12_worktree_task_isolation.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is WorktreeManager.remove at line 400), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: harden subprocess output decoding across lessons\u201D; \u201Cfix: complete readline prompt coverage\u201D; \u201Cfix: use UTF-8 for text file operations\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 22:41:46 \u002B09:00\u0027 --until=\u00272026-11-15 22:41:46 \u002B09:00\u0027 --full-history --no-merges -- agents/s12_worktree_task_isolation.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s12_worktree_task_isolation.py"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e9f5987a80e6241c95677b9ca4edda6c5abc5f044cb84edb769119fb882a16"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 1 significant file(s) lose their only recent owner: web/src/components/architecture/message-flow.tsx. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"56929366b1e226ac4554d087c734e379c074848c4043e4b7572d829071e51ee4"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060web/package.json\u0060 makes this repository a deployable product (line 8)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/package.json"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"84075e64f6463eb78eaa4f46487334eb87dfbfad6b926437345e444d899c8999"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060(repository root)\u0060 (16089 LoC, 92 module-visible types across 21 directories) overshoots its size bounds. 2 of 2 build unit(s) (Python, npm) overshoot their size bounds, lowering Project Cohesion to 0.0/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"requirements.txt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b5e6c5b01689366dfd955e9a5982baa6d1574c50f60c029ab1c2f9e36ca22e"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060web\u0060 (10148 LoC, 70 module-visible types across 23 directories) overshoots its size bounds. 2 of 2 build unit(s) (Python, npm) overshoot their size bounds, lowering Project Cohesion to 0.0/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/package.json"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ea941af3f901551a092032ec144fc221c4f79efdf006625aecd57cda1f6e02"}},{"ruleId":"D27","level":"note","message":{"text":"Scattered collaborators: 59 % of calls cross a namespace and only 39 % of collaborators are co-located \u2014 group each feature\u0027s code into a vertical slice so a call\u0027s collaborators sit together."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5aad4a4530bac3928d3a065a664be89d023ecfc865f9bf79ac05754b3bffe322"}},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"95740b583969c78c7132f35629806263a32606dcd6d14eefa8ad5abaeaae0af3"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b0225ae7e4051a121655972b6d89c50b7d49f8f98798df05122fafdbb3f51fa5"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"daac2e80a07f507c1a1509852b0956ed6f3822132f250ec3f5b0b84ee3b263fb"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"92b4793abf6a27507aa18a50d767ad14516f56520a6ee8890130ba3863b7d6ad"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f9a6ff8ab4d34f6e16657c50a6ac6fe7e7002986ae2b63d96d038085e40ceba9"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bedb180d6384cd775c6912312371e9fbd6706eb51c8692a44bb7228e916b508c"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"76ad064153f6efafae353603c0aecd59ad78748af69a4077c2e2e0ca6a2e6310"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cfa59c482448142215d42acecf773c9767c85b2eccf011bdd46a6196a3c2cc87"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"43f3d08567c23cc12075443becb36d96a99224b99577c97d018cb710806bebdb"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"df2147b4fa2555227927cf6642002b706cfeef8c03b3f0350a107f2dadc67937"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"36a9b397caa4667d260dce8dbdaff9818c160cc56ee7cf251acc825324b6477a"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a89c4bff9b8a6c34ac5f6ff382958cd5ebba67ebde22319e745b9cd345f158e6"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1d9b6c896208ac22ab9367b70466bdd6b52378d40f7e3a54c357bba2e137bf6b"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"467062fc72112d8ec457a0d39097731ba58c6c95ae0ed3d8f8064a30842ff2f3"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e5e42fc047c1e1ba4132053ed0e7757c339f67c971548714e90421ccab350ee1"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9e900e4bf3cad9cd9ab74c2bcec110835b0d2993bf2612677e2ae556c39c35fe"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6fa64f185a1c85b9bb0ddf7d508a29c7e4e9ebb834cd5cf48ebfc54882d6621d"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c588a57f7184e023996aa07678b98b8615788e8e85996c673acf63043c0c9a9e"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4e1a380641c51d5af649a96ab7a139e60c6d939dfb2d0407eb1e53d94e04ce00"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"009b57c098c16505168ad0971ce861b352557d285eee86762a4e172f94804c6a"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb99e0450eb69c62d1de05c53247943a37c3afbb6e91e077f258c10269a646e2"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1e1cda71a6bcc656e964050281ae2ba38df1716d4077f57fbccdff38cfa65510"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f0c028ee8c7672f46821092c735332b69597ec00edc8f7b91089091b5da042ce"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dd0843520df506f2b0da2c443ce7548a50c0b59678cab732e8aa0933d7ffd519"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"26f9553eb0f4aa0e0c70e9ffe441cf212f9664f7bf2dbf5278a8b10edc7d7e4c"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ab0c1ccc3accd9a86bc2cf1890b6b2ea901c76b3e51782604bc07eac58d88d90"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fc6e7eee7a57f7902903b83c79a28933670a87130d256b32371b736d34038d7e"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"487d013b4cdfa990df5254f3ca6aa6094144342f7d499e9fbf5a0d39c9151259"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"673784b8777ee9f494293a15afa56892032f4963f33a58af6b5e233d479723ff"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2a385e9ab0cb4011f371417d065d3ba79c1be25e7628058daaf06db7fed077d9"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"85b3412dcc60de6e2d3cce19c2a90b49cb0b5a3a94b0f63be120f145e6ddb8c0"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c91411a1ff0e9f70e64fa54c1995526348fcfcba60416d6b04b6a89c1d99f08f"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7e34c99ca704b24024b113a8a44e0639f2d07d5c6c2cc63d93566ad80e524e47"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"634b79760d1e594c8caa3fd51371618c24ac753fb38a7e4da0aae53f532dc8b2"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d721d20b2e5fd96a83a7a623c40951d1cb75e8654a6ae6c732f58384cf5fce2d"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"192b4cb2845f1160d229f616145295b8e25ff6e02572a2b4906b7b58f6e720fe"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"65adaa6c2aee0c0f4f375961b34d03c0cc67ad23af57cb09187c422cc8228660"},"properties":{"dependency":{"package":"next","version":"16.1.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"09e1a034a94e116ef5347ca00688be213b4f0228dbe2d238acba0554130c5013"},"properties":{"dependency":{"package":"postcss","version":"8.4.31","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"711c4e9cf779dd433c4a4a91861f53d305b48806978bdb99e8cbdb9cb84a8c1e"},"properties":{"dependency":{"package":"postcss","version":"8.5.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1e9ee378e72035a1797d10fd2130a16450e4218c92a5784ea83210eae13f2db5"},"properties":{"dependency":{"package":"sharp","version":"0.34.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ee3e3bfa62853de557957e0fd209dfdfddcb9911baa05b20b824ee12ef5f34e6"},"properties":{"dependency":{"package":"source-map-js","version":"1.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"55527a0e11714ea007f56860c1c4ac905e3661a61b3a3efb849af04978c76b87"},"properties":{"dependency":{"package":"baseline-browser-mapping","version":"2.9.19","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9b5b5be64bde41e7f025ac9d5f56e11a85f7f4d30911886f9356cf69b4245715"},"properties":{"dependency":{"package":"esbuild","version":"0.27.3","advisory":"[GHSA redacted]","reachability":{"kind":"not-imported"}}}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 29 of 73 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 73 of the 90 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: web/src/components/visualizations/s11-background-tasks.tsx, web/src/components/visualizations/s08-context-compact.tsx, web/src/components/visualizations/s07-skill-loading.tsx, web/src/components/visualizations/s01-agent-loop.tsx, skills/agent-builder/references/tool-templates.py, web/src/components/visualizations/s02-tool-dispatch.tsx, skills/agent-builder/references/subagent-pattern.py, web/src/app/[locale]/(learn)/compare/page.tsx (and 21 more). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s11-background-tasks.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd50261f0e836f4a38542e5533470908ece59a6af70fae25c493e633c715e73"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s08-context-compact.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d0c03545a7cf46198b4c0e12b8345ad9c6e844cdb6bfe8e7ccaa4f455cb80d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s07-skill-loading.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3def43a49f30c69fccac2921a2a8bd2237dd264fc39be6e77bb55faa15c91da8"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s01-agent-loop.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec87d61d33cc8178a8691d9292119c49c8fce892441e3bee2a141323cde5aa1"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s02-tool-dispatch.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c799d08f9016f51f5dbbd98cc2a5fd6431caa91f6b951e69703be6c015fadd"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/[locale]/(learn)/compare/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0104117a4938a5d02c85f3f655575a81fcf169823ef51addaf76f1d02a9e575"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s03-todo-write.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4212fac259898cdca7ec1ae5f7b881f7438e7cad15dda792c8102c1f712300"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s06-subagent.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"934a5d887ae9cf5f16c34ddfcd6714f7a892553c5bd9e7a6ed7cab1c81310330"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/[locale]/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c08fa6d81e50e325f8cc61664d15928962ae886243666d8a6bde86b8c5d8cb2"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/agent-builder/references/tool-templates.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7c4a076038541ae6705db578a9d8c48e8904bcedbd51711a3b0d2bb2332243"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/timeline/timeline.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9689ba99cdb16f896afa9535a4cb321c200901a556db3915d3d2667e490bdb6"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/agent-builder/references/subagent-pattern.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2178432a2721b2f93c0f444fb295da6a62e6c16547340a87ff764ab82e542488"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/[locale]/(learn)/[version]/diff/diff-content.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90a7a142d034789a0600ed2a6a91d92858d8f5fb0ded065a0a59ad0596ca638"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/architecture/arch-diagram.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f747e4b79df8cb785f1db70b48d88179c05c8554d86acdb13bc74a9283f1456"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/diff/code-diff.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c73dd19498ea92a2178bda44b1dea0bff62746e6eee7702282a587a54b5437a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/layout/header.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9adecdacee49bf17f925c48ea5ed67339c8f4bfb84e40fa4cfaaff856ea9c07"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/architecture/design-decisions.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae1cfd36a27dc41273602e8de15d9bdc7e50ff1176edecaba049520fa33d4c7"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/[locale]/(learn)/layers/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d804ce0cd269d17a09f87569c1f20e2620c7a9e248d1c6bf77aa69d2a6e7cdc1"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/simulator/agent-loop-simulator.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"767e8a968cd2cdffd34f338de6122114814cf9d59a1ee87ff4da9f9bb16cf2af"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/[locale]/(learn)/[version]/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f65d6e5b7ad59b06544aa0943edf920343829faf2e50a99b22470e40b59abc"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/agent-builder/references/minimal-agent.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1280752946715f7da664a222afb120425e5dfcd62c4301876c0f0015ba3904"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s01_agent_loop.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd954223119f665daa5a960e5b7b46b2e449a161a97b55b64e486374f4e6a97"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/diff/whats-new.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9b7a50ded6cd7c12404d601eb6b6d28c7c15588027b1bdaa31b59622ae7985"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/code/source-viewer.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5b1e73d29b9ff4125b6c64b1bc894bac72782b57fcae2b19ed0e3639d4d691"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/shared/step-controls.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e621a4e558041c5a79ffa21b7b8e53c1fd20dce540486f3dfc73ac1b266b0f0d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/simulator/simulator-controls.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1748befab4f751b2e732590aaacb3bb29161668c2c019c489d31dbcf0391db"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/simulator/simulator-message.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6281019d817a2e51222c4f86b0a61721170a3ab74daee270f866e864ab12d860"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/[locale]/(learn)/[version]/client.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"417070bb5bab8d09b80c82508fe36da6aa31afca4107f1bfd76297b66891ac91"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/layout/sidebar.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db29b04888de981cca23e5a8ab9485f805b6e16d02e409948465fad4b5d2efe"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90ef8645d5d250a2cdd6c4ddecf434c2439a3eaf0b71b0b76b3e93b4d1bb9e49"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bee16a916192bc47803c755fa5c777c01a15fb56e69ce46b43bdf718adcb77fa"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/[locale]/(learn)/compare/page.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de8f884b05462a3d40e2cec13399e1ad3ff61199ccbc1c8ea574fb66d408697"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/[locale]/(learn)/compare/page.tsx"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e5e74d71d11990ab6f10efad91af132e0fb5a06dc402967b0657def8d999c7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/[locale]/(learn)/compare/page.tsx"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"776a4e01a9205b866215671cd2865067d0be3d6861201f0bcccf4a5c1262da73"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/[locale]/(learn)/compare/page.tsx"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"753a5de96fa46826918f5ff3a6b4425ec95018f3112ff4e1a294b042439cfa28"}},{"ruleId":"AC2","level":"error","message":{"text":"Link with no accessible name: A link with no text, aria-label or labelled child (e.g. an icon-only link) has no accessible name, so assistive tech can\u0027t say where it goes. Add visible text or an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/layout/header.tsx"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"661a0ee03710a67de751e438d99845e0bfbfb2fe6d7ee8386c0bf996ebec7f66"}},{"ruleId":"AC3","level":"warning","message":{"text":"Data table has no header cells: A \u003Ctable\u003E with data cells but no \u003Cth\u003E gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as \u003Cth\u003E (with a scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/diff/code-diff.tsx"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe85761b612dc71a44118e21f6ac26e53836f3e469d915c7e97352884923d0a8"}},{"ruleId":"AC3","level":"warning","message":{"text":"Data table has no header cells: A \u003Ctable\u003E with data cells but no \u003Cth\u003E gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as \u003Cth\u003E (with a scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/diff/code-diff.tsx"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c4c30a72d6f8e8de2bf1eebd17f7ba8e1e339269b8fbbeb4dda24c6d4a8514"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast Tailwind colour pair (3.8:1): This element\u0027s Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s03-permission.tsx"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4bba348d12b6a089324ee895c630a634f9298d490db0d45636a073c93ff305b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast Tailwind colour pair (2.5:1): This element\u0027s Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s04-hooks.tsx"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e86ff4a5fca30365121e36b05524dd15da5cb36b589cc8deeffb4ed807b703"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast Tailwind colour pair (4.1:1): This element\u0027s Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s06-subagent.tsx"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe87c68e6428030f22c44d8f77088eff056724081b8eb4bf952729a0baa9be1"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast Tailwind colour pair (2.5:1): This element\u0027s Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s06-subagent.tsx"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce86817d72258f5eb28c3c848059bc626d9c2c45495f1ce7952c8677caf5861e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast Tailwind colour pair (2.4:1): This element\u0027s Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s07-skill-loading.tsx"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"e521bf9703794d7d54c3d9843a43c1419eed6d6f487adc55367d28ad26b057be"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast Tailwind colour pair (4.3:1): This element\u0027s Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s07-skill-loading.tsx"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e48ec2d6ff11af284b78ca093a9598f862d60ef7a832f1fc4507164695e68ed"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast Tailwind colour pair (4.4:1): This element\u0027s Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s09-memory.tsx"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"368585daf264f59f06ced9945c24384e718f1fad3f3a0798527f085820ab2966"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast Tailwind colour pair (4.4:1): This element\u0027s Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s09-memory.tsx"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"9561f324aedee0f6516adf53dc06af40b26926d483f489a6e7f8fe9f23609883"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast Tailwind colour pair (4.4:1): This element\u0027s Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s09-memory.tsx"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6e1c332df31cefb31093a74ddc4c4214d8813585c88ad775a389d70326b2fc"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast Tailwind colour pair (3.8:1): This element\u0027s Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s12-cron-scheduler.tsx"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16d319275fae2d6cd49e47510579546ca14947b5a35c50a812879a441489640"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast Tailwind colour pair (2.5:1): This element\u0027s Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s14-mcp-tools.tsx"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa93b2b425c74b78ec9892ba1003bd6c156c3d481dea610955a587e6d1b325a"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast Tailwind colour pair (4.4:1): This element\u0027s Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s14-mcp-tools.tsx"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a6530edc7542163b1ec2a3dc73d5db7bc34cf4c5fe6b620319031da3c9464f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast Tailwind colour pair (3.8:1): This element\u0027s Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s15-integrated-harness.tsx"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29fc29841a20ec7f30ca39ba75a08f7de05abeeadc645927e835ea8511fa3a7"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast Tailwind colour pair (4.4:1): This element\u0027s Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s15-integrated-harness.tsx"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dad44baadce7425d31f2b02b5b1d331db6119003325e4230688ed54f5d25bbf"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.7:1): \u0060.prose-custom pre.code-block::before\u0060 sets color: #ffffff on background-color: #3b82f6 \u2014 3.7:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/globals.css"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"904471760125a64f2da546a503e3209948773b5d334bcc3a17aa0f7cf874385a"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 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."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P2","level":"warning","message":{"text":"No structured logging: No logging call was found in the 89 Python, JavaScript/TypeScript production file(s) this check read across 2 module(s). Each was searched for its ecosystem\u0027s logging libraries (Python: logging, structlog, loguru; JavaScript/TypeScript: pino, winston, bunyan, log4js, loglevel, consola, the NestJS Logger) and for a call on a receiver named \u0060log\u0060/\u0060logger\u0060 (or ending in \u0060Logger\u0060/\u0060_logger\u0060) with a level verb. It cannot see logging through a repo-local wrapper named otherwise, or in source it did not read \u2014 this is \u0027no logging found by this walk\u0027, not a verdict that nothing here logs. If it is right, production issues will be hard to diagnose."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add bandit, \u0060semgrep --config=p/python\u0060, or CodeQL\u0027s python pack as a CI step. What was searched, so you can tell an absence from a miss: the 2 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/ci.yml"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060web/package.json\u0060 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 \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/package.json"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"7178352a8ea9a573c4063ab0352651773041b8c2dd828213fd3516e72480bf29"}},{"ruleId":"P4","level":"note","message":{"text":"No release approval gate: The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy \u2014 all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 6 sibling directories (6 clone groups): 6 duplicated blocks under web/src/components/ have copies in at least two of the sibling directories architecture, diff, layout, simulator, ui, visualizations \u2014 5 of them are reported below, and 1 is counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 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 6 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 6 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 6 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/layout/header.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7437bdcaf33711c0759aeb2a0efc57b9c194fdc149eaeb59e41b5dfc5f21a25"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (73 matched lines \u00D7 2 locations): web/src/app/[locale]/(learn)/[version]/diff/diff-content.tsx:89 \u00B7 web/src/app/[locale]/(learn)/compare/page.tsx:155 \u2014 the two spans are one implementation copied and then locally edited \u2014 443 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\u0027s 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/[locale]/(learn)/[version]/diff/diff-content.tsx"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d71bfc8a13b1495a3830eeb9bede243cd1cbde9b7e656fee9fdc9d075a68165"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2 locations): web/src/components/visualizations/s03-permission.tsx:77 \u00B7 web/src/components/visualizations/s04-hooks.tsx:84 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s03-permission.tsx"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"607dc0ed9702972cc363921cc14f1b74d4c5997f4da2f33ab3f8daf8b5ffa712"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2 locations): web/src/components/visualizations/s04-hooks.tsx:84 \u00B7 web/src/components/visualizations/s12-cron-scheduler.tsx:44 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s04-hooks.tsx"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0688fa3e3288bb1e9ea0c87302f58ef369c60d8d4daa78c534b8883590c7736"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (36 matched lines \u00D7 2 locations): web/src/components/visualizations/s12-cron-scheduler.tsx:207 \u00B7 web/src/components/visualizations/s14-mcp-tools.tsx:190 \u2014 the two spans are one implementation copied and then locally edited \u2014 187 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\u0027s 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s12-cron-scheduler.tsx"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"451f9f893b75249b72f053007c4739e2095b2b5d258a50e57ab8beec372b611e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (23 matched lines \u00D7 2 locations): web/src/components/visualizations/s07-skill-loading.tsx:296 \u00B7 web/src/components/visualizations/s08-context-compact.tsx:386 \u2014 the two spans are one implementation copied and then locally edited \u2014 112 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\u0027s 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s07-skill-loading.tsx"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ac0951df36f0e9421575ced7bffb3913371dc71702109c4ed64e33d1ff780c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): web/src/components/visualizations/s06-subagent.tsx:286 \u00B7 web/src/components/visualizations/s08-context-compact.tsx:475 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s06-subagent.tsx"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"462019d483b9edd6bb11ae5e64d3c3e03235a84b5e2952448cafd8fababc0bf9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): web/src/components/visualizations/s03-permission.tsx:258 \u00B7 web/src/components/visualizations/s03-permission.tsx:283 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s03-permission.tsx"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e16b1829f14180257ef8c49ea2c7ad6c6c02c238c5148274555f59cc2b1511"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): web/src/components/visualizations/s09-memory.tsx:111 \u00B7 web/src/components/visualizations/s14-mcp-tools.tsx:97 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s09-memory.tsx"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"5199b40d26745358f869fb8444a5a4c94b01ae6d7b532e3511e310e6fe72e3ae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): web/src/app/[locale]/(learn)/compare/page.tsx:61 \u00B7 web/src/app/[locale]/(learn)/compare/page.tsx:80 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/[locale]/(learn)/compare/page.tsx"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bdd690d2a979e4f8c67bbba7159079727e038ac61ed2824cacae2462c24526a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): web/src/app/[locale]/(learn)/compare/page.tsx:235 \u00B7 web/src/app/[locale]/(learn)/compare/page.tsx:259 \u2014 all 2 copies are in the same file, 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 \u2014 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\u0027s 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/[locale]/(learn)/compare/page.tsx"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb29022d6b7868ca403e70fc9e9956ddd71eddffafc55e215f5adb61cddefb64"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3 locations): web/src/components/layout/header.tsx:72 \u00B7 web/src/components/layout/header.tsx:129 \u00B7 web/src/components/ui/tabs.tsx:18 \u2014 the 2 copies are spread across 2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/layout/header.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"639af1a9163c26ba4c7b6c9e5d6830cc4e9d2f3b99dde2c9a632a961122e0764"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 4 locations): web/src/components/visualizations/s01-agent-loop.tsx:399 \u00B7 web/src/components/visualizations/s02-tool-dispatch.tsx:363 \u00B7 web/src/components/visualizations/s03-todo-write.tsx:306 \u00B7 web/src/components/visualizations/s11-background-tasks.tsx:607 \u2014 the 4 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 4 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 \u2014 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 \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s01-agent-loop.tsx"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6cf6cb9f6b35b29eb2a1bd5a72e371aab75705f526ea64a40c39901073d1057"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 8 locations): web/src/components/visualizations/s03-permission.tsx:369 \u00B7 web/src/components/visualizations/s04-hooks.tsx:252 \u00B7 web/src/components/visualizations/s09-memory.tsx:375 \u00B7 web/src/components/visualizations/s10-task-system.tsx:197 \u00B7 \u002B4 more site(s) not listed \u2014 the 8 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 8 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 \u2014 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 \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s03-permission.tsx"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed1db14cf9b357a0da988a96a4146dff2e7c2b20c4de7c4518def378ab9a09e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 6 locations): web/src/app/[locale]/(learn)/[version]/diff/diff-content.tsx:104 \u00B7 web/src/app/[locale]/(learn)/[version]/diff/diff-content.tsx:125 \u00B7 web/src/app/[locale]/(learn)/[version]/diff/diff-content.tsx:146 \u00B7 web/src/app/[locale]/(learn)/compare/page.tsx:170 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 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 \u2014 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\u0027s 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/[locale]/(learn)/[version]/diff/diff-content.tsx"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c98e5a78245fb823c2b321c34c27cda8fa6ae0505252522712f8d4ebc3d1bc7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): web/src/components/visualizations/shared/mechanism-flow.tsx:127 \u00B7 web/src/components/visualizations/shared/mechanism-flow.tsx:163 \u2014 all 2 copies are in the same file, 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 \u2014 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\u0027s 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/shared/mechanism-flow.tsx"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"066cae1524ae1c69c91323fdbd48d5cb849e19af66dbf5cf1f2466a4762cf929"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): web/src/components/visualizations/s07-skill-loading.tsx:231 \u00B7 web/src/components/visualizations/s07-skill-loading.tsx:273 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s07-skill-loading.tsx"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10cc5bab45d731270162a0ab4296751858ad2bd1eeb5e25df2c321c5fb46b59"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): web/src/app/[locale]/(learn)/compare/page.tsx:179 \u00B7 web/src/app/[locale]/(learn)/compare/page.tsx:200 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/[locale]/(learn)/compare/page.tsx"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac16b2f2fb6c9adeb6d0b13526b78f353cf6730c8625d80a95d41e780dde8c8d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): web/src/components/visualizations/s01-agent-loop.tsx:196 \u00B7 web/src/components/visualizations/s02-tool-dispatch.tsx:190 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s01-agent-loop.tsx"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f189768b0fa6879baba0302b602ca3f501c9e2c7b8f86511ccd7a901d73600"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): web/src/components/visualizations/s06-subagent.tsx:65 \u00B7 web/src/components/visualizations/s07-skill-loading.tsx:87 \u00B7 web/src/components/visualizations/s08-context-compact.tsx:222 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s06-subagent.tsx"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60f408dcaad68fabac243d3781aab2bfaa25b01ec1f0e6099da5ea199c8d88b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): web/src/app/[locale]/(learn)/compare/page.tsx:164 \u00B7 web/src/app/[locale]/(learn)/compare/page.tsx:185 \u00B7 web/src/app/[locale]/(learn)/compare/page.tsx:206 \u2014 all 3 copies are in the same file, 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 \u2014 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\u0027s 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/[locale]/(learn)/compare/page.tsx"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"0994f5f82e8eca37db1a81aeb132db08b501749201ab17bf118100029edcd26f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): web/src/components/diff/whats-new.tsx:56 \u00B7 web/src/components/diff/whats-new.tsx:80 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/diff/whats-new.tsx"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f2997f1913b1a1ba51eace834af8f7e482f44d37af671caa094eb9c87cf6a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): web/src/components/visualizations/s01-agent-loop.tsx:133 \u00B7 web/src/components/visualizations/s03-todo-write.tsx:216 \u00B7 web/src/components/visualizations/s11-background-tasks.tsx:148 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s01-agent-loop.tsx"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d5717385a587c5f23d01904f96530fc18220d0bd15a0d7590401e213ba3c0a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): web/src/app/[locale]/page.tsx:25 \u00B7 web/src/components/timeline/timeline.tsx:24 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/[locale]/page.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff011025c172f3cf25d0dc06cd174cc648c1833db74002103acb4a815da57d3f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): web/src/app/[locale]/page.tsx:62 \u00B7 web/src/app/[locale]/page.tsx:125 \u00B7 web/src/app/[locale]/page.tsx:138 \u00B7 web/src/app/[locale]/page.tsx:182 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/[locale]/page.tsx"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce8944ebff2ee2f7f26ef0d04efb8462ece59937caa1e03d8b83de630e63992"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): web/src/components/visualizations/s01-agent-loop.tsx:289 \u00B7 web/src/components/visualizations/s01-agent-loop.tsx:323 \u2014 all 2 copies are in the same file, 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 \u2014 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\u0027s 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s01-agent-loop.tsx"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1086bedb42aa68fe052605e213b7d856a963e4aae8aa31fd3e7dae04524f70b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): web/src/components/visualizations/s03-todo-write.tsx:234 \u00B7 web/src/components/visualizations/s10-task-system.tsx:160 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s03-todo-write.tsx"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe52346dc8594dd48c10b790ae26c9ee2eaa48363275fa4b2f32f0a9e96a2f0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): web/src/components/visualizations/s06-subagent.tsx:100 \u00B7 web/src/components/visualizations/s07-skill-loading.tsx:104 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s06-subagent.tsx"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"02708a8344e5dcf701a3efdd48bdb6567953d126e51f5ba4dad8a065a9f05aa5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): web/src/components/visualizations/s09-memory.tsx:319 \u00B7 web/src/components/visualizations/s15-integrated-harness.tsx:288 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s09-memory.tsx"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"33018c773a5653ba24638e72be5b3610bcf08f91ad4012a67076b9ce26bb251a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): web/src/components/visualizations/s15-integrated-harness.tsx:400 \u00B7 web/src/components/visualizations/shared/mechanism-flow.tsx:289 \u2014 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 \u2014 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\u0027s 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s15-integrated-harness.tsx"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b8f5915f0d6d769d779d21164d1115fe5dac7b60c2bc2b172cd6eb0d33ec10"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): web/scripts/extract-content.ts:57 \u00B7 web/scripts/extract-content.ts:89 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/extract-content.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"3967cec9f824fab236c87afd8f7bcaaf28d7b7bf8e8700aab4f42c206c1402d5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): web/src/app/[locale]/(learn)/compare/page.tsx:105 \u00B7 web/src/app/[locale]/(learn)/compare/page.tsx:116 \u2014 all 2 copies are in the same file, 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 \u2014 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\u0027s 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/[locale]/(learn)/compare/page.tsx"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"0537262a47fcd8e99663d9e29edd3f019f138a12208e7724f79a57ee826a59a4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): web/src/app/[locale]/(learn)/compare/page.tsx:150 \u00B7 web/src/app/[locale]/(learn)/compare/page.tsx:164 \u00B7 web/src/app/[locale]/(learn)/compare/page.tsx:185 \u00B7 web/src/app/[locale]/(learn)/compare/page.tsx:206 \u2014 all 4 copies are in the same file, 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 \u2014 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\u0027s 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/[locale]/(learn)/compare/page.tsx"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"d070c7660b9e5678c5d574c1314b006694749be8a305440ee95de698075854eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5 locations): web/src/components/architecture/execution-flow.tsx:224 \u00B7 web/src/components/architecture/execution-flow.tsx:255 \u00B7 web/src/components/architecture/execution-flow.tsx:288 \u00B7 web/src/components/visualizations/shared/mechanism-flow.tsx:123 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/architecture/execution-flow.tsx"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"056e220649ea77451ff0678f78697bd97d55cde1acba4ad9049863089854d315"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 9 locations): web/src/components/simulator/agent-loop-simulator.tsx:99 \u00B7 web/src/components/visualizations/s03-permission.tsx:375 \u00B7 web/src/components/visualizations/s04-hooks.tsx:258 \u00B7 web/src/components/visualizations/s09-memory.tsx:381 \u00B7 \u002B5 more site(s) not listed \u2014 the 9 copies are spread across 2 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 9 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 \u2014 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 \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/simulator/agent-loop-simulator.tsx"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"b932249a147c1d4151858add0a45260f791e85229c1d5d7e9a0cc3162a02056c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): web/src/components/visualizations/s07-skill-loading.tsx:168 \u00B7 web/src/components/visualizations/s07-skill-loading.tsx:183 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 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\u0027s 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 \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 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 \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s07-skill-loading.tsx"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5829718cf9c6565cec99bb11e29a6e16957624b2930e36ddc461d6d23f8b37"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): web/src/components/visualizations/s08-context-compact.tsx:63 \u00B7 web/src/components/visualizations/s08-context-compact.tsx:73 \u00B7 web/src/components/visualizations/s08-context-compact.tsx:83 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s08-context-compact.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d144a43aedb0d891605e411ce9699638ab0a634c65bf30e94f9b4467ab9d544e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): web/src/components/visualizations/s11-background-tasks.tsx:585 \u00B7 web/src/components/visualizations/s11-background-tasks.tsx:597 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s11-background-tasks.tsx"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"a73bd19c27c0c5d54531072d14fb45324a371398b1fd0ab0f0bb56eace0e8c97"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): web/scripts/extract-content.ts:310 \u00B7 web/scripts/extract-content.ts:347 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 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\u0027s 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 \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 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 \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/extract-content.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"05cbe9a9fd4c57303e2b7c4ab0a69e0b8b6fe698e1d3fa3f20e9562710273516"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): web/src/app/[locale]/(learn)/[version]/diff/diff-content.tsx:169 \u00B7 web/src/app/[locale]/(learn)/[version]/diff/diff-content.tsx:180 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/[locale]/(learn)/[version]/diff/diff-content.tsx"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c104708581e7446a8332720df56a806df1957e37d4b2f5db6a51b733a292ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): web/src/app/[locale]/(learn)/[version]/diff/page.tsx:4 \u00B7 web/src/app/[locale]/(learn)/[version]/page.tsx:8 \u2014 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 \u2014 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\u0027s 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/[locale]/(learn)/[version]/diff/page.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"598bb6d76eee9c8edb81ee59bacc7c8474b9cfc6712f3cb4152b371c6c2385c3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): web/src/components/diff/whats-new.tsx:73 \u00B7 web/src/components/visualizations/s04-hooks.tsx:140 \u2014 the 2 copies are spread across 2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/diff/whats-new.tsx"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aaee23239d92742f3feb8f9b80ed1fa1097a8ff6fd48d447cc46507938f65b9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): web/src/components/visualizations/s13-team-runtime.tsx:124 \u00B7 web/src/components/visualizations/s13-team-runtime.tsx:174 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s13-team-runtime.tsx"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"689d637cc14be8c8b4d5651b8f2dc0d244762586f95878fe0676893c1b2ad4bd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): web/src/app/[locale]/page.tsx:83 \u00B7 web/src/app/[locale]/page.tsx:93 \u00B7 web/src/app/[locale]/page.tsx:106 \u00B7 web/src/app/[locale]/page.tsx:114 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/[locale]/page.tsx"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"52343140e6dce3951cae0a82f521245c00845e4dd8ef5426d300f43742daa5f7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): web/src/components/visualizations/s03-permission.tsx:323 \u00B7 web/src/components/visualizations/s12-cron-scheduler.tsx:108 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s03-permission.tsx"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"251871991604715941e55de07a6e7968defec13f787952d76766c7c254d5ed07"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): web/src/app/[locale]/(learn)/compare/page.tsx:51 \u00B7 web/src/app/[locale]/(learn)/layers/page.tsx:33 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/[locale]/(learn)/compare/page.tsx"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c7b51ad866b2bda28dea417976988e8678ed99969e1ae3ea9eaaa1df93f7fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): web/src/components/architecture/execution-flow.tsx:133 \u00B7 web/src/components/architecture/execution-flow.tsx:183 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/architecture/execution-flow.tsx"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2cce7b3c1c4ba1706eacdc3cc0db46450dd90d35cd91c39ea1888d65cc7296"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5 locations): web/src/components/visualizations/s04-hooks.tsx:209 \u00B7 web/src/components/visualizations/s09-memory.tsx:211 \u00B7 web/src/components/visualizations/s10-task-system.tsx:153 \u00B7 web/src/components/visualizations/s13-team-runtime.tsx:238 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s04-hooks.tsx"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"72cae9c1d0574b6213c0a884e4f36358c7b3cd3512f2e17862605fd67a9908a3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): web/src/app/[locale]/(learn)/layers/page.tsx:37 \u00B7 web/src/app/[locale]/page.tsx:143 \u00B7 web/src/app/[locale]/page.tsx:187 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/[locale]/(learn)/layers/page.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d86632e9ace9d941b86866ae913dda33ce74255b72cf26d0fec7676df319855"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): web/src/components/architecture/execution-flow.tsx:177 \u00B7 web/src/components/visualizations/shared/mechanism-flow.tsx:86 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/architecture/execution-flow.tsx"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db4c50499731f591f93cb76f98bc0e8b78911c8147c3293750246e26ee2b90b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ComparePage (cyclomatic 24, cognitive 21): ComparePage has cyclomatic complexity 24 and cognitive complexity 21; 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 \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/[locale]/(learn)/compare/page.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f244059ba54bdadea920bc0ccfdecf1ab5ffbadd64d0bed4684373aa1d4172"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function CronSchedulerVisualization (cyclomatic 23, cognitive 21): CronSchedulerVisualization has cyclomatic complexity 23 and cognitive complexity 21; 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 \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s12-cron-scheduler.tsx"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6d01d2093ff7ec30fba38cfa43da62e81a56c546e2e2d8763b19a24eaa5fe3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assignmentBody (cyclomatic 19, cognitive 36): assignmentBody has cyclomatic complexity 19 and cognitive complexity 36; 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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/extract-content.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e83aabebfcf94fc8f6837411a3809a7ef07eef912a7a1cff3956e3c8faec208"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getEdgePath (cyclomatic 19, cognitive 27): getEdgePath has cyclomatic complexity 19 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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/architecture/execution-flow.tsx"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"1904b05d70f54ce41e930af69e2df5f71349412e4abe92f6155a2d3ef9a2611b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 22): (anonymous) has cyclomatic complexity 18 and cognitive complexity 22; 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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s01-agent-loop.tsx"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d7ae14b11c8e329abd9d518624e748538d5f362f5b81235b4c286ea775889a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SubagentIsolation (cyclomatic 16, cognitive 15): SubagentIsolation has cyclomatic complexity 16 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 \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s06-subagent.tsx"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb9c65463d9c3f19bc199bef55e863b737df297068367167543fbd04df222db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ContextCompact (cyclomatic 16, cognitive 15): ContextCompact has cyclomatic complexity 16 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 \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s08-context-compact.tsx"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e53ee15cdfacbf88e4577d506dfde1fff149d461cd52b9d107e4e6019a355d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function McpToolsVisualization (cyclomatic 16, cognitive 15): McpToolsVisualization has cyclomatic complexity 16 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 \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s14-mcp-tools.tsx"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf885f73b861ab14e166cd7e018512e1b9b1c0e43abd6ab7944cf91ed12333c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SkillLoading (cyclomatic 15, cognitive 14): SkillLoading has cyclomatic complexity 15 and cognitive complexity 14; 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 \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s07-skill-loading.tsx"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de296585abd13a89ba09751cc0dc846ed801864c10d68800744a5e47067eafa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function FlowNode (cyclomatic 14, cognitive 17): FlowNode has cyclomatic complexity 14 and cognitive complexity 17; 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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/shared/mechanism-flow.tsx"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf41091d159790f5f1f67bd418b631a6f809c706d08dbf6cd21f8b96a3454125"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function VersionPage (cyclomatic 14, cognitive 13): VersionPage has cyclomatic complexity 14 and cognitive complexity 13; 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 \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/[locale]/(learn)/[version]/page.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"65cdc8e5cd3fac77160a63c357a20ccca8c8b77250f8d68569231d67a32ed947"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) has cyclomatic complexity 14 and cognitive complexity 13; 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 \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/code/source-viewer.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2127d84992351fb601ae2783471d0dd74fb3b5f67396f6c140523759c6553c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function WorkspacePanel (cyclomatic 14, cognitive 13): WorkspacePanel has cyclomatic complexity 14 and cognitive complexity 13; 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 \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s13-team-runtime.tsx"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c029094f55d9da47cf7da4ef6058e2c07f2b222f22a7cf94404b6c8e530808e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function MemoryVisualization (cyclomatic 13, cognitive 12): MemoryVisualization has cyclomatic complexity 13 and cognitive complexity 12; 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 \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s09-memory.tsx"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"347f965760e631f9bd18d2e8df3b90c1fb826d672915edb1ee32191f9947b445"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 10): (anonymous) has cyclomatic complexity 13 and cognitive complexity 10; 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 \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/shared/mechanism-flow.tsx"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f581103ab405839fa2ad3c6cac748597270133342490c957deb5cb4f934117c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function DiffPageContent (cyclomatic 12, cognitive 11): DiffPageContent has cyclomatic complexity 12 and cognitive complexity 11; 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 \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/[locale]/(learn)/[version]/diff/diff-content.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"78557d78e0e3a84f2791492a337b7c2689acc6fb785dcef22480839bf7dad11d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; 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 \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s01-agent-loop.tsx"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"75bb8eec516151a775490c03aa8638fa013ee268620d801ca5f66ab7ce585a9d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RuntimePanel (cyclomatic 12, cognitive 11): RuntimePanel has cyclomatic complexity 12 and cognitive complexity 11; 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 \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s13-team-runtime.tsx"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"864dad8854c718981c5ec047506ed3e7f93caa680edb1a0d468a34b839abc9ac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function CheckRow (cyclomatic 12, cognitive 10): CheckRow has cyclomatic complexity 12 and cognitive complexity 10; 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 \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s03-permission.tsx"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b01acde49240c856c1855d2a571781f230cc3e7f50fe2460feb089420856ca0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SplitView (cyclomatic 11, cognitive 20): SplitView has cyclomatic complexity 11 and cognitive complexity 20; 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 \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/diff/code-diff.tsx"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efa9c9f2d5552c2a74f9013a041432634a65a3b0afdf0bcf18f066306482e7c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ToolDispatch (cyclomatic 11, cognitive 9): ToolDispatch has cyclomatic complexity 11 and cognitive complexity 9; 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 \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s02-tool-dispatch.tsx"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5fdf7f9607f3046304a3eee87345c92f50845a662e275e074e6a665642e9a8"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/components/visualizations/s11-background-tasks.tsx: 588 lines of code: web/src/components/visualizations/s11-background-tasks.tsx has 588 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s11-background-tasks.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef5df1b8f91b9b21d080863d09a78bb088b95419746dcf112b34e5e285d2513"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/components/visualizations/s08-context-compact.tsx: 471 lines of code: web/src/components/visualizations/s08-context-compact.tsx has 471 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s08-context-compact.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c82505af5beeed9330a064ee25253b875c317991595c93c40c38aa9a62db0a7"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/data/execution-flows.ts: 467 lines of code: web/src/data/execution-flows.ts has 467 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/data/execution-flows.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"881a30897890fbb9b4f990cf71985a1749a216633b36d17228a4dffc415d7927"}},{"ruleId":"R3","level":"warning","message":{"text":"web/scripts/extract-content.ts: 435 lines of code: web/scripts/extract-content.ts has 435 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/extract-content.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c47257f86c2f4d02336e796e8a0d5f3048b02e4d5c246a32c3173ac724654f06"}},{"ruleId":"R4","level":"warning","message":{"text":"Test Coverage: 0% of 54 production file(s) reachable from 0 test file(s) via the import graph \u2014 \u0027production\u0027 here is the RESIDUE: every source file left once tests, tooling, generated output, config, declarations and declaration-only modules, fixture corpora, type fixtures, behaviour-free data modules, re-export barrels, registration/constant data modules and service workers are set aside, so the percentage is taken over a smaller denominator than the workspace\u0027s file count"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"64e0e3511eb969fb4720b196e7d3799e1714077217351c3c56a27b50e3e21220"}},{"ruleId":"R6","level":"warning","message":{"text":"No lint script: test \u2713 \u00B7 lint \u2717 \u00B7 typecheck \u2713 \u2014 read from this repository\u0027s package.json scripts and corroborated against its CI workflows. A script counts when its name or command matches the step: \u0060test\u0060 for the suite, \u0060lint\u0060 or \u0060prettier\u0060 for linting, \u0060typecheck\u0060/\u0060type-check\u0060/\u0060tsc\u0060 for type checking. \u2717 therefore means no script or CI step under those names was found, NOT that the step is absent from your pipeline \u2014 a task invoked by a runner this check does not read, or named something else entirely, is not seen and is worth confirming before acting on a cross. A \u2713 means the wiring is DECLARED \u2014 a script or CI step under those names exists. It is not a statement that the step passes, or that it runs at all: nothing here installs a dependency or executes a suite."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bc8e67e81453cf5399dd04786d18b232180426b135169175fee670bdd83ccb03"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~301 LoC): no import path from any entry point (10 application, 2 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/shared/mechanism-flow.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be81a58e46325731e60411657e684a7c37beee202231e31a1374e301ed10a3d5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027VersionId\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/constants.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efd366fce801d249349cefc52c8155bff5808ce468001e0fab634f186b52415"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027LAYER_DOT_COLORS\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/[locale]/page.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"17847e1718f98acb14d81318ad37dc84695f87ecbf21c787cbb488e8015fdc02"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027getLayerColor\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/architecture/arch-diagram.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1d9045ffcacbdc4875d707ed44e029fb6bd5c1eeee44668ce300f7d7c2e0a4"}},{"ruleId":"S1","level":"note","message":{"text":"No security response headers detected: None of the 11 security response headers the OWASP Secure Headers Project recommends (Content-Security-Policy, Strict-Transport-Security, X-Content-Type-Options, X-Frame-Options, \u2026) is configured \u2014 defense in depth, even when a reverse proxy could set them. This is reported because \u0060vercel.json\u0060 configures this repository\u0027s static hosting, including its response headers, so the configuration that would carry these headers is in this repository and was read in full. (\u22122.0 on this card.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/vercel.json"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d97faa2d1910795a85ad50845bed494ce6406af2dee78faafe5728009af18b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dependency not in task.blockedBy and _task_depends_on( dependency, task_id )\u0060 appears character-identically in 2 files \u2014 s13_agent_teams/code.py, s15_integrated_harness/code.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3661ef2e6e41a440099b7c7d48c006ed6e85fe90252e2fef4d63b608c686cd3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060error or run_edit(path, old_text, new_text, cwd)\u0060 appears character-identically in 2 files \u2014 s13_agent_teams/code.py, s15_integrated_harness/code.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"af652f2670817ec1fa25fca43eb65088d6fefc8c4ef4bbc78854c4e496eff01f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060error or run_edit(path, old_text, new_text, cwd=cwd)\u0060 appears character-identically in 2 files \u2014 s13_agent_teams/code.py, s15_integrated_harness/code.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ace72be80a59c903e3afa6dbe56a647d12db1de6faab082ee29d3005853e5f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060error or run_write(path, content, cwd=cwd)\u0060 appears character-identically in 2 files \u2014 s13_agent_teams/code.py, s15_integrated_harness/code.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be3e551aa9e9d0770f649d2ff2269d366555ca66b01623d5259fad5e43e992b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060from_agent != state.target or to_agent != state.sender\u0060 appears character-identically in 2 files \u2014 s13_agent_teams/code.py, s15_integrated_harness/code.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"267a74040112856ae63331ee8499dc6c938d5e2f9e3cfd9ca8c1dc6efce1cdec"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060inbox.exists() and inbox.stat().st_size \u003E 0\u0060 appears character-identically in 2 files \u2014 s13_agent_teams/code.py, s15_integrated_harness/code.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8a1584f745ccc0270de6ac12e046c3d6728fb5eeaab0d25d27ec7f796e197e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(b, dict) and b.get(\u0022type\u0022) == \u0022tool_result\u0022\u0060 appears character-identically in 3 files \u2014 s04_hooks/code.py, s05_todo_write/code.py, s15_integrated_harness/code.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s04_hooks/code.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8910ea542a1c069bad628fa1b9250583c505b4617c52b1cfe7faac1ac52a162"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(block, dict) and block.get(\u0022type\u0022) == \u0022text\u0022\u0060 appears character-identically in 4 files \u2014 s12_cron_scheduler/code.py, s13_agent_teams/code.py, s14_mcp_plugin/code.py, s15_integrated_harness/code.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s12_cron_scheduler/code.py"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4765cb710c564f8a7fe5c064d8e7958eb29fb4aeec72c1581a566b31c1d8f72"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(block, dict) and block.get(\u0022type\u0022) == \u0022tool_result\u0022\u0060 appears character-identically in 11 files \u2014 s06_subagent/code.py, s07_skill_loading/code.py, s08_context_compact/code.py, s09_memory/code.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s06_subagent/code.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0091ec02bc4689e64762f133c5ec5581c7fab41917aaf4818fae4f8d9a9c9c6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(gates, dict) and owner in gates and gates[owner] != \u0022not_required\u0022\u0060 appears character-identically in 2 files \u2014 s13_agent_teams/code.py, s15_integrated_harness/code.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"a29bf0874787ea4a5ee6858b7f561af635abf0574dfb088c431278e1e87a3935"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(part, dict) and part.get(\u0022type\u0022) == \u0022tool_result\u0022\u0060 appears character-identically in 2 files \u2014 agents/s06_context_compact.py, agents/s_full.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s06_context_compact.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b8c1de33af4f2482aa155a05e5a250c7862772f9000056672c930c5a737531"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060messages and messages[-1].get(\u0022role\u0022) == \u0022user\u0022\u0060 appears character-identically in 3 files \u2014 agents/s08_background_tasks.py, agents/s_full.py, s11_background_tasks/code.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s08_background_tasks.py"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"a095588b5d5b822ce3a9c6cbc8c9656e8590ffe9b5cc9d48058c5e07666a3ca7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060messages[message_index].get(\u0022role\u0022) == \u0022user\u0022 and isinstance(messages[message_index].get(\u0022content\u0022), list)\u0060 appears character-identically in 2 files \u2014 s08_context_compact/code.py, s15_integrated_harness/code.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s08_context_compact/code.py"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbba4340215857b9e2b1fdb0c8bc9aee3332bbcccd29491acff8638acb203bbf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060msg.get(\u0022from\u0022) == \u0022lead\u0022 and msg.get(\u0022to\u0022) == name and state is not None and state.type == \u0022shutdown\u0022 and state.sender == \u0022lead\u0022 and state.\u2026\u0060 appears character-identically in 2 files \u2014 s13_agent_teams/code.py, s15_integrated_harness/code.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4777908240d28953781cc8347b8b302407eb15228b7c144eb6cca596689144d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060msg[\u0022role\u0022] == \u0022user\u0022 and isinstance(msg.get(\u0022content\u0022), list)\u0060 appears character-identically in 2 files \u2014 agents/s06_context_compact.py, agents/s_full.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s06_context_compact.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb1cc9f0af1782213c181aac5a8aeda0d23bc8984388d1730142f71f25933b5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not TASKS_ROOT.is_relative_to(WORKDIR.resolve()) or not path.is_relative_to(TASKS_ROOT)\u0060 appears character-identically in 2 files \u2014 s13_agent_teams/code.py, s15_integrated_harness/code.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c96ec5c34c02411c1b7b6b1253de1a6d1ebdc9796cba3d9dc98698695384372"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not WORKTREES_ROOT.is_relative_to(WORKDIR.resolve()) or not path.is_relative_to(WORKTREES_ROOT) or path == WORKTREES_ROOT\u0060 appears character-identically in 2 files \u2014 s13_agent_teams/code.py, s15_integrated_harness/code.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f7ee780cc6ddb5bd7fe4c4d29059fb3429bc2cb3cacb164eb36aa93d4ea264"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not assignment or assignment.get(\u0022task_id\u0022) != task.id\u0060 appears character-identically in 2 files \u2014 s13_agent_teams/code.py, s15_integrated_harness/code.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc24cbf4098054274edc08248bd3b7fafd4a54ef96c026eb25e132772928485"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not dep_path.exists() or load_task(dep_id).status != \u0022completed\u0022\u0060 appears character-identically in 2 files \u2014 s13_agent_teams/code.py, s15_integrated_harness/code.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6821abcb7eba4448f1dc97b10f20b0402907bff24ceee308085a496d52d9e3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(name, str) or not VALID_WORKTREE_NAME.fullmatch(name)\u0060 appears character-identically in 2 files \u2014 s13_agent_teams/code.py, s15_integrated_harness/code.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89326e24d4824248385d3c36ca545fa9fecd66cd41112b21e30befdb78e064d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(schema, dict) or schema.get(\u0022type\u0022, \u0022object\u0022) != \u0022object\u0022\u0060 appears character-identically in 2 files \u2014 s14_mcp_plugin/code.py, s15_integrated_harness/code.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s14_mcp_plugin/code.py"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30c7959df38a949a6eaf499e7182527314ad46cf27300675a4a9618ef4855a7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(task_id, str) or not TASK_ID_PATTERN.fullmatch(task_id)\u0060 appears character-identically in 3 files \u2014 s10_task_system/code.py, s13_agent_teams/code.py, s15_integrated_harness/code.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s10_task_system/code.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58331c1db94e3c261ae97b63765246ae5e25dee70ecca2b10251564dd3a86ec"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not lines or lines[0].rstrip(\u0022\\r\\n\u0022) != \u0022---\u0022\u0060 appears character-identically in 2 files \u2014 s07_skill_loading/code.py, s15_integrated_harness/code.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s07_skill_loading/code.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7accfd298fd6adc547a40c0ed48ce9414f43f491497cd2c17409c69d531f00"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not ok or Path(root).resolve() != WORKDIR.resolve()\u0060 appears character-identically in 2 files \u2014 s13_agent_teams/code.py, s15_integrated_harness/code.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a157c37d439143bf1ec65bf4dc7b9966fd7cc4e2de7349df734c45f0dfbaac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060output.startswith(prefix) and output.endswith(\u0022]\u0022)\u0060 appears character-identically in 2 files \u2014 s08_context_compact/code.py, s15_integrated_harness/code.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s08_context_compact/code.py"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd4bfa276a0c7240a05d95d688d3b9c74e055c48064eb67f065b9fe8e78a1a6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060re.sub(r\u0022[^A-Za-z0-9._-]\u0022, \u0022_\u0022, str(tool_use_id))[:120] or \u0022unknown\u0022\u0060 appears character-identically in 2 files \u2014 s08_context_compact/code.py, s15_integrated_harness/code.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s08_context_compact/code.py"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"7808b45db0bd7c30fb7f420b1ec14a9b54186508db1de84fbb302f87716c140a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060registry_error is None and path in entries\u0060 appears character-identically in 2 files \u2014 s13_agent_teams/code.py, s15_integrated_harness/code.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"941fede3127d95130eacfb87084a372d2be0bc75c8063c47c0edb8f3ed81fee5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060remaining is not None and remaining \u003C= 0\u0060 appears character-identically in 2 files \u2014 s13_agent_teams/code.py, s15_integrated_harness/code.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7dde2b328f28636d3c97ed1dc08c732fb6de4c6a0728b52c467ce474d80a6dd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state.work_version != work_version or state.task_id != task_id\u0060 appears character-identically in 2 files \u2014 s13_agent_teams/code.py, s15_integrated_harness/code.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6cd6deb2cd8b6c1f4917b5c8384679eab3f81a0aea37b2f79a3c7fbd8c3eb52"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060status != \u0022(no output)\u0022 and not discard_changes\u0060 appears character-identically in 2 files \u2014 s13_agent_teams/code.py, s15_integrated_harness/code.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"5afff768c3a0390c3a95589e722c317e1f211fe8524959cd800af42c4b129a52"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060t.status == \u0022pending\u0022 and t.blockedBy and can_start(t.id)\u0060 appears character-identically in 2 files \u2014 s13_agent_teams/code.py, s15_integrated_harness/code.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f72fe9477ab2acf01a68c9d19cbefc3fa2bf11f3c2f6c1634bac33aa8c3df03"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060task.status != \u0022completed\u0022 or task.owner != owner\u0060 appears character-identically in 2 files \u2014 s13_agent_teams/code.py, s15_integrated_harness/code.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"e152f787b72e2571bc09846a419b452db42c6410be0993f31402ff337c55651b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060task.status != \u0022pending\u0022 or task.owner is not None\u0060 appears character-identically in 3 files \u2014 s10_task_system/code.py, s13_agent_teams/code.py, s15_integrated_harness/code.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s10_task_system/code.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec980375b507ee1eb8f9cbd7824ac6f64d6ef8985b18a483850cc11c6b91bf9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060task.status != \u0022pending\u0022 or task.owner is not None or not can_start(task.id)\u0060 appears character-identically in 2 files \u2014 s13_agent_teams/code.py, s15_integrated_harness/code.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d84fdaea4154b19308d7890861b52ffba36999b4ab9c8f51a36d44adbcd041"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060task.status == \u0022in_progress\u0022 and task.owner == owner\u0060 appears character-identically in 2 files \u2014 s13_agent_teams/code.py, s15_integrated_harness/code.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65b713769adc664a18a9b660a8c93df5450c6c063184ce55aab5055adb8b328"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060teammate_assignments.get(name) or _owner_in_progress(name)\u0060 appears character-identically in 2 files \u2014 s13_agent_teams/code.py, s15_integrated_harness/code.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e31863eded1fca76e1c45a3e810866aded5b6a86b238886a99d4a59a9a89f07"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060to != \u0022lead\u0022 and to not in active_teammates\u0060 appears character-identically in 2 files \u2014 s13_agent_teams/code.py, s15_integrated_harness/code.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2272eedb581eae625700e7c4e5f29d9d93ec9d86bd91e0becabdb678031defb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tool_name == \u0022bash\u0022 and tool_input.get(\u0022run_in_background\u0022) is True\u0060 appears character-identically in 2 files \u2014 s11_background_tasks/code.py, s15_integrated_harness/code.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s11_background_tasks/code.py"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1098b6f2208ba4a57c764cca935aa8850a918d8ed9d6e3b15851717b59e5d34"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s15_integrated_harness/code.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c952cae2f1aec71998251d5f4ad17c4bd3672cbd65e6129c3022fd2cbcbb06"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s15_integrated_harness/code.py"},"region":{"startLine":1678}}}],"partialFingerprints":{"codehealthFindingId/v1":"6357f218518128d81b3fb4100b96b68234ec2985fb9e92090e4de8ec165c8ca6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s15_integrated_harness/code.py"},"region":{"startLine":1690}}}],"partialFingerprints":{"codehealthFindingId/v1":"80352aa188ee6404cd8b2187e82f237b59606d59cb6cc71cf93e6011a720c044"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s15_integrated_harness/code.py"},"region":{"startLine":2231}}}],"partialFingerprints":{"codehealthFindingId/v1":"906b43b5d79606b447a5b761111e5e562acd3e7649b81d69296c95ea8ee463b1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s15_integrated_harness/code.py"},"region":{"startLine":2516}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbbaab6152d66166972a4d2217e55cc7a5a1a9799ca2892679673bc27117dd11"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab57aef5eb97bbe9bb02e4747a549c8d6f7309ed108aae4a324928ac7086f440"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s13_agent_teams/code.py"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"69245e40b5fc999fc00e27ec4427284924a6d504b69315d48a3582dce9c14aa8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s09_agent_teams.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c0b850e9058df4b634488761b34dd427df27ec36cfb2af799ce50bdf3d1bf0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s10_team_protocols.py"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b9df4c1b7245b6d86a7bb23074590384bf45adb673dce87e9d4afadfd546a8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s12_worktree_task_isolation.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6538f6b8a66c72ffd8d269c99ffd4e87da74ed14674e63c303dc037b42143d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s12_worktree_task_isolation.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"6513e9c969e51da8eb672f8b92817df93712834b810f7b6a276b83ecce6ade69"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agents/s12_worktree_task_isolation.py"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0a63ad9ef46f0c0f94c775d3851c909022c1ae3d0c7c9f643a6d183e48a9c9"}},{"ruleId":"X5","level":"note","message":{"text":"Null assertions (\u0060!\u0060) override strict null checking: ~0.1 \u0060!\u0060 null assertions per 1k TypeScript source lines \u2014 1 assertion(s) across the 11000 source line(s) of the 56 TypeScript file(s) read, which is the only code the operator asserts anything in (a \u0060!\u0060 in a \u0060.js\u0060 file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: web/src/components/visualizations/s01-agent-loop.tsx (1). Each one tells the compiler to trust the author about null, suppressing the very diagnostic \u0060strictNullChecks\u0060 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."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1d83a7c69636a6290f63000d5c19b2073be1fa772f51977532af9ca6f745fc2a"}},{"ruleId":"X7","level":"note","message":{"text":"Pending state with no failure state: The view draws \u0060waiting for tool_call...\u0060 under \u0060! request \u0026\u0026 currentStep === 0\u0060, but \u0060currentStep\u0060 is settled by a load that can fail and the component draws no failure state, so a failed load is shown as \u0022not yet\u0022 for ever, or as the loaded state over its initial value. Give the component a failure state and draw it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/visualizations/s02-tool-dispatch.tsx"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6c1abc2ec0e96b373c1d0c35fc9cfd163eef208d73dd967e719527707e2458"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060read_memory_index\u0060 returns \u0060\u0027\u0027\u0060 when \u0060ValueError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"s09_memory/code.py"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"3241b4d74abc70694882cb3c03c6133b2a083336cc701016de2ae1e158491fe0"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-1352","guid":"5257f322-5cfc-6b52-bedd-0b9a526b4c7d","name":"CWE-1352","shortDescription":{"text":"CWE-1352"},"helpUri":"https://cwe.mitre.org/data/definitions/1352.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"id":"CICD-SEC-7","guid":"4c4af28d-49e3-2d51-b597-e1396c49658b","name":"Insecure System Configuration","shortDescription":{"text":"Insecure System Configuration"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-07-Insecure-System-Configuration"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":46,"secretScannerRunsExcluded":0}},"redactionTokens":["A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."]}]}