{"$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":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"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":"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":"D23","name":"Boundary Type-Coupling","shortDescription":{"text":"Boundary Type-Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D23"},{"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":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02: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":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02: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":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AC7","name":"A11y enforcement","shortDescription":{"text":"A11y enforcement"},"helpUri":"https://codehealth.canine.dev/dimensions/AC7"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX2","name":"Stateful singletons","shortDescription":{"text":"Stateful singletons"},"helpUri":"https://codehealth.canine.dev/dimensions/AX2"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX5","name":"Architecture \u0026 structure","shortDescription":{"text":"Architecture \u0026 structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AX5"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"AXS1","name":"Runtime exposed surface","shortDescription":{"text":"Runtime exposed surface"},"helpUri":"https://codehealth.canine.dev/dimensions/AXS1"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"ES1","name":"Fold determinism","shortDescription":{"text":"Fold determinism"},"helpUri":"https://codehealth.canine.dev/dimensions/ES1"},{"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":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"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":"P5","name":"DR \u0026 Backup","shortDescription":{"text":"DR \u0026 Backup"},"helpUri":"https://codehealth.canine.dev/dimensions/P5"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"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":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"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":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"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":"MutableDAG.ReplaceNode (cyclomatic 53): MutableDAG.ReplaceNode has cyclomatic complexity 53 (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":"internal/fabric/task/workflow/engine/mutable_dag.go"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"2656590a0e245bff16bbc76509c587a110f34340a1be4714d5cacf85062c0f5e"}},{"ruleId":"D1","level":"warning","message":{"text":"Compactor.buildSummary (cyclomatic 48): Compactor.buildSummary has cyclomatic complexity 48 (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":"internal/ares_events/compactor.go"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"4655c35b248db9027bd3b43c031231ad90af36112d8904855df09ac8ade327cd"}},{"ruleId":"D1","level":"warning","message":{"text":"Config.setDefaults (cyclomatic 45): Config.setDefaults has cyclomatic complexity 45 (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":"internal/ares_config/config_defaults.go"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"58dfbe90b74a08540cdec9b198dd62bfdd833afe8c721181f83618b4f24c6345"}},{"ruleId":"D1","level":"warning","message":{"text":"panel.html.renderOverview (cyclomatic 35): panel.html.renderOverview has cyclomatic complexity 35 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 2 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":"internal/introspect/web/panel.html"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f4367fa2548cea9483a10c5ccc7787545e8a57327adaa88129a70682c58f93a"}},{"ruleId":"D1","level":"warning","message":{"text":"Service.CreateWiredSystem (cyclomatic 33): Service.CreateWiredSystem has cyclomatic complexity 33 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 8 belong to 2 function literals inside it that branch. 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":"internal/runtime/ares_evolution/service/service.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f07fa2c9a209215104babd64cc68ce883072d9fa543b90bffc3ed17868118a"}},{"ruleId":"D1","level":"warning","message":{"text":"FileTools.listFiles (cyclomatic 31): FileTools.listFiles has cyclomatic complexity 31 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 11 belong to one function literal inside it that branches. 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":"internal/tools/resources/builtin/file/file_tools.go"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ec7f7127794ce52fefd39bec3675c0402c1b9f9574f43b6425be7e7aab5611"}},{"ruleId":"D1","level":"warning","message":{"text":"ares_events.DefaultSummarizer (cyclomatic 30): ares_events.DefaultSummarizer has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/ares_events/compactor.go"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"a220f27c75d4f3a5e64a60d02866fae411391ddb6c6037f74df62eefed40cd25"}},{"ruleId":"D1","level":"warning","message":{"text":"Scheduler.planPreemptions (cyclomatic 30): Scheduler.planPreemptions has cyclomatic complexity 30 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. 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":"internal/kernel/scheduler_dispatch.go"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"33731592cce7b512f1730b7436feaca5480e3a25e03620f976ea43c42ade354c"}},{"ruleId":"D1","level":"warning","message":{"text":"Scheduler.executeWithCandidates (cyclomatic 30): Scheduler.executeWithCandidates has cyclomatic complexity 30 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 6 belong to 3 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":"internal/kernel/scheduler_execute.go"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97a3a22afc7ee4b58f7244e884d957b43f76c17c968f96fbadb9db699d2c3ac"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfigFile.ToOptions (cyclomatic 30): ConfigFile.ToOptions has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/config.go"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f8122b316a05ccb59d90c998ca0f80892310167c69f91dcfe119ed2ba5b7cb7"}},{"ruleId":"D1","level":"warning","message":{"text":"main.runCollabGraph (cyclomatic 29): main.runCollabGraph has cyclomatic complexity 29 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. 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":"cmd/ares/agent_routes_tasks.go"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71daf9b3a53a2dead51b97bdd58b8d4a4dd4f9cbaa35bebc02e66d2f6b950ab"}},{"ruleId":"D1","level":"warning","message":{"text":"main.runKernelRecoveryLoop (cyclomatic 29): main.runKernelRecoveryLoop has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 11 of the 29 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 459, 551, 601). 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":"cmd/ares/kernel_loop.go"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"966878a04edde3c818714bd03cac6d1512ca18907b8af330b09fd27139c15567"}},{"ruleId":"D1","level":"warning","message":{"text":"Fabric.recordWithExtrasLocked (cyclomatic 29): Fabric.recordWithExtrasLocked has cyclomatic complexity 29 (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":"internal/fabric/task/fabric_events.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"99aa8232cad080d31645fe2e82e15b6f065c5b7b45e2bdcb03677c43f20f0b63"}},{"ruleId":"D1","level":"warning","message":{"text":"FileWatcher.scanAndLoad (cyclomatic 29): FileWatcher.scanAndLoad has cyclomatic complexity 29 (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":"internal/fabric/task/workflow/engine/reloader.go"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc395ff2e883d482fd3b25d104ee6360188fedec222681a46f01d68d0c521d29"}},{"ruleId":"D1","level":"warning","message":{"text":"Manager.executePhase (cyclomatic 28): Manager.executePhase has cyclomatic complexity 28 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. 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":"internal/ares_shutdown/manager.go"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"623f08c328ac9e97530cab4c3c459729a99b8bffa9a043004a32798f236e9e08"}},{"ruleId":"D1","level":"warning","message":{"text":"Fabric.foldRestoreEvent (cyclomatic 28): Fabric.foldRestoreEvent has cyclomatic complexity 28 (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":"internal/fabric/task/restore.go"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b02649bf7f8e64b6f930ef2b1dfedc7dc1a3a53a3a4a5d828ca46968b1a8e2a"}},{"ruleId":"D1","level":"warning","message":{"text":"Service.Execute (cyclomatic 28): Service.Execute has cyclomatic complexity 28 (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":"internal/runtime/arena/service.go"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b99b066c0a90a63839b124924fd0d6fd8f104d21762ff9d5c761f2810c719a"}},{"ruleId":"D1","level":"warning","message":{"text":"MemoryPatchExecutor.Apply (cyclomatic 28): MemoryPatchExecutor.Apply has cyclomatic complexity 28 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"internal/runtime/memory/memory_patcher.go"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d57677651bd34485f06682bc6b97203b3e3de3edf332533a5d90a018f75273"}},{"ruleId":"D1","level":"warning","message":{"text":"EvolutionProvider.Stream (cyclomatic 27): EvolutionProvider.Stream has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 1 of the 27 points is its own statement and the rest belongs to one function literal inside it that branches (line 101). 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":"internal/knowledge/provider/evolution/provider.go"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"9175705f686068912eb774f1e1d5772d5db5155cfc178cade1dc3861ac8a8263"}},{"ruleId":"D1","level":"warning","message":{"text":"arena.ValidateAction (cyclomatic 27): arena.ValidateAction has cyclomatic complexity 27 (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":"internal/runtime/arena/http.go"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b82c22bed92d840cabc7dbbe861264b7113238be7eb417ec2422eebe0341e3"}},{"ruleId":"D1","level":"warning","message":{"text":"evolution.RunIdleEvolution (cyclomatic 27): evolution.RunIdleEvolution has cyclomatic complexity 27 (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":"internal/runtime/ares_evolution/genome_wiring_idle.go"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"63425bc7375ab3cea0b355d206361871b445fd0520eef637e54e16f63d62c560"}},{"ruleId":"D1","level":"warning","message":{"text":"Population.doEvolve (cyclomatic 27): Population.doEvolve has cyclomatic complexity 27 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"internal/runtime/ares_evolution/genome/population.go"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a92f77fe55543a219ae28d6c150d2475751b33000d6639cbcb835347bb6a0a"}},{"ruleId":"D1","level":"warning","message":{"text":"Store.HybridSearch (cyclomatic 26): Store.HybridSearch has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/knowledge/store/postgres/store.go"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae0917423741ce0e771e62a378c66712280bcf1e15ab565582b1e8d08b96351"}},{"ruleId":"D1","level":"warning","message":{"text":"arena.RunScenarioReport (cyclomatic 26): arena.RunScenarioReport has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/arena/scenario.go"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6e225ed0b6ffabd83cba7aef9bc51a1b5f3fc1e8c8d33464e7c13c62dd096b"}},{"ruleId":"D1","level":"warning","message":{"text":"ExperienceExtractor.parseUserProfile (cyclomatic 26): ExperienceExtractor.parseUserProfile has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/memory/distillation/extractor.go"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"860c7550dc944e07b0cb9bbe68952d13c3e3be688fa8a4413243e4aef505caf8"}},{"ruleId":"D1","level":"warning","message":{"text":"HTTPRequest.Execute (cyclomatic 26): HTTPRequest.Execute has cyclomatic complexity 26 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"internal/tools/resources/builtin/network/http_request.go"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"f197ac539339a3c6a0ba1647e6dda3913d1a7df4f804e98834ceb5052cd7ccff"}},{"ruleId":"D1","level":"warning","message":{"text":"plannerCognition.ExecuteStep (cyclomatic 25): plannerCognition.ExecuteStep has cyclomatic complexity 25 (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":"internal/fabric/agent/planner_cognition.go"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c906a104fe5c5bb32a0f92ca2ef405569d37683616e32c3d3d62bb804ce2ed"}},{"ruleId":"D1","level":"warning","message":{"text":"Fabric.CompilePlan (cyclomatic 25): Fabric.CompilePlan has cyclomatic complexity 25 (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":"internal/fabric/task/workflow_plan.go"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"23309f5ca131641905b4b6bc28afb62cb0906ea3c5f0ae69066c477d350c10f9"}},{"ruleId":"D1","level":"warning","message":{"text":"ControlServer.ServeHTTP (cyclomatic 25): ControlServer.ServeHTTP has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/introspect/control.go"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"1616633c2c2d9493829394f295f06f6c8e921fd4acd71648c633cbd10015cca3"}},{"ruleId":"D1","level":"warning","message":{"text":"DreamCycle.findWinner (cyclomatic 25): DreamCycle.findWinner has cyclomatic complexity 25 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. 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":"internal/runtime/ares_evolution/dream_cycle_winner.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e18bd47c1644b7dfd9f4bd9fcf9c2ae06db7b512cb994cc582c29710dde35b33"}},{"ruleId":"D1","level":"warning","message":{"text":"ExperienceGuidedMutator.chooseGuidedMutationType (cyclomatic 25): ExperienceGuidedMutator.chooseGuidedMutationType has cyclomatic complexity 25 (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":"internal/runtime/ares_evolution/mutation/guided_mutator.go"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca86bbea91e5766f99d6f3cfcb004942ac9c2ec74afaa92f8ff9d4f653665792"}},{"ruleId":"D1","level":"warning","message":{"text":"Fabric.Reconcile (cyclomatic 24): Fabric.Reconcile has cyclomatic complexity 24 (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":"internal/fabric/task/reconcile.go"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ceec9a2f3c7949b27af8b0d3847a221dfe83db8e2957716f532350d562ee42"}},{"ruleId":"D1","level":"warning","message":{"text":"Orchestrator.Shutdown (cyclomatic 24): Orchestrator.Shutdown has cyclomatic complexity 24 (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":"internal/kernel/orchestrator.go"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c941422dec50bea4387e86b1ca71e9751f0075acf80ce19959710785ede35f3"}},{"ruleId":"D1","level":"warning","message":{"text":"KnowledgePipeline.Process (cyclomatic 24): KnowledgePipeline.Process has cyclomatic complexity 24 (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":"internal/knowledge/pipeline.go"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e1432c08c958678d1d736931c82600f040d405b8063e76afa5fd799ecdd33d"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeProvider.Stream (cyclomatic 24): CodeProvider.Stream has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to one function literal inside it that branches (line 179). 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":"internal/knowledge/provider/code/provider.go"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"054c8fc898a10f357c30f53e7ff02db4bfd5b222aa93e32dfda2e57bb1fcc9f7"}},{"ruleId":"D1","level":"warning","message":{"text":"KnowledgeRepository.CreateBatch (cyclomatic 24): KnowledgeRepository.CreateBatch has cyclomatic complexity 24 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. 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":"internal/storage/postgres/repositories/knowledge_repository.go"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a81da3061312e5368a9c0821c17d346c649366aad49a127bf19268dcd2aa26a"}},{"ruleId":"D1","level":"warning","message":{"text":"StringUtils.Execute (cyclomatic 24): StringUtils.Execute has cyclomatic complexity 24 (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":"internal/tools/resources/builtin/stringutils/stringutils.go"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a12b2905e8397f710012a6116462afa00a0f70de3de2a31189cffd20382cf6"}},{"ruleId":"D1","level":"warning","message":{"text":"main.runEvolutionCycle (cyclomatic 23): main.runEvolutionCycle 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":"cmd/ares/evolution.go"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc133d86e8c80ea7dbbe6209592a4dc550bcfd70bebd14abb161d3007b96838"}},{"ruleId":"D1","level":"warning","message":{"text":"actionHandler.handleChaos (cyclomatic 23): actionHandler.handleChaos 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":"cmd/ares/agent_routes_chaos.go"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1f3e29838f158c7df097d33a61aac7622f64be99383d68d418393d7e4471a6"}},{"ruleId":"D1","level":"warning","message":{"text":"actionHandler.handleSubmitTask (cyclomatic 23): actionHandler.handleSubmitTask 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":"cmd/ares/agent_routes_tasks.go"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9568b8fd2c6f7cfeee8bf883a6f9cd1dae149d3385fac0088d1975acb69fae"}},{"ruleId":"D1","level":"warning","message":{"text":"agentsyscall.BindTools (cyclomatic 23): agentsyscall.BindTools has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 3 of the 23 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 810, 837, 873, \u2026). 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":"internal/agentsyscall/syscall.go"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"6415baa8ecbfb9994924a9da93775ffc1ce1ffed0fd9d1a94bea07df09863d33"}},{"ruleId":"D1","level":"warning","message":{"text":"PostgresEventStore.Append (cyclomatic 23): PostgresEventStore.Append has cyclomatic complexity 23 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. 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":"internal/ares_events/pg_store.go"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb95947ece8ea35968b5664c852934a5117112f5b3a7dd76b202365bd419ab5"}},{"ruleId":"D1","level":"warning","message":{"text":"DefaultReducer.Reduce (cyclomatic 23): DefaultReducer.Reduce 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":"internal/knowledge/runtime/components.go"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e6605fe197e5c791f4cf01434b45a0e665535a871a6febdde25f299781dbbc"}},{"ruleId":"D1","level":"warning","message":{"text":"Client.GenerateStream (cyclomatic 23): Client.GenerateStream has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 6 of the 23 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 448, 414). 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":"internal/llm/client.go"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"86de51a5e59506a3a96b91b3d013639e8d887b9ed269c4765d80ec5ce58493b6"}},{"ruleId":"D1","level":"warning","message":{"text":"Client.streamAnthropic (cyclomatic 23): Client.streamAnthropic has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 9 of the 23 points are its own statements and the rest belongs to one function literal inside it that branches (line 662). 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":"internal/llm/client.go"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6d8ece560ffc76689456bc3c9ddbc2d773758daaf184ace0ff7e4597dc62b9"}},{"ruleId":"D1","level":"warning","message":{"text":"SecretRepository.Import (cyclomatic 23): SecretRepository.Import has cyclomatic complexity 23 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. 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":"internal/storage/postgres/repositories/secret_repository.go"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"7162da5f5f5f457198b2a46b789009764d671335ac5c5d34e9f6a3d91e027eab"}},{"ruleId":"D1","level":"warning","message":{"text":"main.setupPeerRegistry (cyclomatic 22): main.setupPeerRegistry has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 9 of the 22 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 390, 453, 513). 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":"cmd/ares/serve_peer.go"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3afa7048b3b03cce7173c03e8ed7be8c1309a1a821bfe7345451ac985e6f7bb"}},{"ruleId":"D1","level":"warning","message":{"text":"ares_bootstrap.wireRetrievers (cyclomatic 22): ares_bootstrap.wireRetrievers has cyclomatic complexity 22 (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":"internal/ares_bootstrap/retriever_wiring.go"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b60432067269682a85f731650c5b43b33d79398c4495f84e5e23b97ae9737ee"}},{"ruleId":"D1","level":"warning","message":{"text":"plannerCognition.growToolNodes (cyclomatic 22): plannerCognition.growToolNodes has cyclomatic complexity 22 (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":"internal/fabric/agent/planner_cognition.go"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"de8116d46a1b6e36ae73a0bc77dbeaae94ee7fed48bba246d4b7fd4a4bfb2328"}},{"ruleId":"D1","level":"warning","message":{"text":"DAGPatchExecutor.Apply (cyclomatic 22): DAGPatchExecutor.Apply has cyclomatic complexity 22 (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":"internal/fabric/task/workflow/engine/dag_patcher.go"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3665246031ad87307d7bc975e704d00a467dadf6f3d25691790bb185591deba"}},{"ruleId":"D1","level":"warning","message":{"text":"DateTime.Execute (cyclomatic 22): DateTime.Execute has cyclomatic complexity 22 (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":"internal/tools/resources/builtin/math/calculator.go"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"83871b5eb8226d5db58e63e2264ed79c771e07fcec820525445cf148179ca072"}},{"ruleId":"D1","level":"warning","message":{"text":"WebSearch.Execute (cyclomatic 22): WebSearch.Execute has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"internal/tools/resources/builtin/network/web_search.go"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec6e640d56934dfb974a1f2a2e9227342cea995f0fe4883ec6c6d1d2b83fcca"}},{"ruleId":"D1","level":"warning","message":{"text":"ares_bootstrap.ProvideNewEvolution (cyclomatic 21): ares_bootstrap.ProvideNewEvolution has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/ares_bootstrap/provide_new_evolution.go"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eccce97f9a8bd4c3cf4b3fabc997c3b7551d81f752334ab87105e19be7069d3"}},{"ruleId":"D1","level":"warning","message":{"text":"ares_bootstrap.buildRegressionGate (cyclomatic 21): ares_bootstrap.buildRegressionGate has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/ares_bootstrap/regression_gate_wiring.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"e869c1be8660e4b465209ecb2ec24d3e14720c184b05888bb1bb2d8b00fedd47"}},{"ruleId":"D1","level":"warning","message":{"text":"CompactableEventStore.archivePendingRoundsOnce (cyclomatic 21): CompactableEventStore.archivePendingRoundsOnce has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/ares_events/compactable_store.go"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"e568b20826234442fc34c863745d4f99346257eb13dc77a942adc12bf8e9f9e9"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphPatchExecutor.CanApply (cyclomatic 21): GraphPatchExecutor.CanApply has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/task/workflow/graph/patcher.go"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb26811178b49af43cf6b57a071363ba8592aa353717a09b70c15e05bbba864"}},{"ruleId":"D1","level":"warning","message":{"text":"DefaultEntityMatcher.MatchTokens (cyclomatic 21): DefaultEntityMatcher.MatchTokens has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/knowledge/pipeline/normalizer.go"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43abfbb46e448d7017c211df33497f1e7dd744747c6d14b418821337663b08c"}},{"ruleId":"D1","level":"warning","message":{"text":"Client.streamOpenRouter (cyclomatic 21): Client.streamOpenRouter has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 9 of the 21 points are its own statements and the rest belongs to one function literal inside it that branches (line 778). 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":"internal/llm/client.go"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"141641b58a9c6a4a2525cf1ae8d539a6d5ea27a5178b0b2a6185307d620f45db"}},{"ruleId":"D1","level":"warning","message":{"text":"evolution.ReconcileToolClassDAG (cyclomatic 21): evolution.ReconcileToolClassDAG has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"internal/runtime/ares_evolution/toolclass_reconcile.go"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"82eea55ae687b7458c06c38b3b43562cd6c63860a7c3d3360955b0fee1a67ad5"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeFitnessAggregator.querySourceMeanScopedAt (cyclomatic 21): RuntimeFitnessAggregator.querySourceMeanScopedAt has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/fitness_aggregator.go"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"b006239dab329ac009a6c7f15ae500613ead2a2a9840cf43345766cdb1d8766c"}},{"ruleId":"D1","level":"warning","message":{"text":"mutation.valuesEqual (cyclomatic 21): mutation.valuesEqual has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function taking that case\u0027s concrete type, so the dispatch reads one line per case. These arms are selected by TYPE rather than by value, so there is no key a lookup table could be built on; where you own the matched types, giving them one shared interface method and calling that is the form a table would have taken, and where you do not, keep the cases \u2014 they stay explicit and reviewable."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/mutation/mutator.go"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d265d84aeae62456adfe23fe798c15e58f063c4554f4c99410598d9462a4df"}},{"ruleId":"D1","level":"warning","message":{"text":"Collector.processEvent (cyclomatic 21): Collector.processEvent has cyclomatic complexity 21 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 4 belong to 4 function literals inside it that branch. 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":"internal/runtime/observability/flight/collector.go"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a4cdde47793729852d12ef56f8ad001c8c7b1a4fb3790f4b5dcf5b50ecfefc"}},{"ruleId":"D1","level":"warning","message":{"text":"MCPConfigWatcher.Start (cyclomatic 21): MCPConfigWatcher.Start has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"internal/runtime/protocol/mcp/config_watcher.go"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"90131ea1af9a31c3e1949edda11161bdc00d519eefe3558eb89797e99dc15d90"}},{"ruleId":"D1","level":"warning","message":{"text":"UserProfile.Execute (cyclomatic 21): UserProfile.Execute has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tools/resources/builtin/memory/memory_tools.go"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"1499b06f709e56a5e37898c77fcb5f753a53278446efc39d3dac00787e32a849"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfigStore.Watch (cyclomatic 20): ConfigStore.Watch has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"internal/ares_config/store.go"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d96c7b79f4a5bb31ad255dda9862c9c0f3431cd467791f98d563f92ed716d7c"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine.DiscoverNow (cyclomatic 20): Engine.DiscoverNow has cyclomatic complexity 20 (threshold 15). 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, 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":"internal/discovery/engine.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0777cc3cddf75ac8133a1a8083d185ebfd9d2a655d506891a2cfa2d5a90d8f4"}},{"ruleId":"D1","level":"warning","message":{"text":"Fabric.ReclaimIdle (cyclomatic 20): Fabric.ReclaimIdle 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":"internal/fabric/agent/reclaim.go"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c093423b241ba62e1bd6d5afbda33879aa7b5fd6db676ba833d1eed679aacf4"}},{"ruleId":"D1","level":"warning","message":{"text":"Store.HybridSearch (cyclomatic 20): Store.HybridSearch 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":"internal/knowledge/store/memory/store.go"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb3b3e8724ce2995b7d34280afef5b660eb9859ef5861a87023b72f487c2950"}},{"ruleId":"D1","level":"warning","message":{"text":"Store.HybridSearch (cyclomatic 20): Store.HybridSearch 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":"internal/knowledge/store/sqlite/store.go"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6e62028e540230b9d66bbb68d34daa290e1bbe5c6a196db1fa73e64daec4f0"}},{"ruleId":"D1","level":"warning","message":{"text":"llm.withRetry (cyclomatic 20): llm.withRetry has cyclomatic complexity 20 (threshold 15). 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, 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":"internal/llm/resilience.go"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"180c1d28fb707bc25f745c1a3984cbe8efcc36390de2aad98abe481473f7bde6"}},{"ruleId":"D1","level":"warning","message":{"text":"FailoverClient.GenerateStream (cyclomatic 20): FailoverClient.GenerateStream has cyclomatic complexity 20 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. 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":"internal/llm/failover.go"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"92691d305fa9ed98e111fc0fe1b561d8e0d47919f85ae3f34d3aea93e2b94dbb"}},{"ruleId":"D1","level":"warning","message":{"text":"RegressionTester.runAdaptive (cyclomatic 20): RegressionTester.runAdaptive has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. 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":"internal/runtime/arena/regression.go"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c988f26ad1d38cb98108d0d35c7b4a82da9e0eece4ba23515ef3cdc31762be"}},{"ruleId":"D1","level":"warning","message":{"text":"DefaultNormalizer.Normalize (cyclomatic 20): DefaultNormalizer.Normalize 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":"internal/runtime/ares_evolution/experience/normalizer.go"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd877718d411108a112ccc789e5f0250cd701fd209648db13b7f2a00c016bc7"}},{"ruleId":"D1","level":"warning","message":{"text":"Manager.Stop (cyclomatic 20): Manager.Stop has cyclomatic complexity 20 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. 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":"internal/runtime/manager_lifecycle.go"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"add0756d6cbda39cee70b44ff2d796e98a4b2b26eaceb57a125c73d5ff997361"}},{"ruleId":"D1","level":"warning","message":{"text":"main.liveChaosLoop (cyclomatic 19): main.liveChaosLoop 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":"cmd/ares/serve_chaos_domain.go"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"559c36394d1bce8f8c9b5149e9afcf3f21f2aa5d894a0ded831569f83519a071"}},{"ruleId":"D1","level":"warning","message":{"text":"providers.scanConfigFile (cyclomatic 19): providers.scanConfigFile 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":"internal/discovery/providers/filesystem.go"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"a432a18fcc70eb8d6ff2ba383825a0ac729c2b7fe700d92071ea297cbea87b22"}},{"ruleId":"D1","level":"warning","message":{"text":"evolution.ReportString (cyclomatic 19): evolution.ReportString 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":"internal/runtime/ares_evolution/report.go"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8a48fcc0cbb0c39b967824dbd87bfd1811f1fd152ce3a29cc83bd482c553b5"}},{"ruleId":"D1","level":"warning","message":{"text":"memoryManager.BuildContext (cyclomatic 19): memoryManager.BuildContext 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":"internal/runtime/memory/manager_impl.go"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc34ec86da54fe97f4d88a32ef6e855a530429f434f56807e0f9235a6aba3f4"}},{"ruleId":"D1","level":"warning","message":{"text":"panel.html.renderExec (cyclomatic 19): panel.html.renderExec has cyclomatic complexity 19 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 4 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":"internal/introspect/web/panel.html"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc226a5808ffd336d7a71e58dc353940c8c212002576a214704c255e311f047"}},{"ruleId":"D1","level":"warning","message":{"text":"Sessions.admitFreshLocked (cyclomatic 18): Sessions.admitFreshLocked 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":"internal/agentruntime/session.go"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de4fda467311c69d24b54580a4d3358eaea68d63ac0c7f49d456046108c1177"}},{"ruleId":"D1","level":"warning","message":{"text":"ares_bootstrap.applyGATuning (cyclomatic 18): ares_bootstrap.applyGATuning has cyclomatic complexity 18 (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":"internal/ares_bootstrap/bootstrap_evolution.go"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca04ebba3080fb9d4da3cd6bc2d9e63d5bc6c45c2b0e5a63519a4c5cae9daf41"}},{"ruleId":"D1","level":"warning","message":{"text":"taskfabric.DecodeCheckpoint (cyclomatic 18): taskfabric.DecodeCheckpoint 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":"internal/fabric/task/checkpoint_schema.go"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"6672f742069c206a962d46f623c9e17bf2d1a7efe765ef1fbfbfd5d6ca3940d8"}},{"ruleId":"D1","level":"warning","message":{"text":"Scheduler.freeAgentIDs (cyclomatic 18): Scheduler.freeAgentIDs 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":"internal/kernel/scheduler_dispatch.go"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8c23cb69dbef5442cca7bfdf6fa027203b619368099775e1c0644a1ef09b98"}},{"ruleId":"D1","level":"warning","message":{"text":"Store.Query (cyclomatic 18): Store.Query 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":"internal/knowledge/store/memory/store.go"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"b971e925ed6c75d9a688679a64b4ce1bd456b89fd462a53b67f64fd5bd18964d"}},{"ruleId":"D1","level":"warning","message":{"text":"RegressionTester.runUncached (cyclomatic 18): RegressionTester.runUncached has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 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":"internal/runtime/arena/regression.go"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0b04a4e9109676d818b5727c037c63b47722a7afb6584915db951a4850cffe"}},{"ruleId":"D1","level":"warning","message":{"text":"DreamCycle.runESEvolution (cyclomatic 18): DreamCycle.runESEvolution 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":"internal/runtime/ares_evolution/dream_cycle_evolve.go"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47b5d665d78c4e10a6eb2ffb1331285364d200463dea39e963eb0478242c078"}},{"ruleId":"D1","level":"warning","message":{"text":"MetaController.Tune (cyclomatic 18): MetaController.Tune 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":"internal/runtime/ares_evolution/genome/meta_evolution.go"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e76956bd3931017f91d89d0298bcc9b6c813eda34de847a7b24d671562ad255"}},{"ruleId":"D1","level":"warning","message":{"text":"GenomePopulationAdapter.Run (cyclomatic 18): GenomePopulationAdapter.Run has cyclomatic complexity 18 (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":"internal/runtime/ares_evolution/genome_wiring_run.go"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e75838b1dd3bd20eb2bd33331fc147beef2ae15cce23464f9433d85eabbd46a"}},{"ruleId":"D1","level":"warning","message":{"text":"ContextCleaner.CleanWithTurns (cyclomatic 18): ContextCleaner.CleanWithTurns 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":"internal/runtime/memory/context/cleaner.go"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb01df160cf89d7e5e81744ee5fbc255ab5d8dccaca39b00bf8e0782a1667e9"}},{"ruleId":"D1","level":"warning","message":{"text":"ImportanceScorer.ScoreMemory (cyclomatic 18): ImportanceScorer.ScoreMemory 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":"internal/runtime/memory/distillation/scorer.go"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"06022f260626462bf8825e4cd625817cd19fd59b10b66ca69033fd6bfa4b9196"}},{"ruleId":"D1","level":"warning","message":{"text":"memoryManager.StoreDistilledTask (cyclomatic 18): memoryManager.StoreDistilledTask has cyclomatic complexity 18 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. 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":"internal/runtime/memory/manager_impl.go"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee741a0add7de5192908293a81e3b5284d012b7869d1c5d40330c7f4eaf5d7ce"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.AddNode (cyclomatic 18): Graph.AddNode 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":"internal/runtime/observability/flight/graph.go"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d48c25aa0e28977b666a0d99edfc11fa25af0ce4b91b8cd991ce1907846e94"}},{"ruleId":"D1","level":"warning","message":{"text":"Indexer.indexOne (cyclomatic 18): Indexer.indexOne 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":"internal/runtime/protocol/skills/indexer.go"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"990901b238bcc375b0449c09e2d2928eeca7e68bd03f02e2df16db9f0391e90c"}},{"ruleId":"D1","level":"warning","message":{"text":"SecretRepository.RotateKey (cyclomatic 18): SecretRepository.RotateKey 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, 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":"internal/storage/postgres/repositories/secret_repository.go"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe39b19e7f29da47d869b69c6584dc339e32a0592e8839de1d74c3a4f062de6"}},{"ruleId":"D1","level":"warning","message":{"text":"Agent.composePrompt (cyclomatic 18): Agent.composePrompt 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":"sdk/agent.go"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"5160b60eabc528a9db3f48b0586fe829700e8e76bab418daad12508455cb4e80"}},{"ruleId":"D1","level":"warning","message":{"text":"main.runLiveChaosInjection (cyclomatic 17): main.runLiveChaosInjection 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, 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":"cmd/ares/serve_chaos_domain.go"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f28ee46c75402bf5304ba2544cfbc7b1fa8ae41e80413b654c418cecdcf7f16"}},{"ruleId":"D1","level":"warning","message":{"text":"main.printStatusText (cyclomatic 17): main.printStatusText 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, 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":"cmd/ares/status.go"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aeb287e6caa7ed33681ef983872a51d89b7e295f56f7b5f531d16ce2aa059dd"}},{"ruleId":"D1","level":"warning","message":{"text":"webSearchTool.Execute (cyclomatic 17): webSearchTool.Execute 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, 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":"internal/apitools/builtin.go"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92690a64ea1692d8d7a4ea706c941fba46eebb8ff470dc3524b51c7a9908145"}},{"ruleId":"D1","level":"warning","message":{"text":"ares_bootstrap.wireLifecycleGates (cyclomatic 17): ares_bootstrap.wireLifecycleGates 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":"internal/ares_bootstrap/bootstrap_evolution.go"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f54ebb7f09be0e62ec7a04eb77166047115f78a4c4b7b3130d13f799bed0352"}},{"ruleId":"D1","level":"warning","message":{"text":"NewEvolutionComponents.UpdateLiveDAG (cyclomatic 17): NewEvolutionComponents.UpdateLiveDAG 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":"internal/ares_bootstrap/provide_new_evolution.go"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f75c90a70d2707566cadaf4c4c381c170b554ba859504dae5bc94812f58b1bf"}},{"ruleId":"D1","level":"warning","message":{"text":"CompactableEventStore.maybeCompact (cyclomatic 17): CompactableEventStore.maybeCompact 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":"internal/ares_events/compactable_store.go"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eebad70b3191e87224f6232bed22d626a78c562e56447ff39fe5487fba9e33c"}},{"ruleId":"D1","level":"warning","message":{"text":"Fabric.flushAppendsDetailed (cyclomatic 17): Fabric.flushAppendsDetailed 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":"internal/fabric/task/fabric_events.go"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"649c868fc16b7595fe3f34c76e7da794ae73a4f03e2b7e7f6cf527d0636ea099"}},{"ruleId":"D1","level":"warning","message":{"text":"Orchestrator.Adopt (cyclomatic 17): Orchestrator.Adopt 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, 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":"internal/kernel/orchestrator.go"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"4499ddd7ae6e908619a3754af3b2004d45471353b28d64aafb594c356e2eb4ce"}},{"ruleId":"D1","level":"warning","message":{"text":"DistillBridge.DistillConversationWithReport (cyclomatic 17): DistillBridge.DistillConversationWithReport 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":"internal/knowledge/adapter/distill.go"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"d987aaa0f053eeb9dec851887eacbc47d0793a8870d556bef6ab9f2f55424783"}},{"ruleId":"D1","level":"warning","message":{"text":"DefaultCompiler.formatMarkdown (cyclomatic 17): DefaultCompiler.formatMarkdown 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":"internal/knowledge/compiler/compiler.go"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"a045ccae60f1d5863021339747918919b407af8b3793dffa8bfdc48b7efb33bb"}},{"ruleId":"D1","level":"warning","message":{"text":"KnowledgeRuntime.loadAndProcess (cyclomatic 17): KnowledgeRuntime.loadAndProcess has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 6 of the 17 points are its own statements and the rest belongs to one function literal inside it that branches (line 263). 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":"internal/knowledge/runtime/runtime.go"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ede634fdbedb61bf24525da697682a3914f4f5449c2c6fd35687309f25854f1"}},{"ruleId":"D1","level":"warning","message":{"text":"KnowledgeAgent.Process (cyclomatic 17): KnowledgeAgent.Process 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":"internal/knowledge/workflow/workflow.go"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ede8c66575aa527b39fb7f3a8e087493406207798e3b4c30587cbd547280be"}},{"ruleId":"D1","level":"warning","message":{"text":"Client.streamOllama (cyclomatic 17): Client.streamOllama has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to one function literal inside it that branches (line 568). 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":"internal/llm/client.go"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82103dc07c8a122f4a33dd9c71046bc05f5b29436dadd1050c1667c6a31e7ea"}},{"ruleId":"D1","level":"warning","message":{"text":"archive.extractVerdict (cyclomatic 17): archive.extractVerdict 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":"internal/runtime/archive/extract.go"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"19cb3301d5c05cdb70abaffd24787885b65a7d0f55558a9258757afc2a4a313d"}},{"ruleId":"D1","level":"warning","message":{"text":"FeedbackRecorder.Register (cyclomatic 17): FeedbackRecorder.Register 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":"internal/runtime/ares_evolution/feedback_recorder.go"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab2cf14bed3d58e7835d5e7f5bcaeb75f7d43ad5704260bce778ed558c8bd2e"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalGate.Check (cyclomatic 17): EvalGate.Check 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":"internal/runtime/ares_evolution/gate_eval.go"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7bb34ad69c6bfc24a99cd268dd6352f11209389efce25e82a110e0afd0ec83b"}},{"ruleId":"D1","level":"warning","message":{"text":"StrategyLifecycle.evaluateAndMaybeRollback (cyclomatic 17): StrategyLifecycle.evaluateAndMaybeRollback 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":"internal/runtime/ares_evolution/lifecycle_evidence.go"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbcb99f46bf018a664713d26868f1ccddc61f446711d3cd3fb32f11e1d846401"}},{"ruleId":"D1","level":"warning","message":{"text":"StrategyLifecycle.Submit (cyclomatic 17): StrategyLifecycle.Submit 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":"internal/runtime/ares_evolution/lifecycle_promotion.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc80509884bce5e32a86ce4c1a4c42f02862e6560acd5522b704c9a44d40fd93"}},{"ruleId":"D1","level":"warning","message":{"text":"evolution.NewService (cyclomatic 17): evolution.NewService 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":"internal/runtime/ares_evolution/service/service.go"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f5806f8b59abc93927ca3ffddc184e199a6980ac51df1c6a45d95767272256"}},{"ruleId":"D1","level":"warning","message":{"text":"context.summarizeHTTPRequestResult (cyclomatic 17): context.summarizeHTTPRequestResult 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":"internal/runtime/memory/context/cleaner.go"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"9989b0d4e14c75003803d97e2b6065744155f208d73f76fdbc61e7ffd128a2bc"}},{"ruleId":"D1","level":"warning","message":{"text":"ExperienceExtractor.ExtractExperiences (cyclomatic 17): ExperienceExtractor.ExtractExperiences 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":"internal/runtime/memory/distillation/extractor.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"887578323cc0318dddee7b7acf6843aa04458b303c1fb7207280d1b84b2806a6"}},{"ruleId":"D1","level":"warning","message":{"text":"Pipeline.Run (cyclomatic 17): Pipeline.Run 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":"internal/runtime/memory/pipeline.go"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"883bc981be0354791892d3a70ed4a2277cb1d62dbb5bc21c4604ae6faba02350"}},{"ruleId":"D1","level":"warning","message":{"text":"MCPManager.ApplyConfig (cyclomatic 17): MCPManager.ApplyConfig 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":"internal/runtime/protocol/mcp/manager.go"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"6295791f4c6ab179d193a81cf7bfd6fc719e3fd942eb8bc33681b4ac75f25d56"}},{"ruleId":"D1","level":"warning","message":{"text":"Searcher.Search (cyclomatic 17): Searcher.Search 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, 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":"internal/tools/envcap/envcap.go"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb602b85f1685b783bd8a6e3073f8f80c28e0212b4d78c6feb981bf977ce7e5e"}},{"ruleId":"D1","level":"warning","message":{"text":"KnowledgeUpdate.Execute (cyclomatic 17): KnowledgeUpdate.Execute 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":"internal/tools/resources/builtin/knowledge/knowledge_base.go"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c44668d2628a3580f73dba476e9b56c02ad467a5c0233b7080daa7444d51fb"}},{"ruleId":"D1","level":"warning","message":{"text":"DataValidation.validateSchema (cyclomatic 17): DataValidation.validateSchema 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":"internal/tools/resources/builtin/text/data_validation.go"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f20a53ff7bd87b47ece74a21738922a0966c944414751a77c416bf4cdd2f5d"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfigFile.validateKnowledge (cyclomatic 17): ConfigFile.validateKnowledge 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":"sdk/config.go"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"a858ae8d95a33393b86a11b4110160656455adf02b04caafdd17933b2f3af84f"}},{"ruleId":"D1","level":"warning","message":{"text":"panel.html.renderAgents (cyclomatic 17): panel.html.renderAgents has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 405, 403, 404). 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":"internal/introspect/web/panel.html"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e42b6b69df9365574e186a899c7188a9a96dcb4143d198c7023bf81589a3cc"}},{"ruleId":"D1","level":"warning","message":{"text":"actionHandler.handleSubmitGraph (cyclomatic 16): actionHandler.handleSubmitGraph has cyclomatic complexity 16 (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":"cmd/ares/agent_routes_tasks.go"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30691dbaed9afad2f6bc2dcd81b0cef142e1945ee9049d4aefa540968b93484"}},{"ruleId":"D1","level":"warning","message":{"text":"fileTool.Execute (cyclomatic 16): fileTool.Execute has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/apitools/builtin.go"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cbfc3a5034949c1b505956dfaa27d7bbb64d0473e1c6dcc25119e13d8986738"}},{"ruleId":"D1","level":"warning","message":{"text":"ares_bootstrap.wireMemory (cyclomatic 16): ares_bootstrap.wireMemory has cyclomatic complexity 16 (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":"internal/ares_bootstrap/bootstrap.go"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"09342ec54caf441f481fc44071aec7dce2b77fb13010787aa20083dbf22e5ca5"}},{"ruleId":"D1","level":"warning","message":{"text":"Config.validateEvolution (cyclomatic 16): Config.validateEvolution has cyclomatic complexity 16 (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":"internal/ares_config/config_validate.go"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee14f4cc6b87ad45de19f240b9d4b596adbbb5d58c7278b07699ffd13061c990"}},{"ruleId":"D1","level":"warning","message":{"text":"Config.validateKernel (cyclomatic 16): Config.validateKernel has cyclomatic complexity 16 (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":"internal/ares_config/config_validate.go"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"1818aff5a2449a8bb09db8775c0ff22651212679b25835e84836e5a03a2dee2b"}},{"ruleId":"D1","level":"warning","message":{"text":"MemoryStore.Query (cyclomatic 16): MemoryStore.Query has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/evidence/evidence.go"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"5141a96e46cbd955451b9f20c678ac35d3d3a754414030e872f5006d86c3c6e5"}},{"ruleId":"D1","level":"warning","message":{"text":"answerCognition.ExecuteStep (cyclomatic 16): answerCognition.ExecuteStep has cyclomatic complexity 16 (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":"internal/fabric/agent/l2graph.go"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a93552a951f6140cfd2b5c28eb1fa671fe86565b3e953e0f525c6f99ef7f989"}},{"ruleId":"D1","level":"warning","message":{"text":"plannerCognition.assembleContext (cyclomatic 16): plannerCognition.assembleContext has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/agent/planner_context.go"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"f55d902478c7f27c885f5d7b1f45fd56aa85cc12c766f8253eb474202615a621"}},{"ruleId":"D1","level":"warning","message":{"text":"Scheduler.freeCapableAgents (cyclomatic 16): Scheduler.freeCapableAgents has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/kernel/scheduler_dispatch.go"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d3c83a032da448d7c8f469568bb5a92f53590594eeef8a90e921a51ba9bee3"}},{"ruleId":"D1","level":"warning","message":{"text":"Scheduler.constrainDispatchCandidates (cyclomatic 16): Scheduler.constrainDispatchCandidates has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/kernel/scheduler_placement.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d328d0789f52acac41a5e16e3334c36245fe36d7de292531b4d15a7a31abe4"}},{"ruleId":"D1","level":"warning","message":{"text":"DefaultCompiler.formatPrompt (cyclomatic 16): DefaultCompiler.formatPrompt has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/knowledge/compiler/compiler.go"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ae07279d42d8f38a1eba45ae94fd7ffe184dbcc2bda6cd23a95f77adae95e0"}},{"ruleId":"D1","level":"warning","message":{"text":"KnowledgeRuntime.Execute (cyclomatic 16): KnowledgeRuntime.Execute has cyclomatic complexity 16 (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":"internal/knowledge/runtime/runtime.go"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e191d5490bd84a096a8ddf50c111a0532d32dd8b68f78857339bc0144681f38"}},{"ruleId":"D1","level":"warning","message":{"text":"evolution.RecordPopulationLineage (cyclomatic 16): evolution.RecordPopulationLineage has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/genome_wiring_genealogy.go"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"675e060afa9c36dfef382d39a74057fe305efd8d6c848d485c5a703f3c8f7152"}},{"ruleId":"D1","level":"warning","message":{"text":"evolution.GenerateReport (cyclomatic 16): evolution.GenerateReport has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/report.go"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7d4b8827101e7aaef9c5d7dede1e3853e22dc47e506815812c1fdd957edd83"}},{"ruleId":"D1","level":"warning","message":{"text":"Population.measureNumericDiversityLocked (cyclomatic 16): Population.measureNumericDiversityLocked has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/genome/adaptive.go"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d2e846d3dcc2267f062b074d5be4bd23a8ed49d265144325d76d9149bdb167"}},{"ruleId":"D1","level":"warning","message":{"text":"AdaptiveDistribution.normalizeBoundedLocked (cyclomatic 16): AdaptiveDistribution.normalizeBoundedLocked has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/mutation/adaptive_distribution.go"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6cc1ad93e2430f287557f60e9c4d55a4afc6699123ba44b49af5d4754d4412b"}},{"ruleId":"D1","level":"warning","message":{"text":"LLMArenaScorer.ScoreBatch (cyclomatic 16): LLMArenaScorer.ScoreBatch has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/service/llm_arena_scorer.go"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"0737e664687f1d7780cc0cb1f0ea55b644dfc76e87f66884dbee0f2ab19c75aa"}},{"ruleId":"D1","level":"warning","message":{"text":"Service.createRawComponents (cyclomatic 16): Service.createRawComponents has cyclomatic complexity 16 (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":"internal/runtime/ares_evolution/service/service.go"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d65a895920d15cb4d6bfdd6819b1cd1574277c078cc9dbcaf6882ca9cd37ccf"}},{"ruleId":"D1","level":"warning","message":{"text":"Service.Evolve (cyclomatic 16): Service.Evolve has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/service/service.go"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeee7deb14d8764a1000ea5172834632c230c55c2099e1989e217537dc6736fe"}},{"ruleId":"D1","level":"warning","message":{"text":"eval.ReplayGolden (cyclomatic 16): eval.ReplayGolden has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/eval/replay.go"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad5c41ca14eb3abc877c2fb205656059fc70db130f2395bdff41c70f9577d78"}},{"ruleId":"D1","level":"warning","message":{"text":"ReportGenerator.GenerateMarkdown (cyclomatic 16): ReportGenerator.GenerateMarkdown has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/eval/report.go"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a8b2ec0f3925f6dc4f7bd2ebc8026017db7a5fe038964ec144391ea592a4f8"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkflowDiffer.Diff (cyclomatic 16): WorkflowDiffer.Diff has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/evolution/diff/workflow_differ.go"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b403af26fb0dd5fad478ec9cc0f4a80d6472d173fbc1a34ce3331c5b132faaeb"}},{"ruleId":"D1","level":"warning","message":{"text":"distillation.IsProblem (cyclomatic 16): distillation.IsProblem has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/memory/distillation/detector.go"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd0e9f9e0d1aa815e7e18bedd99e743d491caaa0e2281d97dc056d4a53064e1"}},{"ruleId":"D1","level":"warning","message":{"text":"ares_mcp.safeRequestHost (cyclomatic 16): ares_mcp.safeRequestHost has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/protocol/mcp/transport_server.go"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf88e7d253da11d2993d4728aa0afb4fcd27d550ddd0601200861d3af8ed6c5"}},{"ruleId":"D1","level":"warning","message":{"text":"MCPToolFactory.Create (cyclomatic 16): MCPToolFactory.Create has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/protocol/mcp/factory.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8dc54d49356fcf2c2e9ded5d552f28c539fb3908ac2eb6061ebd1a68d759d50"}},{"ruleId":"D1","level":"warning","message":{"text":"EmbeddingConfig.Validate (cyclomatic 16): EmbeddingConfig.Validate has cyclomatic complexity 16 (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":"internal/storage/postgres/config.go"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4daa2b6834511b0d61c0f4f0b0f8d17a0b13882cc412d554197b453651a5395"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolExecutionBridge.executeMultiStep (cyclomatic 16): ToolExecutionBridge.executeMultiStep has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tools/planner/bridge.go"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"332d48ba2108c4be02a06949e9a15930f639f63524a65dbc1766d8c6bb0ecc93"}},{"ruleId":"D1","level":"warning","message":{"text":"Planner.Plan (cyclomatic 16): Planner.Plan has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tools/planner/planner.go"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee0cc2bd8b1c5287635938d924c57ae5cfbb4c9822f396d8becb02f46386591"}},{"ruleId":"D1","level":"warning","message":{"text":"StoreAdapter.UpdateKnowledge (cyclomatic 16): StoreAdapter.UpdateKnowledge has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tools/resources/builtin/knowledge/store_adapter.go"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"96aa2369c0d90f5494e647d106487702b5373bc2ba7b074003cf8cf396832c64"}},{"ruleId":"D1","level":"warning","message":{"text":"PDFTool.extractText (cyclomatic 16): PDFTool.extractText has cyclomatic complexity 16 (threshold 15). 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, 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":"internal/tools/resources/builtin/pdf/pdf.go"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3d3920e1dda76671c380efe763fd8e62491a15c7f7e1af9ff97de2ee345b4a"}},{"ruleId":"D1","level":"warning","message":{"text":"CapabilitySelector.Select (cyclomatic 16): CapabilitySelector.Select has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tools/toolsource/capability_selector.go"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"109cb78b5c848fd03625c03d2eee29832c3c2695f493660c47403e8e39332b81"}},{"ruleId":"D1","level":"warning","message":{"text":"panel.html.agentRow (cyclomatic 16): panel.html.agentRow has cyclomatic complexity 16 (threshold 15). 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":"internal/introspect/web/panel.html"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"2011f137a63364151063d8fd366ce69020e9d51e5aba46e169063c432dd7495c"}},{"ruleId":"D2","level":"warning","message":{"text":"MutableDAG.ReplaceNode (cognitive 116): MutableDAG.ReplaceNode has cognitive complexity 116 (threshold 15). Drivers by points: if/else 29 (68 pts), loops 19 (43 pts), boolean chains 5 (nesting depth added 63). 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":"internal/fabric/task/workflow/engine/mutable_dag.go"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ad571d7b86ef66cfadb13f437127f54f901bd35d0ea99663f85121ce2eb5b0"}},{"ruleId":"D2","level":"warning","message":{"text":"Compactor.buildSummary (cognitive 106): Compactor.buildSummary has cognitive complexity 106 (threshold 15). Drivers by points: if/else 34 (92 pts), boolean chains 12, loops 1, match/switch 1 (nesting depth added 58). 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":"internal/ares_events/compactor.go"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d560f3e7985167782b3afff39fec3c6730c9077798d8006e49d457d352986e"}},{"ruleId":"D2","level":"warning","message":{"text":"FileTools.listFiles (cognitive 69): FileTools.listFiles has cognitive complexity 69 (threshold 15). Drivers by points: if/else 30 (65 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 36). Of this number, 39 points are the body\u0027s own statements and 30 belong to one function literal inside it that branches. 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":"internal/tools/resources/builtin/file/file_tools.go"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"135c51b400445674b8c21c36a5aa7016c9475efdfdb1702b4026b9d383cee55d"}},{"ruleId":"D2","level":"warning","message":{"text":"MCPConfigWatcher.Start (cognitive 60): MCPConfigWatcher.Start has cognitive complexity 60 (threshold 15). Drivers by points: if/else 11 (38 pts), match/switch 4 (18 pts), loops 2 (4 pts) (nesting depth added 43). Of this number, 59 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/protocol/mcp/config_watcher.go"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63c3eaef5561c9a9938f14a6f5b00fd1fd0d37f3f1f5f440d459320931d94d3"}},{"ruleId":"D2","level":"warning","message":{"text":"evolution.RunIdleEvolution (cognitive 58): evolution.RunIdleEvolution has cognitive complexity 58 (threshold 15). Drivers by points: if/else 20 (48 pts), loops 2 (5 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 32). 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":"internal/runtime/ares_evolution/genome_wiring_idle.go"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"e447a5e77063883d11d2a66403e422412221024dc562c8d8f54ced3153b902ac"}},{"ruleId":"D2","level":"warning","message":{"text":"Fabric.recordWithExtrasLocked (cognitive 53): Fabric.recordWithExtrasLocked has cognitive complexity 53 (threshold 15). Drivers by points: if/else 26 (50 pts), boolean chains 2, loops 1 (nesting depth added 24). 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":"internal/fabric/task/fabric_events.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ed66bc2ece0baed4ded28b6cd56b9392f68e680e1a7cafc8eeca14b278628e"}},{"ruleId":"D2","level":"warning","message":{"text":"ExperienceExtractor.parseUserProfile (cognitive 53): ExperienceExtractor.parseUserProfile has cognitive complexity 53 (threshold 15). Drivers by points: if/else 12 (34 pts), loops 7 (15 pts), boolean chains 4 (nesting depth added 30). 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":"internal/runtime/memory/distillation/extractor.go"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"681ea506e1975f895e71d56c9d632c45944b419ed096458dc2c47c5138a2c483"}},{"ruleId":"D2","level":"warning","message":{"text":"Manager.executePhase (cognitive 52): Manager.executePhase has cognitive complexity 52 (threshold 15). Drivers by points: if/else 12 (26 pts), match/switch 6 (15 pts), loops 5 (9 pts), jumps 2 (nesting depth added 27). Of this number, 39 points are the body\u0027s own statements and 13 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/ares_shutdown/manager.go"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e724b7bf24c08bedb3d38e69c88f651312167d273ca9526090900e637dd7a90"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler.planPreemptions (cognitive 52): Scheduler.planPreemptions has cognitive complexity 52 (threshold 15). Drivers by points: if/else 13 (30 pts), loops 10 (16 pts), boolean chains 6 (nesting depth added 23). Of this number, 46 points are the body\u0027s own statements and 6 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":"internal/kernel/scheduler_dispatch.go"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8cdff5275b05146cf51c1228759caff098cf0491ba099d3bca870aac602c70"}},{"ruleId":"D2","level":"warning","message":{"text":"EvolutionProvider.Stream (cognitive 52): EvolutionProvider.Stream has cognitive complexity 52 (threshold 15). Drivers by points: if/else 16 (34 pts), match/switch 3 (11 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 29). None of this is in the body itself: all 52 points belong to one function literal inside it that branches (line 101). 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":"internal/knowledge/provider/evolution/provider.go"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f52a931dc422ba3894dc0ca6ba78ad44a2a4564c593826013fe4355b5408b9a"}},{"ruleId":"D2","level":"warning","message":{"text":"KnowledgePipeline.Process (cognitive 51): KnowledgePipeline.Process has cognitive complexity 51 (threshold 15). Drivers by points: if/else 17 (40 pts), loops 5 (10 pts), boolean chains 1 (nesting depth added 28). 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":"internal/knowledge/pipeline.go"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"154e9573790207f365fb4f3a34e467f42ecb13f01918c920fdb59382f683dcd0"}},{"ruleId":"D2","level":"warning","message":{"text":"Config.setDefaults (cognitive 50): Config.setDefaults has cognitive complexity 50 (threshold 15). Drivers by points: if/else 41 (47 pts), loops 2, boolean chains 1 (nesting depth added 6). 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":"internal/ares_config/config_defaults.go"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"55cb8bf9cab78c4f04dc0c0ee86a992e79ab32de758b842a33cae4641cf085f0"}},{"ruleId":"D2","level":"warning","message":{"text":"KnowledgeRepository.CreateBatch (cognitive 50): KnowledgeRepository.CreateBatch has cognitive complexity 50 (threshold 15). Drivers by points: if/else 20 (42 pts), loops 5 (8 pts) (nesting depth added 25). Of this number, 47 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/storage/postgres/repositories/knowledge_repository.go"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e51bd5cb42fe0996b2001245265a8fd7cd3ba949dee5d27526272ff1257a42c"}},{"ruleId":"D2","level":"warning","message":{"text":"Service.CreateWiredSystem (cognitive 49): Service.CreateWiredSystem has cognitive complexity 49 (threshold 15). Drivers by points: if/else 27 (42 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 16). Of this number, 30 points are the body\u0027s own statements and 19 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":"internal/runtime/ares_evolution/service/service.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8dccccf3acdf35c76c6694fc1a30f57f3a8bfd0e420ce4688b7c35efc34c1b7"}},{"ruleId":"D2","level":"warning","message":{"text":"ares_events.DefaultSummarizer (cognitive 48): ares_events.DefaultSummarizer has cognitive complexity 48 (threshold 15). Drivers by points: if/else 20 (40 pts), boolean chains 6, loops 1, match/switch 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":"internal/ares_events/compactor.go"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f596c69ed19c28d5ab2796a99a88d8a652455df74e82372cf84dc8ced6b39e8"}},{"ruleId":"D2","level":"warning","message":{"text":"main.runKernelRecoveryLoop (cognitive 47): main.runKernelRecoveryLoop has cognitive complexity 47 (threshold 15). Drivers by points: if/else 19 (39 pts), match/switch 4 (5 pts), loops 2, boolean chains 1 (nesting depth added 21). Most of this is not in the body itself: 14 of the 47 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 459, 551, 601). 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":"cmd/ares/kernel_loop.go"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52071ceadade3e667c9bf7fb40f7f1b339ef9b771a8043ec102863a346afdc9"}},{"ruleId":"D2","level":"warning","message":{"text":"main.setupPeerRegistry (cognitive 46): main.setupPeerRegistry has cognitive complexity 46 (threshold 15). Drivers by points: if/else 13 (32 pts), loops 2 (7 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 26). Most of this is not in the body itself: 12 of the 46 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 390, 453, 513). 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":"cmd/ares/serve_peer.go"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"69fe2ccc3cbc5cb9a87e6301c72b6bdcaf8c13a5b386da6dfe5f8367642497b8"}},{"ruleId":"D2","level":"warning","message":{"text":"Fabric.foldRestoreEvent (cognitive 46): Fabric.foldRestoreEvent has cognitive complexity 46 (threshold 15). Drivers by points: if/else 17 (35 pts), match/switch 4 (7 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/task/restore.go"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a8980759b31cbf3b63382451a2d96065a6484e9370cecbf279186599701ab7"}},{"ruleId":"D2","level":"warning","message":{"text":"main.runEvolutionCycle (cognitive 45): main.runEvolutionCycle has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (34 pts), loops 8 (11 pts) (nesting depth added 22). 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":"cmd/ares/evolution.go"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ad10ac5c20ea715e03e8fc60a47eee64691e232b71a1b1515a3cf78fb67917"}},{"ruleId":"D2","level":"warning","message":{"text":"ares_bootstrap.wireRetrievers (cognitive 45): ares_bootstrap.wireRetrievers has cognitive complexity 45 (threshold 15). Drivers by points: if/else 23 (42 pts), boolean chains 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/ares_bootstrap/retriever_wiring.go"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8469f1c979c9d9461cf962e8dede50accc6ebe433ae8039eea61a25defabc01"}},{"ruleId":"D2","level":"warning","message":{"text":"Fabric.CompilePlan (cognitive 44): Fabric.CompilePlan has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (36 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/task/workflow_plan.go"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"67dabb2a4cd7bd3b0d7f3adc7df2136052fb7933bfb4d570b60833c7bf8bc0be"}},{"ruleId":"D2","level":"warning","message":{"text":"DreamCycle.findWinner (cognitive 44): DreamCycle.findWinner has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (34 pts), loops 5 (8 pts), boolean chains 2 (nesting depth added 19). Of this number, 39 points are the body\u0027s own statements and 5 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":"internal/runtime/ares_evolution/dream_cycle_winner.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"d751e90a51c419855a68f3e3993bddab8d19446e97f7547280c32ec8cb7e8db4"}},{"ruleId":"D2","level":"warning","message":{"text":"main.liveChaosLoop (cognitive 43): main.liveChaosLoop has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (39 pts), match/switch 1 (2 pts), boolean chains 1, loops 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":"cmd/ares/serve_chaos_domain.go"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9ab4fc142794823dce027d147834d7647fe73384f802a6f630b6d0852e1889"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigStore.Watch (cognitive 43): ConfigStore.Watch has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (27 pts), match/switch 3 (11 pts), loops 2 (4 pts), jumps 1 (nesting depth added 25). Of this number, 42 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/ares_config/store.go"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf63f269839f58f240f2e08e05806dc5cb0c8d909029eb9ba33423db969c0ee"}},{"ruleId":"D2","level":"warning","message":{"text":"FileWatcher.scanAndLoad (cognitive 43): FileWatcher.scanAndLoad has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (28 pts), loops 9 (12 pts), boolean chains 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/task/workflow/engine/reloader.go"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0999b3de25ea2a87a8286d5c45adafaf5a122e579022a990e2799af504a216"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.HybridSearch (cognitive 43): Store.HybridSearch has cognitive complexity 43 (threshold 15). Drivers by points: if/else 18 (31 pts), loops 6 (11 pts), boolean chains 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":"internal/knowledge/store/postgres/store.go"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea306b40eeac61f6b1fdb0fa1b841ee52e37e894597118a920daec52f594636"}},{"ruleId":"D2","level":"warning","message":{"text":"AdaptiveDistribution.normalizeBoundedLocked (cognitive 43): AdaptiveDistribution.normalizeBoundedLocked has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 7 (16 pts) (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":"internal/runtime/ares_evolution/mutation/adaptive_distribution.go"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa38b1a64913464db033c5e8906f0e635e29a3e5a23b7a5eb6d6e20e622c887"}},{"ruleId":"D2","level":"warning","message":{"text":"UserProfile.Execute (cognitive 43): UserProfile.Execute has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (35 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tools/resources/builtin/memory/memory_tools.go"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"7afe4d47f6d4731c320dfc5ac4d761a27dc60573d678b3fa9c3f3e93bfd3a04e"}},{"ruleId":"D2","level":"warning","message":{"text":"main.runCollabGraph (cognitive 42): main.runCollabGraph has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 8 (10 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 16). Of this number, 38 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/ares/agent_routes_tasks.go"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81cae303feaa60dfdeece6cdaedf520a39b79b5e076a4fc9e2f40518b976f19"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.Query (cognitive 42): Store.Query has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 4 (11 pts), boolean chains 2 (nesting depth added 25). 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":"internal/knowledge/store/memory/store.go"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed2c884ca64545c29d89aca9271389a19b1a47e9062753d1903f8bf98889bba"}},{"ruleId":"D2","level":"warning","message":{"text":"actionHandler.handleChaos (cognitive 41): actionHandler.handleChaos has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (34 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 22). 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":"cmd/ares/agent_routes_chaos.go"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed66b17b7d360bfad934088041a7ae26ced42fdffa05c143db68f898114b9147"}},{"ruleId":"D2","level":"warning","message":{"text":"MemoryPatchExecutor.Apply (cognitive 40): MemoryPatchExecutor.Apply has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (32 pts), boolean chains 7, match/switch 1 (nesting depth added 15). Of this number, 39 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/memory/memory_patcher.go"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a59cf2548300584d8e61b287cd0cc79e1f9fc82e3d23fecce738f97b99d08b"}},{"ruleId":"D2","level":"warning","message":{"text":"ares_bootstrap.ProvideNewEvolution (cognitive 39): ares_bootstrap.ProvideNewEvolution has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17 (31 pts), loops 4 (8 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/ares_bootstrap/provide_new_evolution.go"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"c557a357e1a6464a45cf020bafba99843138e8c671e7b495c2db6420f0f3f96b"}},{"ruleId":"D2","level":"warning","message":{"text":"Fabric.flushAppendsDetailed (cognitive 39): Fabric.flushAppendsDetailed has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (36 pts), loops 2 (3 pts) (nesting depth added 22). 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":"internal/fabric/task/fabric_events.go"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"de00f0dfa2ac3e077555e25b1005824bdb54eeeb43a761ba1f81b94f276d8723"}},{"ruleId":"D2","level":"warning","message":{"text":"KnowledgeRuntime.loadAndProcess (cognitive 39): KnowledgeRuntime.loadAndProcess has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 3 (7 pts), match/switch 2 (5 pts), jumps 2, boolean chains 1 (nesting depth added 22). Most of this is not in the body itself: 7 of the 39 points are its own statements and the rest belongs to one function literal inside it that branches (line 263). 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":"internal/knowledge/runtime/runtime.go"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"16230b1fd4bdfb20fb21de59064057c91f5d25aeb37064b772f96293e569015a"}},{"ruleId":"D2","level":"warning","message":{"text":"ContextCleaner.CleanWithTurns (cognitive 39): ContextCleaner.CleanWithTurns has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 3 (7 pts), match/switch 1 (4 pts), boolean chains 3 (nesting depth added 22). 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":"internal/runtime/memory/context/cleaner.go"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4001b9ad9562176ad08f503e38b83f9de53952f467eeb254e5dc0e2772baf2d"}},{"ruleId":"D2","level":"warning","message":{"text":"evolutionTrajectoryAdapter.EvolutionTrajectory (cognitive 38): evolutionTrajectoryAdapter.EvolutionTrajectory has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 4 (10 pts) (nesting depth added 24). 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":"internal/ares_bootstrap/dashboard_observability.go"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ababf307657c428e90aad871f6370ce41cdbaae30c69fbe2c5dd5bda6c47304"}},{"ruleId":"D2","level":"warning","message":{"text":"taskfabric.DecodeCheckpoint (cognitive 38): taskfabric.DecodeCheckpoint has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (34 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 22). 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":"internal/fabric/task/checkpoint_schema.go"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac98ce3e0d75a6ef946fb17adffff3a8660bfe38664f277bb65dcaedeac5219"}},{"ruleId":"D2","level":"warning","message":{"text":"FailoverClient.GenerateStream (cognitive 38): FailoverClient.GenerateStream has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (28 pts), match/switch 3 (7 pts), loops 2 (3 pts) (nesting depth added 22). Of this number, 31 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/llm/failover.go"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f7f04dbc6b80b0b49d650ef9c55585bc6cac8d0f9df7b58b93eff6ed9b0277"}},{"ruleId":"D2","level":"warning","message":{"text":"ExperienceExtractor.ExtractExperiences (cognitive 38): ExperienceExtractor.ExtractExperiences has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (31 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 23). 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":"internal/runtime/memory/distillation/extractor.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7c38a66cbb4cdf40d3898f6545b4a2aef7eaf76da79d708790bade56f98104"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolExecutionBridge.executeMultiStep (cognitive 38): ToolExecutionBridge.executeMultiStep has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 6 (14 pts), boolean chains 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tools/planner/bridge.go"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"06730c23ec4ea52d10772e59f055e8a0802e880e965f18e6703e46d951236671"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigFile.ToOptions (cognitive 38): ConfigFile.ToOptions has cognitive complexity 38 (threshold 15). Drivers by points: if/else 25 (36 pts), loops 1, match/switch 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":"sdk/config.go"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ebeb184df73a461b6be258afd14e85b942e82300542d438ab977795311ede5"}},{"ruleId":"D2","level":"warning","message":{"text":"plannerCognition.growToolNodes (cognitive 37): plannerCognition.growToolNodes has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (34 pts), boolean chains 2, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/agent/planner_cognition.go"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"848b7dc82e84369f5b7eddced16e60283e57335999eb9eca311839cc1cc89192"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler.executeWithCandidates (cognitive 36): Scheduler.executeWithCandidates has cognitive complexity 36 (threshold 15). Drivers by points: if/else 24 (30 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 7). Of this number, 28 points are the body\u0027s own statements and 8 belong to 3 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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/kernel/scheduler_execute.go"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"621e5f641e4fbf83d18ede5f9e1607159cf839475fecfe48736a45cc26a5be5e"}},{"ruleId":"D2","level":"warning","message":{"text":"Manager.Stop (cognitive 36): Manager.Stop has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 3 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 18). Of this number, 29 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/manager_lifecycle.go"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc763faf7f4be126702bc5a752f7d0f8602bb4913b02c2eb08bf733ca7564cb6"}},{"ruleId":"D2","level":"warning","message":{"text":"distillation.extractEvidenceFromMessages (cognitive 35): distillation.extractEvidenceFromMessages has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/memory/distillation/distiller_admin.go"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd31e2dbb57945a0f3a101173c67115226c3f0daadbcc3fc619aa8a243c0b88"}},{"ruleId":"D2","level":"warning","message":{"text":"plannerCognition.ExecuteStep (cognitive 34): plannerCognition.ExecuteStep has cognitive complexity 34 (threshold 15). Drivers by points: if/else 19 (27 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/agent/planner_cognition.go"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a9283d04065783eaa8d76c5c6045c32a9cf7637026bf8db2500aca66e87427"}},{"ruleId":"D2","level":"warning","message":{"text":"LogAnalyzer.extractMetrics (cognitive 34): LogAnalyzer.extractMetrics has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 6 (10 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tools/resources/builtin/text/log_analyzer.go"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4231c7f3deea2c3e2a699fbb08f43fd92ccf2ce1666a0cf8339c20241c889c0"}},{"ruleId":"D2","level":"warning","message":{"text":"panel.html.renderOverview (cognitive 34): panel.html.renderOverview has cognitive complexity 34 (threshold 15). Drivers by points: boolean chains 17, ternaries 3 (9 pts), if/else 8 (nesting depth added 6). Of this number, 32 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":"internal/introspect/web/panel.html"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24cc1ef57b44bc9f9e8fed13de57e3cf6175463bdaba49868884d626352c90f"}},{"ruleId":"D2","level":"warning","message":{"text":"providers.scanConfigFile (cognitive 33): providers.scanConfigFile has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 3 (6 pts), boolean chains 3 (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":"internal/discovery/providers/filesystem.go"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc5b8ab5d65d2dd58296d60a54ef1f39026751515aff328a63b2e9e0806d4b6"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultEntityMatcher.MatchTokens (cognitive 33): DefaultEntityMatcher.MatchTokens has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (26 pts), loops 3 (4 pts), boolean chains 3 (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":"internal/knowledge/pipeline/normalizer.go"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"13fb006ed94f7e4ea595db9ca0b82f1213d5079bdd67ef42c861374d3053749c"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultReducer.Reduce (cognitive 33): DefaultReducer.Reduce has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 7 (8 pts), boolean chains 2 (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":"internal/knowledge/runtime/components.go"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad876cb0381cea5f279060808ed0232095b086d5dd1f0b87bd27c35f930989e9"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.HybridSearch (cognitive 33): Store.HybridSearch has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 5 (8 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/knowledge/store/memory/store.go"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"3add59ffc372566384920f14e65fb950d0cecfdc77e3ac90853d1105973ffbe4"}},{"ruleId":"D2","level":"warning","message":{"text":"arena.RunScenarioReport (cognitive 33): arena.RunScenarioReport has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (22 pts), match/switch 3 (7 pts), loops 3, 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":"internal/runtime/arena/scenario.go"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0b86dc97e431a34198ca48c55a5be24ba6a8496c49e2c25cc24e07786eefa6"}},{"ruleId":"D2","level":"warning","message":{"text":"RegressionTester.runAdaptive (cognitive 33): RegressionTester.runAdaptive has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 3, loops 1 (nesting depth added 14). Of this number, 29 points are the body\u0027s own statements and 4 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":"internal/runtime/arena/regression.go"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"be48747ceb4bd4967e7603909af130fddf2d098fe1a590a5b13fb0d3b9da5a77"}},{"ruleId":"D2","level":"warning","message":{"text":"Pipeline.Run (cognitive 33): Pipeline.Run has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (31 pts), boolean chains 1, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/memory/pipeline.go"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a741597c55f3d9d6f3f6d18a1c653f1d14d2f8dd88f46313ff98617b380a036"}},{"ruleId":"D2","level":"warning","message":{"text":"DateTime.Execute (cognitive 33): DateTime.Execute has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (27 pts), loops 2 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tools/resources/builtin/math/calculator.go"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e117733ed8598a6bc7bc2b9b921b774248d5f7ab6d803fa2a5fd5b2b92abcce"}},{"ruleId":"D2","level":"warning","message":{"text":"HTTPRequest.Execute (cognitive 33): HTTPRequest.Execute has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (25 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 8). Of this number, 32 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tools/resources/builtin/network/http_request.go"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"63905a3139642c6cdcf1914435d6e915795ef52ddd976a0433d8e4658367c407"}},{"ruleId":"D2","level":"warning","message":{"text":"JSONTools.extract (cognitive 33): JSONTools.extract has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (30 pts), boolean chains 2, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tools/resources/builtin/text/json_tools.go"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"876bf24932855aeb3772e2ac625938f23509923a42a6ade02527fe22ac1b3045"}},{"ruleId":"D2","level":"warning","message":{"text":"llm.withRetry (cognitive 32): llm.withRetry has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 15). Of this number, 30 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/llm/resilience.go"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c29a4470e05150d075fa5049148a4df8a18d39b90808b4abfbbede9da78fe7"}},{"ruleId":"D2","level":"warning","message":{"text":"memory.causalUnits (cognitive 32): memory.causalUnits has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (22 pts), loops 3 (7 pts), boolean chains 3 (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":"internal/runtime/memory/token_budget.go"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9fb08d9946676d9e6a0d0c2f8ce2c0e3a96ecdef81dac4e9163aacc88cb1fd2"}},{"ruleId":"D2","level":"warning","message":{"text":"MCPManager.ApplyConfig (cognitive 32): MCPManager.ApplyConfig has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 4 (6 pts), boolean chains 3 (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":"internal/runtime/protocol/mcp/manager.go"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de03aa8b2169a0f90281a3633b357bbdd29f6ab8b288ee2f98b7b30c983c8db"}},{"ruleId":"D2","level":"warning","message":{"text":"SecretRepository.Import (cognitive 32): SecretRepository.Import has cognitive complexity 32 (threshold 15). Drivers by points: if/else 19 (29 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 11). Of this number, 29 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/storage/postgres/repositories/secret_repository.go"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30f982e6ebc715b058b43071d92b03b9a18722954315674736350b0caba57d5"}},{"ruleId":"D2","level":"warning","message":{"text":"CompactableEventStore.archivePendingRoundsOnce (cognitive 31): CompactableEventStore.archivePendingRoundsOnce has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 4, 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":"internal/ares_events/compactable_store.go"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"6107426a4b10b0fa0ace262bbe249e0adc212c959d7b72559436d56ba700a8d7"}},{"ruleId":"D2","level":"warning","message":{"text":"PostgresEventStore.Append (cognitive 31): PostgresEventStore.Append has cognitive complexity 31 (threshold 15). Drivers by points: if/else 17 (26 pts), boolean chains 4, loops 1 (nesting depth added 9). Of this number, 27 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/ares_events/pg_store.go"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"f784330c0cb2ed20df11b7c8998d0cd77aa1c5b0803a1f4f2d9242a070cb9752"}},{"ruleId":"D2","level":"warning","message":{"text":"discovery.mergeRecords (cognitive 31): discovery.mergeRecords has cognitive complexity 31 (threshold 15). Drivers by points: loops 8 (17 pts), if/else 5 (13 pts), boolean chains 1 (nesting depth added 17). Of this number, 29 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/discovery/identity.go"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbc7f548a29f10d545989566315fe1f4dea6e59584808df88343ba579c6e577"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.HybridSearch (cognitive 31): Store.HybridSearch has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 4 (7 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":"internal/knowledge/store/sqlite/store.go"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac59110cbdbd687215a040eb21ce20640b21667fff5e2feb6dcade66ff8daa7"}},{"ruleId":"D2","level":"warning","message":{"text":"evolution.GenerateReport (cognitive 31): evolution.GenerateReport has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 4 (10 pts), boolean chains 1, match/switch 1 (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":"internal/runtime/ares_evolution/report.go"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83e3dfbd407529dc884c606d1c40d5b26972bb09a71b9053face17016082ed4"}},{"ruleId":"D2","level":"warning","message":{"text":"evolution.ReconcileToolClassDAG (cognitive 31): evolution.ReconcileToolClassDAG has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 3, loops 3 (nesting depth added 11). Of this number, 30 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/toolclass_reconcile.go"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"402314ff4059f66275856376807fd70fd2ed2181cc73d1ddc0b4a00aa8bd8f8f"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeFitnessAggregator.querySourceMeanScopedAt (cognitive 31): RuntimeFitnessAggregator.querySourceMeanScopedAt has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 3, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/fitness_aggregator.go"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"753941a9ad73f2b7031d03d1beef866c70e9642f9144e8a7acb9dec03f221494"}},{"ruleId":"D2","level":"warning","message":{"text":"Distiller.resolveConflictsPhase (cognitive 31): Distiller.resolveConflictsPhase has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (25 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (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":"internal/runtime/memory/distillation/distiller.go"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"60573b197a33532921b75610925b959a93eb1647c3e235f0816f41025dd8e5ab"}},{"ruleId":"D2","level":"warning","message":{"text":"EmbeddingClient.EmbedBatch (cognitive 31): EmbeddingClient.EmbedBatch has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 3 (4 pts) (nesting depth added 18). 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":"internal/storage/postgres/embedding/client.go"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae58036546ee33ab66537989c6f4f85312f675d2a054d5f0a3fbe2c8999e53f3"}},{"ruleId":"D2","level":"warning","message":{"text":"ares_bootstrap.buildRegressionGate (cognitive 30): ares_bootstrap.buildRegressionGate has cognitive complexity 30 (threshold 15). Drivers by points: if/else 18 (26 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/ares_bootstrap/regression_gate_wiring.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0f38289d619a3f23937d36c50c063a4b95cfca51374ee7e7e395a5abd6e6ec"}},{"ruleId":"D2","level":"warning","message":{"text":"Fabric.ReclaimIdle (cognitive 30): Fabric.ReclaimIdle has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 6 (10 pts), boolean chains 3 (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":"internal/fabric/agent/reclaim.go"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"444c6765a5fea7eef6c8168547cd9a2dcdd52713cbed25851b296a772afe10a2"}},{"ruleId":"D2","level":"warning","message":{"text":"archive.extractVerdict (cognitive 30): archive.extractVerdict has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 5, loops 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":"internal/runtime/archive/extract.go"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e8a6c63c585167b8ec1e8bdcb54617f6c38177de4e252218a957c001fa8321"}},{"ruleId":"D2","level":"warning","message":{"text":"evolution.ReportString (cognitive 30): evolution.ReportString has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 4 (9 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/report.go"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"de045e66f93ec23d7d33b911ab54d7cb45516fdd4b40855b35e086a73595fdfc"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultNormalizer.Normalize (cognitive 30): DefaultNormalizer.Normalize has cognitive complexity 30 (threshold 15). Drivers by points: if/else 20 (26 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 7). 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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/experience/normalizer.go"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d4f52f1999321e271e6e6e6f2b42fd2ed5aff7aade29125dca0bd96338e385"}},{"ruleId":"D2","level":"warning","message":{"text":"Population.measureNumericDiversityLocked (cognitive 30): Population.measureNumericDiversityLocked has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 6 (13 pts), boolean chains 1 (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":"internal/runtime/ares_evolution/genome/adaptive.go"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02a627d2c385cb2816aece07c104a9e82a768042dc39ffa310f54eeffd2368d"}},{"ruleId":"D2","level":"warning","message":{"text":"actionHandler.handleSubmitTask (cognitive 29): actionHandler.handleSubmitTask has cognitive complexity 29 (threshold 15). Drivers by points: if/else 20 (27 pts), boolean chains 2 (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":"cmd/ares/agent_routes_tasks.go"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"6acc5334a99198dcacef00b2192514060869d6ca3efc3be68a1373017dea0d59"}},{"ruleId":"D2","level":"warning","message":{"text":"ares_bootstrap.wireLifecycleGates (cognitive 29): ares_bootstrap.wireLifecycleGates has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 5 (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":"internal/ares_bootstrap/bootstrap_evolution.go"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"022ee067fd28c6c2bcc2c2cdd7512bec0bfca3166412ca9d50f1a5d999e51c53"}},{"ruleId":"D2","level":"warning","message":{"text":"Orchestrator.Shutdown (cognitive 29): Orchestrator.Shutdown has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (21 pts), match/switch 3 (5 pts), loops 2, 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":"internal/kernel/orchestrator.go"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"427903d6cd8dd68f67681025b680789b9eb2ed1aa74febc2db3a676e7d7105da"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler.freeAgentIDs (cognitive 29): Scheduler.freeAgentIDs has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/kernel/scheduler_dispatch.go"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"98917ec245bfb21cfe050214604eb380e93b676694456a6e76f2d8fe8070a42e"}},{"ruleId":"D2","level":"warning","message":{"text":"KnowledgeAgent.Process (cognitive 29): KnowledgeAgent.Process has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 1 (3 pts), match/switch 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/knowledge/workflow/workflow.go"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e9b8058ce1713533d94b6192924094ca8d8572e7e0c864ba962c340786b482"}},{"ruleId":"D2","level":"warning","message":{"text":"GenomePopulationAdapter.recordOutcomesLocked (cognitive 29): GenomePopulationAdapter.recordOutcomesLocked has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 2 (nesting depth added 17). 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":"internal/runtime/ares_evolution/genome_wiring_run.go"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4e81744e77bf083de28ba32b3c62f108c78caef0ac881d804c445848911551"}},{"ruleId":"D2","level":"warning","message":{"text":"ExperienceGuidedMutator.chooseGuidedMutationType (cognitive 29): ExperienceGuidedMutator.chooseGuidedMutationType has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 8, match/switch 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":"internal/runtime/ares_evolution/mutation/guided_mutator.go"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"128fbc08453bc75c157a8e42e993ed48fbcc8a5351e972332dd48ad4c8ede77f"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowGenome.mutateMergeNodes (cognitive 29): WorkflowGenome.mutateMergeNodes has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (22 pts), loops 3 (7 pts) (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":"internal/runtime/evolution/genome/workflow_genome.go"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52fa1756e4753edfd406948cace3a9fde420d7a8c4a5c8e642e38c5936eb11a"}},{"ruleId":"D2","level":"warning","message":{"text":"Searcher.Search (cognitive 29): Searcher.Search has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 3 (8 pts), boolean chains 3 (nesting depth added 13). Of this number, 28 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tools/envcap/envcap.go"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73f380603ae81d6c6e7aeb5d994ddba7f01063c3a1a7cdb1c8f812ccfa35270"}},{"ruleId":"D2","level":"warning","message":{"text":"agentsyscall.BindTools (cognitive 28): agentsyscall.BindTools has cognitive complexity 28 (threshold 15). Drivers by points: if/else 18 (22 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 6). Most of this is not in the body itself: 2 of the 28 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 810, 837, 873, \u2026). 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":"internal/agentsyscall/syscall.go"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff8cc09fde9691fe99d3b933c609e06bf879ee82874ea2fe5369a4309980b6c"}},{"ruleId":"D2","level":"warning","message":{"text":"NewEvolutionComponents.UpdateLiveDAG (cognitive 28): NewEvolutionComponents.UpdateLiveDAG has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (24 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":"internal/ares_bootstrap/provide_new_evolution.go"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f9076d5ec9661684283157686942da4f74e0a5b1bcaafb1f1d193fe9d22a6b"}},{"ruleId":"D2","level":"warning","message":{"text":"Client.streamAnthropic (cognitive 28): Client.streamAnthropic has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (20 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 9). Most of this is not in the body itself: 10 of the 28 points are its own statements and the rest belongs to one function literal inside it that branches (line 662). 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":"internal/llm/client.go"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a6d1cebc2fc716499d82886001bbd7a552a90e4981c11e6f881006c91d8be7"}},{"ruleId":"D2","level":"warning","message":{"text":"genome.computeParamRanges (cognitive 28): genome.computeParamRanges has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/genome/adaptive.go"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8c01dadec4db03b9f2e11a4d366478a352f70c9b49ad8186d4f42113559bf6"}},{"ruleId":"D2","level":"warning","message":{"text":"Population.doEvolve (cognitive 28): Population.doEvolve has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 4). Of this number, 27 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"internal/runtime/ares_evolution/genome/population.go"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"c665a5b391b8959dea33acd0f69a0486194b1fed29c42e2262c6d9ed64227741"}},{"ruleId":"D2","level":"warning","message":{"text":"Population.generateOffspringUnlocked (cognitive 28): Population.generateOffspringUnlocked has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 2 (5 pts), loops 1 (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":"internal/runtime/ares_evolution/genome/population.go"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1b8dcaee14cff2c87dd04bbfc6b38df4bf8cf08176a2fa9fb1659ff14176cd"}},{"ruleId":"D2","level":"warning","message":{"text":"app.embed_batch (cognitive 28): app.embed_batch has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (14 pts), error handling 2 (7 pts), loops 2 (4 pts), ternaries 3 (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":"services/embedding/app.py"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7d94cfafe377eea47b7fa22ddb0b03a2606147a54f75f61430a29c3ca92adc"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine.DiscoverNow (cognitive 27): Engine.DiscoverNow has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 9 (10 pts), boolean chains 1 (nesting depth added 8). Of this number, 23 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/discovery/engine.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8829cfa5ccb5d152c9e9b579038f32a1e8999a9e6f5c29bdd67f0cfa452534"}},{"ruleId":"D2","level":"warning","message":{"text":"Client.GenerateStream (cognitive 27): Client.GenerateStream has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 9). Most of this is not in the body itself: 6 of the 27 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 448, 414). 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":"internal/llm/client.go"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e17e9186a103e90a2cb187f7ebd09b500b3dff626daca6c0cb367ea96593bec"}},{"ruleId":"D2","level":"warning","message":{"text":"Client.streamOpenRouter (cognitive 27): Client.streamOpenRouter has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (22 pts), match/switch 2 (4 pts), loops 1 (nesting depth added 9). Most of this is not in the body itself: 10 of the 27 points are its own statements and the rest belongs to one function literal inside it that branches (line 778). 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":"internal/llm/client.go"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3db1342dfc67a01a689e82ff70483f712c1c1749394373e87468d7dab71628d"}},{"ruleId":"D2","level":"warning","message":{"text":"evolution.generateDiffPatches (cognitive 27): evolution.generateDiffPatches has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 3 (6 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/genome_wiring_idle.go"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee433b742036d2f632b07a8f67a2413f275dc4223b3e0c43e0c349b0770b6b9d"}},{"ruleId":"D2","level":"warning","message":{"text":"genome.ApplyHypothesis (cognitive 27): genome.ApplyHypothesis has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 2 (5 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/genome/hypothesis.go"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5428a367ab5344278fc8473c8fa1b47affdd95b5a7446c48e27863421c753de"}},{"ruleId":"D2","level":"warning","message":{"text":"DistillationService.parseExtractionResponse (cognitive 27): DistillationService.parseExtractionResponse has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (21 pts), match/switch 2 (5 pts), loops 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":"internal/runtime/memory/experience/distillation_service.go"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd21034c676b770549e9875128fc24ece06fec9863f4e0d0a3fd0e3eed50404"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.AddNode (cognitive 27): Graph.AddNode has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 4, loops 2 (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":"internal/runtime/observability/flight/graph.go"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1a3ddff799e912279cdf8c0c958381338bca79c934f402b98f3184d46fddd8"}},{"ruleId":"D2","level":"warning","message":{"text":"ahp.reconstructTaskResult (cognitive 27): ahp.reconstructTaskResult has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 1 (2 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":"internal/runtime/protocol/ahp/message.go"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d450959223cd570c5d0f209692f07f474e34e3b298eb04b2314ae67272e1ce6"}},{"ruleId":"D2","level":"warning","message":{"text":"ares_bootstrap.runLLMSuggestions (cognitive 26): ares_bootstrap.runLLMSuggestions has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 2 (8 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 18). Most of this is not in the body itself: 4 of the 26 points are its own statements and the rest belongs to one function literal inside it that branches (line 530). 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":"internal/ares_bootstrap/bootstrap_evolution.go"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f483a5afcdb03841f6bfc5ea8cc2399244ed8e7e9cb0fb76c5b17b46c956c1"}},{"ruleId":"D2","level":"warning","message":{"text":"PhaseExecutor.Execute (cognitive 26): PhaseExecutor.Execute has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 2 (6 pts), loops 1 (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":"internal/ares_shutdown/phase.go"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f3428f5e06d2cb08866fe158a2978c3d8d845ca5578fe7e49f52d45d68fb9e"}},{"ruleId":"D2","level":"warning","message":{"text":"DAGPatchExecutor.Apply (cognitive 26): DAGPatchExecutor.Apply has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (23 pts), match/switch 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/task/workflow/engine/dag_patcher.go"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd154bbb1c3857bf64eef7f7490147cd5d912abeb4bbc140cdd8d30a0a6ea91"}},{"ruleId":"D2","level":"warning","message":{"text":"Registry.TopologicalOrder (cognitive 26): Registry.TopologicalOrder has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 8 (11 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":"internal/kernel/registry.go"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b32d622f9081fa92bf40201258f42414f6e36b6fcf6bb9ed24ef64cc7b8e0d"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultCompiler.formatMarkdown (cognitive 26): DefaultCompiler.formatMarkdown has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 4, 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":"internal/knowledge/compiler/compiler.go"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f871e86e9961e235aec45936ae039629a363b88ff3b2e3a61df6e2756308b69"}},{"ruleId":"D2","level":"warning","message":{"text":"llm.buildAnthropicChatMessages (cognitive 26): llm.buildAnthropicChatMessages has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (6 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 14). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/llm/chat.go"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c3784e9eb61ae6a328eaf21c54faefc1b703bff90e78f05e037ad654f3d6ed"}},{"ruleId":"D2","level":"warning","message":{"text":"evolution.RecordPopulationLineage (cognitive 26): evolution.RecordPopulationLineage has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 3 (4 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":"internal/runtime/ares_evolution/genome_wiring_genealogy.go"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f07fc8498da1edb9b987602050494268d04528e59a2585944078b5a8aa7ef8d"}},{"ruleId":"D2","level":"warning","message":{"text":"DreamCycle.runESEvolution (cognitive 26): DreamCycle.runESEvolution has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (23 pts), loops 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":"internal/runtime/ares_evolution/dream_cycle_evolve.go"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d72680c5efe43311ac5cbf3379893860410e7411e4dbac74533c8a903062bc"}},{"ruleId":"D2","level":"warning","message":{"text":"MemoryExperienceStore.GetTaskTypeStatistics (cognitive 26): MemoryExperienceStore.GetTaskTypeStatistics has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 3 (6 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":"internal/runtime/ares_evolution/experience/memory_store.go"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ba0dc9882603cc5abcf7d6697e0b7739a9929a5a0f5527f96ef93367d81f24"}},{"ruleId":"D2","level":"warning","message":{"text":"GenomePopulationAdapter.submitToCoordinator (cognitive 26): GenomePopulationAdapter.submitToCoordinator has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 3 (4 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":"internal/runtime/ares_evolution/genome_wiring_run.go"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22ebe6c6c57a645ecf8a53d4c183bfe8eacd6ea4f524b1564dc45b1153bfcc0"}},{"ruleId":"D2","level":"warning","message":{"text":"Service.Evolve (cognitive 26): Service.Evolve has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 2 (4 pts), loops 2, 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":"internal/runtime/ares_evolution/service/service.go"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b9eff19e796ea12a040c2aeb882e0221df862203639877340eb65080dde56e"}},{"ruleId":"D2","level":"warning","message":{"text":"Registry.Apply (cognitive 26): Registry.Apply has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (26 pts) (nesting depth added 16). 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":"internal/runtime/evolution/patch/patch.go"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"aab3765a0173bf644853c20d1cf9d9e131d9b6a31af0e5cae8c8028e21d5a9cc"}},{"ruleId":"D2","level":"warning","message":{"text":"Collector.processEvent (cognitive 26): Collector.processEvent has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (25 pts), match/switch 1 (nesting depth added 12). Of this number, 15 points are the body\u0027s own statements and 11 belong to 4 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":"internal/runtime/observability/flight/collector.go"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"44276e39e0990aa69a239fe916c309ecd3fb284e5b6b8986e4c168e8b99e6eec"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultCompiler.formatPrompt (cognitive 25): DefaultCompiler.formatPrompt has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 4, 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":"internal/knowledge/compiler/compiler.go"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"d959d3bf00506dd548dbfc19b38242d7e73d66eb68880d9c51856660dbe30a5c"}},{"ruleId":"D2","level":"warning","message":{"text":"TimelineLinker.Link (cognitive 25): TimelineLinker.Link has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 4, 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":"internal/knowledge/linker/timeline.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"a664b14d6e06c047ef6a62ead53f75c11f64c123aa5e5fa9e0c751250dac942b"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeProvider.Stream (cognitive 25): CodeProvider.Stream has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 7). None of this is in the body itself: all 25 points belong to one function literal inside it that branches (line 179). 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":"internal/knowledge/provider/code/provider.go"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd621ea5cb32b8375aceac5ec7b726420b0479a7d8fac3e873352ba9abb9225"}},{"ruleId":"D2","level":"warning","message":{"text":"fileArchiveReader.Search (cognitive 25): fileArchiveReader.Search has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 3 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/archive/reader.go"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9853c65423ec70b2db851d4323de8678c3f21011bbfc476ea87a841d160efe"}},{"ruleId":"D2","level":"warning","message":{"text":"arena.ValidateAction (cognitive 25): arena.ValidateAction has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 1, match/switch 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":"internal/runtime/arena/http.go"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a8c1698e66a0d85fed7052162b7f8808c733ee96c65fcf43c090aea8fc920f"}},{"ruleId":"D2","level":"warning","message":{"text":"FeedbackRecorder.Register (cognitive 25): FeedbackRecorder.Register has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 2, loops 2 (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":"internal/runtime/ares_evolution/feedback_recorder.go"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e5b072e140344b4cdd81c9d96a3ebe5d20cfca9cad01b671fabff079de4424"}},{"ruleId":"D2","level":"warning","message":{"text":"MetaController.Tune (cognitive 25): MetaController.Tune has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 2 (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":"internal/runtime/ares_evolution/genome/meta_evolution.go"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d18574e135aaecfee7f2cb0d0ae0557c20c2feabf70c34d6aa663c6894131b"}},{"ruleId":"D2","level":"warning","message":{"text":"ReportGenerator.GenerateMarkdown (cognitive 25): ReportGenerator.GenerateMarkdown has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 8 (10 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":"internal/runtime/eval/report.go"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"752342e0a6023603f89b41568bccdbed1f1efb6692e2ca6f7b3f753b43ea555d"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowDiffer.Diff (cognitive 25): WorkflowDiffer.Diff has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 7 (9 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":"internal/runtime/evolution/diff/workflow_differ.go"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"2abba1cd221cf69c7ec79ec02e0e7e59362c8329d2aad8ccb8e61ccfa84cc21e"}},{"ruleId":"D2","level":"warning","message":{"text":"memoryManager.BuildContext (cognitive 25): memoryManager.BuildContext has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 2 (5 pts), match/switch 1 (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":"internal/runtime/memory/manager_impl.go"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eaab8025c6fa76f3507229ce61ba764b1d7cf631837a30805d1a9227180c318"}},{"ruleId":"D2","level":"warning","message":{"text":"ares_mcp.matchURITemplate (cognitive 25): ares_mcp.matchURITemplate has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 3 (4 pts), boolean chains 2 (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":"internal/runtime/protocol/mcp/server.go"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"0025ee06fbc13ec4ab6370c8579b061bd395d08bac3d0e1e08f7ffa3063789f3"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskResultRepository.ListByType (cognitive 25): TaskResultRepository.ListByType has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 1 (nesting depth added 11). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/storage/postgres/repositories/task_result_repository.go"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"18dcd22bd7331b8e5bf9a3504e8fbc324062f9bc29c71a03100e1f09d4cab9db"}},{"ruleId":"D2","level":"warning","message":{"text":"Planner.Plan (cognitive 25): Planner.Plan has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 4 (5 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":"internal/tools/planner/planner.go"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"827ea2d20295cf3de3e6186a9317b11c0a8a8e00b58a465b8dbb9f2aff40f543"}},{"ruleId":"D2","level":"warning","message":{"text":"DataValidation.validateSchema (cognitive 25): DataValidation.validateSchema has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 2, 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":"internal/tools/resources/builtin/text/data_validation.go"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c55d6e1f846942e35e22343fbfa8edaa917771494c1b7e04896b40bfd2ff53"}},{"ruleId":"D2","level":"warning","message":{"text":"Sessions.admitFreshLocked (cognitive 24): Sessions.admitFreshLocked has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agentruntime/session.go"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"662c9c2a3b6593deb19fef385ac78b6065791047383b69bc7d5f9a15a1acf9df"}},{"ruleId":"D2","level":"warning","message":{"text":"ares_bootstrap.wireDistillation (cognitive 24): ares_bootstrap.wireDistillation has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 1 (nesting depth added 13). Of this number, 21 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/ares_bootstrap/bootstrap_steps.go"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c9eeccf3e0459dfa18fcf91a6b1f119ff110ae73aeca20a225f7def256de1d"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler.constrainDispatchCandidates (cognitive 24): Scheduler.constrainDispatchCandidates has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 5, 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":"internal/kernel/scheduler_placement.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd44055a780562902f20e25418af09eeeac39b2594fda93331b3fa1eecce460e"}},{"ruleId":"D2","level":"warning","message":{"text":"Client.streamOllama (cognitive 24): Client.streamOllama has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 2 (6 pts), loops 1 (nesting depth added 10). Most of this is not in the body itself: 9 of the 24 points are its own statements and the rest belongs to one function literal inside it that branches (line 568). 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":"internal/llm/client.go"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"95af5f31d62e954b6a09060b83f5560350a2fd96f7c2829ea013e45e411e88f6"}},{"ruleId":"D2","level":"warning","message":{"text":"MemoryExperienceStore.Query (cognitive 24): MemoryExperienceStore.Query has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 13). 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":"internal/runtime/ares_evolution/experience/memory_store.go"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"561c5934e96be638edcdb763de9448a449385157a0be2b6ef19008f049d68f2f"}},{"ruleId":"D2","level":"warning","message":{"text":"Population.injectFreshMutantsLocked (cognitive 24): Population.injectFreshMutantsLocked has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 2 (3 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":"internal/runtime/ares_evolution/genome/population_guard.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"42336a8b454ec407aa6505fd2e38f0602fe978377fca5b443269b2baea680f03"}},{"ruleId":"D2","level":"warning","message":{"text":"Population.preservePromptDiversityLocked (cognitive 24): Population.preservePromptDiversityLocked has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (6 pts), boolean chains 3 (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":"internal/runtime/ares_evolution/genome/population_guard.go"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"49acdb7de031ae85696bea1fe3d391a6330fc20b9e51647ce7a549ba8a11e034"}},{"ruleId":"D2","level":"warning","message":{"text":"eval.ReplayGolden (cognitive 24): eval.ReplayGolden has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 1 (3 pts), loops 2, boolean chains 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":"internal/runtime/eval/replay.go"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a1da264e8bb9a7ecc3f1f99ea70b6f6aa34211c166c61ee99f95f7aaab2d90"}},{"ruleId":"D2","level":"warning","message":{"text":"Registry.Snapshot (cognitive 24): Registry.Snapshot has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 4 (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":"internal/runtime/evolution/patch/patch.go"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0c355d0c241ed3bc3b85ae3f7be64d615b99163c34c0de68dea96eae63de01"}},{"ruleId":"D2","level":"warning","message":{"text":"Genealogy.pruneOldestDeadLeafLocked (cognitive 24): Genealogy.pruneOldestDeadLeafLocked has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (6 pts), boolean chains 2 (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":"internal/runtime/observability/flight/genealogy.go"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"c908af75f6911b9075dc8887574d0424ff5302ee5cd98189e4050214298616a5"}},{"ruleId":"D2","level":"warning","message":{"text":"SSETransport.receiveLoop (cognitive 24): SSETransport.receiveLoop has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 2 (nesting depth added 10). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/protocol/mcp/transport_sse.go"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfa943d6e03f03570972fb434d3a33894b01e184c680b80b9a8097515950df3"}},{"ruleId":"D2","level":"warning","message":{"text":"SecretRepository.RotateKey (cognitive 24): SecretRepository.RotateKey has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (22 pts), loops 2 (nesting depth added 6). Of this number, 20 points are the body\u0027s own statements and 4 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":"internal/storage/postgres/repositories/secret_repository.go"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"61802a7d73d2cc512f88998a423c7708874053ec5557cfe6e81b66036915fa7f"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskResultRepository.SearchByVector (cognitive 24): TaskResultRepository.SearchByVector has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 1 (nesting depth added 10). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/storage/postgres/repositories/task_result_repository.go"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"77af2f6ff83518f45c2cbcf893b19e09ae1b2e17a1d99642cfd1814c893a8950"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskResultRepository.ListBySession (cognitive 24): TaskResultRepository.ListBySession has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 1 (nesting depth added 11). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/storage/postgres/repositories/task_result_repository.go"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1eb9970b5a9f88f4b9036270f23823a37714ebb4c4198ea9eff2b6072e66081"}},{"ruleId":"D2","level":"warning","message":{"text":"StoreAdapter.UpdateKnowledge (cognitive 24): StoreAdapter.UpdateKnowledge has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (23 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":"internal/tools/resources/builtin/knowledge/store_adapter.go"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d84e3b4445c47a3c2d1bf129e4347e73f5745c645f8cd997a89606ab258b4dd"}},{"ruleId":"D2","level":"warning","message":{"text":"core.ParameterSchemaToMap (cognitive 24): core.ParameterSchemaToMap has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tools/resources/core/convert.go"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d85e5941013f596eb77b582ad4c334e3b4e0a8b246c6b400e972f58d397d7c"}},{"ruleId":"D2","level":"warning","message":{"text":"Agent.composePrompt (cognitive 24): Agent.composePrompt has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 6 (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":"sdk/agent.go"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd194fa8f4026c0373ce8e9febd7648abd8006fbc49a45c9f0e5a7688a62cee4"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphPatchExecutor.CanApply (cognitive 23): GraphPatchExecutor.CanApply has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 3, match/switch 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":"internal/fabric/task/workflow/graph/patcher.go"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3cea8309e69abc1b685d70fcc6774fb08b441165a6a482e25cca09fc67769f"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler.freeCapableAgents (cognitive 23): Scheduler.freeCapableAgents has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 2, loops 2 (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":"internal/kernel/scheduler_dispatch.go"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5574d271c6bc91860c0040d758bb822605a6517dd140e07902733e36e91137"}},{"ruleId":"D2","level":"warning","message":{"text":"MetricsCollector.Snapshot (cognitive 23): MetricsCollector.Snapshot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3 (6 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":"internal/runtime/arena/metrics.go"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c73d501db5f2225a7994409a318ab07df9469fba18794e769e00ee13b83b526"}},{"ruleId":"D2","level":"warning","message":{"text":"DreamCycle.deployWinner (cognitive 23): DreamCycle.deployWinner has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (23 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":"internal/runtime/ares_evolution/dream_cycle_evolve.go"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dce15cc5d433f75989b7bf4237e6ba2a7de83885b233c1cc7d4e7aae5461d74"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalGate.Check (cognitive 23): EvalGate.Check has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 1, 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":"internal/runtime/ares_evolution/gate_eval.go"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef1e4a6b52ee350addf346fdb2eebc8d1de8914a6a4fcb22aed6c4e67cfe491"}},{"ruleId":"D2","level":"warning","message":{"text":"Population.handleStagnationLocked (cognitive 23): Population.handleStagnationLocked has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (20 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":"internal/runtime/ares_evolution/genome/adaptive.go"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"70de17f066bebdb14999926046c256b3c6f3acae73596d1bc28ed12b9d1d164a"}},{"ruleId":"D2","level":"warning","message":{"text":"Population.applyFitnessSharingSampled (cognitive 23): Population.applyFitnessSharingSampled has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 4 (7 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/genome/population_guard.go"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65098bf4a1956fe4cfbe809d1c80ffac9945654d08c494b67ddf2ba200ce530"}},{"ruleId":"D2","level":"warning","message":{"text":"LLMArenaScorer.ScoreBatch (cognitive 23): LLMArenaScorer.ScoreBatch has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 3 (4 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":"internal/runtime/ares_evolution/service/llm_arena_scorer.go"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"753486b424270fe58197dddce77b473ffc43ec468a0d9c438173b132452c9686"}},{"ruleId":"D2","level":"warning","message":{"text":"Manager.recoverAgentState (cognitive 23): Manager.recoverAgentState has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 12). Of this number, 12 points are the body\u0027s own statements and 11 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/manager.go"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"3059cc2ba873672a4b0e978f39ffd113490f2117bf97907c898a64eca5973dbc"}},{"ruleId":"D2","level":"warning","message":{"text":"memoryManager.StoreDistilledTask (cognitive 23): memoryManager.StoreDistilledTask has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 1, loops 1 (nesting depth added 6). Most of this is not in the body itself: 11 of the 23 points are its own statements and the rest belongs to one function literal inside it that branches (line 859). 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":"internal/runtime/memory/manager_impl.go"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6168660a5cb2ca6c2def6e9e0141c1630fd38bbf4ef376f7877a4eab1ea4d6"}},{"ruleId":"D2","level":"warning","message":{"text":"Timeline.Add (cognitive 23): Timeline.Add has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (6 pts), boolean chains 3 (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":"internal/runtime/observability/flight/timeline.go"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a3a90560e9c73196234f5ab223e437607d81a1cc7141125f5f6ea1fb56df54"}},{"ruleId":"D2","level":"warning","message":{"text":"Indexer.indexOne (cognitive 23): Indexer.indexOne has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/protocol/skills/indexer.go"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d68df0a36630adfb81416df39e4ebdd2e6bff7e71718c3500c573c9a059679"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime.runGraphRounds (cognitive 23): Runtime.runGraphRounds has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 3, 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":"sdk/graph_run.go"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e0e2fd323091de18e2c79d6d0dfc3f53af07037abad9ed3a25725b1fb7931e"}},{"ruleId":"D2","level":"warning","message":{"text":"main.printReport (cognitive 22): main.printReport has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/ares/serve_arena.go"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d73bae23a6157e88849a84a274da2def873a09c8bdfb656c14e212e7297b68b"}},{"ruleId":"D2","level":"warning","message":{"text":"main.printStatusText (cognitive 22): main.printStatusText has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (18 pts), loops 2 (4 pts) (nesting depth added 6). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"cmd/ares/status.go"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d49d4804fdc7430644fdb628433a1c8386bebe4be6b31a64403a9b8888c4a8"}},{"ruleId":"D2","level":"warning","message":{"text":"Orchestrator.Adopt (cognitive 22): Orchestrator.Adopt has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 3, boolean chains 1, loops 1 (nesting depth added 6). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/kernel/orchestrator.go"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b53949a0a1a4fda82dd0b775aa25bbec84c6cdc003c13c571baf5946c46b37"}},{"ruleId":"D2","level":"warning","message":{"text":"llmservice.NewService (cognitive 22): llmservice.NewService has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 2 (5 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":"internal/llmservice/service.go"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d57ada99d8d35cc4d3c349228899e3b05edbc4ef02ef0e0c6d8e718150062a1"}},{"ruleId":"D2","level":"warning","message":{"text":"Service.Execute (cognitive 22): Service.Execute has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/arena/service.go"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"482a3a6a6264c3f99f4e2199f42eaf607b1428d3c000c9b8de9294b0b4218952"}},{"ruleId":"D2","level":"warning","message":{"text":"experience.AggregateEvidence (cognitive 22): experience.AggregateEvidence has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/experience/types.go"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66eb0b63f668261f06fadb7b948e9545c5e838c7d7674b0603d8c79003a3c1a"}},{"ruleId":"D2","level":"warning","message":{"text":"genome.ParetoDominance (cognitive 22): genome.ParetoDominance has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/genome/multi_objective.go"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55972f0bed400f0cda44001864199b2deef46e183c591eaba3f8bbd30c6156c"}},{"ruleId":"D2","level":"warning","message":{"text":"EvolutionGuardrails.postEvolveCheckLocked (cognitive 22): EvolutionGuardrails.postEvolveCheckLocked has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (5 pts), boolean chains 2 (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":"internal/runtime/ares_evolution/guardrails.go"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed6c36a239ef2c8acec92a5215c31f01ba8d8d88689dc6f8638c339c7b05118"}},{"ruleId":"D2","level":"warning","message":{"text":"mutation.extractOutermostBracket (cognitive 22): mutation.extractOutermostBracket has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/mutation/llm_hint_provider.go"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0b426b2d827a8174b39f2cff7928764ac51743001f4164c9d6990b64ad4445"}},{"ruleId":"D2","level":"warning","message":{"text":"Registry.ApplySet (cognitive 22): Registry.ApplySet has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 2 (nesting depth added 11). Of this number, 17 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/evolution/patch/patch.go"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"201c276c7e00c68b4478d41f5f0d85465687116f1bbbbc4d4bbdcdbd474f1330"}},{"ruleId":"D2","level":"warning","message":{"text":"Manager.healthCheck (cognitive 22): Manager.healthCheck has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 2, loops 2 (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":"internal/runtime/manager_lifecycle.go"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec67d2a5cb2151b742462cb285f56691e721179f330922250c1455169f53910"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeRunner.validateCode (cognitive 22): CodeRunner.validateCode has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 4 (8 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tools/resources/builtin/execution/code_runner.go"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f1cf2afcbdf298a6c845d87e2892adeb5068a7f49834abcb60595fdab887bc"}},{"ruleId":"D2","level":"warning","message":{"text":"WebSearch.Execute (cognitive 22): WebSearch.Execute has cognitive complexity 22 (threshold 15). Drivers by points: if/else 19 (20 pts), boolean chains 1, loops 1 (nesting depth added 1). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"internal/tools/resources/builtin/network/web_search.go"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1c2a546e010cf9754d14d1e26597e7b589bb9f2302b2d98935786cbecd0953"}},{"ruleId":"D2","level":"warning","message":{"text":"main.runDbMigrate (cognitive 21): main.runDbMigrate has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (21 pts) (nesting depth added 7). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/ares/db.go"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"e726598e165164bbfb1b6c69f3e9d86e50167b07e24140856f5c48f0bb32c008"}},{"ruleId":"D2","level":"warning","message":{"text":"MemoryStore.Query (cognitive 21): MemoryStore.Query has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 7, loops 1 (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":"internal/evidence/evidence.go"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"221eeb42af67355da0058d7dffbfeb5e7f552e1ad3f360c64c26e73a53df43e8"}},{"ruleId":"D2","level":"warning","message":{"text":"Fabric.ResumableTasks (cognitive 21): Fabric.ResumableTasks has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 1 (2 pts), boolean chains 1, loops 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":"internal/fabric/task/dag.go"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"21bfe134c0e25b24bbb14d4b2ba0246d32d2d13561ca002dc0515ae559280416"}},{"ruleId":"D2","level":"warning","message":{"text":"DistillBridge.DistillConversationWithReport (cognitive 21): DistillBridge.DistillConversationWithReport has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 3 (4 pts), match/switch 1 (2 pts), boolean chains 1 (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":"internal/knowledge/adapter/distill.go"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"f726fb852eebc780ac065d015923a8c04701680dd5238268ffb95fb1cfc22bd5"}},{"ruleId":"D2","level":"warning","message":{"text":"MemoryExperienceStore.GetStatistics (cognitive 21): MemoryExperienceStore.GetStatistics has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 3 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/experience/memory_store.go"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"562a8b7a4c76595fa012b2c866c6e795cb2fef17c304f1477f5d300973e72ddb"}},{"ruleId":"D2","level":"warning","message":{"text":"GenomePopulationAdapter.Run (cognitive 21): GenomePopulationAdapter.Run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 3 (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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/genome_wiring_run.go"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"62488900ec39c41b2235f01cccd851a6e5c531f777a0e229163966f8b640b0a1"}},{"ruleId":"D2","level":"warning","message":{"text":"evolution.extractFirstFloat (cognitive 21): evolution.extractFirstFloat has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 2, 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":"internal/runtime/ares_evolution/service/llm_arena_scorer.go"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49fc3dd47ace8376feefaf050645ad5504aad0103b89451003e8af6207556d7"}},{"ruleId":"D2","level":"warning","message":{"text":"evolution.extractScoreFromText (cognitive 21): evolution.extractScoreFromText has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (12 pts), boolean chains 5, loops 2 (4 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":"internal/runtime/ares_evolution/service/llm_scorer.go"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd94b5de2149e4e156d50fd35f180154aa8b3cde9cea7f86b95aec6b35e7ca9"}},{"ruleId":"D2","level":"warning","message":{"text":"UngatedPatcher.Evaluate (cognitive 21): UngatedPatcher.Evaluate has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 1 (2 pts), boolean chains 1, loops 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":"internal/runtime/evolution/coordinator/coordinator.go"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29843597231d1e7c935606f6df2dfdef6a2a368ccdf73de2e47949f5283c710"}},{"ruleId":"D2","level":"warning","message":{"text":"distillation.IsProblem (cognitive 21): distillation.IsProblem has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 5 (6 pts), boolean chains 2 (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":"internal/runtime/memory/distillation/detector.go"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"89cd476124e6f22635023c92765894534091ce48c203d20ad7c0319decfb58dd"}},{"ruleId":"D2","level":"warning","message":{"text":"MemorySearch.Execute (cognitive 21): MemorySearch.Execute has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tools/resources/builtin/memory/memory_tools.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a4b75cc806f26058cca9e57998870c9c5f739784b325fed2e531b323dd61a3"}},{"ruleId":"D2","level":"warning","message":{"text":"StringUtils.Execute (cognitive 21): StringUtils.Execute has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (6 pts), boolean chains 2, match/switch 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":"internal/tools/resources/builtin/stringutils/stringutils.go"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe51c779fdd16862720a6c3137975e048df58dac62b53ccfd06deea529ae7b5"}},{"ruleId":"D2","level":"warning","message":{"text":"main.runLiveChaosInjection (cognitive 20): main.runLiveChaosInjection has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 3, loops 1 (nesting depth added 4). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/ares/serve_chaos_domain.go"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7dcf213829d24582622b2f55fc57d82a28ecb8baf9dde8026d3571d413e0bff"}},{"ruleId":"D2","level":"warning","message":{"text":"main.setupServeControlPlane (cognitive 20): main.setupServeControlPlane has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (4 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 8). Most of this is not in the body itself: 7 of the 20 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 460, 493). 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":"cmd/ares/serve_wiring.go"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9c8fd55c0f3725596e2ac7003e1245fdbfbbe6802c1b9f5763660a9225b178"}},{"ruleId":"D2","level":"warning","message":{"text":"agentruntime.AwaitSessionResult (cognitive 20): agentruntime.AwaitSessionResult has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, match/switch 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":"internal/agentruntime/await.go"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4dd521e89fbdc5d25dba6e359803fe00aeb5ff276745122ebde955486188a5"}},{"ruleId":"D2","level":"warning","message":{"text":"Fabric.Reconcile (cognitive 20): Fabric.Reconcile has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 5, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/task/reconcile.go"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f8541330d53e2f37dcea987b074124cd521cd48688ceae26a588a085be7baa"}},{"ruleId":"D2","level":"warning","message":{"text":"archive.extractDecisions (cognitive 20): archive.extractDecisions has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (3 pts), boolean chains 2 (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":"internal/runtime/archive/extract.go"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"5777dc5ef2b557934d5e6620bead386095b06c9f2f965b6c6639bb0b0c71ae31"}},{"ruleId":"D2","level":"warning","message":{"text":"NondominatedSortingSelection.Select (cognitive 20): NondominatedSortingSelection.Select has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 6 (8 pts), match/switch 1 (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":"internal/runtime/ares_evolution/genome/selection.go"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef2dc5812c80452f7d4a32078b23a0d1c87fa198f897171af9bd0e0d5302f16"}},{"ruleId":"D2","level":"warning","message":{"text":"StrategyLifecycle.evaluateAndMaybeRollback (cognitive 20): StrategyLifecycle.evaluateAndMaybeRollback has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 3 (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":"internal/runtime/ares_evolution/lifecycle_evidence.go"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"500b66275fec036bc28cba5063280a45e03e9f14f9e4f7597196fe2e57603dff"}},{"ruleId":"D2","level":"warning","message":{"text":"context.summarizeHTTPRequestResult (cognitive 20): context.summarizeHTTPRequestResult has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 5, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/memory/context/cleaner.go"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27b3bc62e0b725ad39b0e377b6006f0207ca3c9a30d61e8eb2f266b456c9c87"}},{"ruleId":"D2","level":"warning","message":{"text":"Distiller.embedPhase (cognitive 20): Distiller.embedPhase has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 10). Most of this is not in the body itself: 2 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 453). 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":"internal/runtime/memory/distillation/distiller.go"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"97fb10dcecce6366f96e2587aee417991065d7218c47544cb1b8c4e8d00e55b1"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportanceScorer.ScoreMemory (cognitive 20): ImportanceScorer.ScoreMemory has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2, match/switch 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/memory/distillation/scorer.go"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b8703c0f6d60f5b4af94d09778b5485d3d46d070d81525c1517bd3b13bb808"}},{"ruleId":"D2","level":"warning","message":{"text":"memory.trimToTokenBudget (cognitive 20): memory.trimToTokenBudget has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 5 (8 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":"internal/runtime/memory/token_budget.go"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9396a90fa91ab49cafb987eed60afe46f8a115a73d7b356244ca4f5776220d"}},{"ruleId":"D2","level":"warning","message":{"text":"EmbeddingCache.Clear (cognitive 20): EmbeddingCache.Clear has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (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":"internal/storage/postgres/embedding/cache.go"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c79a7699a2bf8c8a2788c644051b4972969ccded12981c7a25cb6324be80bfa"}},{"ruleId":"D2","level":"warning","message":{"text":"KnowledgeUpdate.Execute (cognitive 20): KnowledgeUpdate.Execute has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 3, loops 1 (2 pts) (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":"internal/tools/resources/builtin/knowledge/knowledge_base.go"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde5af5aa1f82fb888a13a643fc460d83d7da6f6acebc5f67346ec3876369d54"}},{"ruleId":"D2","level":"warning","message":{"text":"main.probeStatusRuntime (cognitive 19): main.probeStatusRuntime has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (19 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":"cmd/ares/status.go"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6a4e41e5d94aa32e787b1d59ff439a48d4c2ba090a90deb30a0bf19599e937"}},{"ruleId":"D2","level":"warning","message":{"text":"peerAssembly.wireSessionCleanup (cognitive 19): peerAssembly.wireSessionCleanup has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). Most of this is not in the body itself: 2 of the 19 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 429, 402). 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":"cmd/ares/peer_assembly.go"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c11b0fe85076e518dda1da5545b59a90fc97d9b25698ee3e88537b9abd01c0"}},{"ruleId":"D2","level":"warning","message":{"text":"fileTool.validatePath (cognitive 19): fileTool.validatePath has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 1 (2 pts), boolean chains 1 (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":"internal/apitools/builtin.go"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b56ce45bf8fd840e5dba6f684d241b0edb7df4c31fbed4eebb7f6923b684d8"}},{"ruleId":"D2","level":"warning","message":{"text":"ares_bootstrap.subscribeDistillationEvents (cognitive 19): ares_bootstrap.subscribeDistillationEvents has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 10). Most of this is not in the body itself: 2 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 133). 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":"internal/ares_bootstrap/bootstrap_steps.go"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b896073349c3c7c4d188109be7dc85096ac91ec55752ffad5aba02ce47dfae"}},{"ruleId":"D2","level":"warning","message":{"text":"CompactableEventStore.maybeCompact (cognitive 19): CompactableEventStore.maybeCompact has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/ares_events/compactable_store.go"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdadc9d6b77b2e3eb26df9081593ddb6e55525e3e77e178e4784d7196f1de229"}},{"ruleId":"D2","level":"warning","message":{"text":"Fabric.AuditOrphans (cognitive 19): Fabric.AuditOrphans has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (3 pts), boolean chains 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":"internal/fabric/agent/orphan_audit.go"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9068aa7ef887add3182063c1284e8db9daf4c2d3855d7f2120399dff30d977"}},{"ruleId":"D2","level":"warning","message":{"text":"plannerCognition.assembleContext (cognitive 19): plannerCognition.assembleContext has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/agent/planner_context.go"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"34690ce94cd0a8819003ecbb7e60a6ef187faaa01e66d625f66b89b68a83382d"}},{"ruleId":"D2","level":"warning","message":{"text":"CompileCoordinator.CompileDAG (cognitive 19): CompileCoordinator.CompileDAG has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (4 pts), boolean chains 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":"internal/fabric/planprojection/coordinator.go"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"47269fc2f2d9edad9fc174f1432674e675dbbabb5f359d636a88b9c6b3f7954f"}},{"ruleId":"D2","level":"warning","message":{"text":"Reaper.Sweep (cognitive 19): Reaper.Sweep has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3, 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":"internal/fabric/task/reaper.go"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"85046c275fdd0fbbade7cfed8026a0c11a577a0454aad40805a2571ee044034a"}},{"ruleId":"D2","level":"warning","message":{"text":"FileWatcher.fsnotifyLoop (cognitive 19): FileWatcher.fsnotifyLoop has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/task/workflow/engine/reloader.go"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"2932d826220009ac31511ead1eefb994680144b5e7a06ad7cff3896ca2add43b"}},{"ruleId":"D2","level":"warning","message":{"text":"Orchestrator.stopComponent (cognitive 19): Orchestrator.stopComponent has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 8). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/kernel/orchestrator.go"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"39780ef869440980059c8669cf95fe8bf1256d8a0a69123d8ea8480f8483903c"}},{"ruleId":"D2","level":"warning","message":{"text":"ArchitectureLinker.Link (cognitive 19): ArchitectureLinker.Link has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (4 pts), boolean chains 2 (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":"internal/knowledge/linker/architecture.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7691e3728b6b3f136afd89894b1b3d134a284e06219169a4670f29d627c556"}},{"ruleId":"D2","level":"warning","message":{"text":"KnowledgePipeline.ProcessStream (cognitive 19): KnowledgePipeline.ProcessStream has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 2 (6 pts), loops 1 (nesting depth added 12). None of this is in the body itself: all 19 points belong to one function literal inside it that branches (line 420). 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":"internal/knowledge/pipeline.go"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"218a6ba9f7819768c18e3f6a322a4fd0e666d2fbefe37b766ab65972074271fd"}},{"ruleId":"D2","level":"warning","message":{"text":"memorystore.cloneObject (cognitive 19): memorystore.cloneObject has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (13 pts), loops 3 (6 pts) (nesting depth added 5). 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":"internal/knowledge/store/memory/store.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23150e6bf969258e198b85e1cfbf9857c35867fb9a0dd08be8fd23b215078ae"}},{"ruleId":"D2","level":"warning","message":{"text":"archive.extractTODOs (cognitive 19): archive.extractTODOs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (3 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":"internal/runtime/archive/extract.go"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8427ec117948a8962431416a2424456afebbbd66802f81fe719c19680ffffcf"}},{"ruleId":"D2","level":"warning","message":{"text":"RegressionTester.runUncached (cognitive 19): RegressionTester.runUncached has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 2 (nesting depth added 2). Of this number, 17 points are the body\u0027s own statements and 2 belong to 2 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":"internal/runtime/arena/regression.go"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb052abe465a1aff4b13c2c17d6d97f6c6a55884b0f05b8e3797e7ab5f5962a"}},{"ruleId":"D2","level":"warning","message":{"text":"RegressionTester.runStrategy (cognitive 19): RegressionTester.runStrategy has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 1 (nesting depth added 6). Of this number, 13 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/arena/regression.go"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4624169e391f9aeecb580c983c1133fd27e08349eb165563acac33494cec7b"}},{"ruleId":"D2","level":"warning","message":{"text":"Service.randomChaosAction (cognitive 19): Service.randomChaosAction has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 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":"internal/runtime/arena/survival.go"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce586545fc1643f38de8a9de1170aee69c9f0e5502a1cb2509c45f4f3d7a4a52"}},{"ruleId":"D2","level":"warning","message":{"text":"evolution.attachSchedulerAndLifecycle (cognitive 19): evolution.attachSchedulerAndLifecycle has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 2 (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":"internal/runtime/ares_evolution/genome_wiring_system.go"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"b559e3b9e697a380d1b6628534051158f777c80aaefa6e02a3b30b7e50761e9b"}},{"ruleId":"D2","level":"warning","message":{"text":"MemoryExperienceStore.QueryByTaskType (cognitive 19): MemoryExperienceStore.QueryByTaskType has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (5 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":"internal/runtime/ares_evolution/experience/memory_store.go"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc6bdcd7bbed91c651c2745fc43de03027433ee7e3c985d17a8af1193990761"}},{"ruleId":"D2","level":"warning","message":{"text":"Population.applyFitnessSharingExact (cognitive 19): Population.applyFitnessSharingExact has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/genome/population_guard.go"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5de840f0ab636c22aef4255b73db07f830b59f773417b805b5d329c1196b3bd"}},{"ruleId":"D2","level":"warning","message":{"text":"SUSSelection.Select (cognitive 19): SUSSelection.Select has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 5 (7 pts), match/switch 1 (2 pts), boolean chains 1 (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":"internal/runtime/ares_evolution/genome/selection.go"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"423cd890b8f3fe1cf8dc41b21eccde25b865774c6d0ad64d4bd9fedfc3c1d347"}},{"ruleId":"D2","level":"warning","message":{"text":"ExperienceGuidedMutator.guidedMutateParameter (cognitive 19): ExperienceGuidedMutator.guidedMutateParameter has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/mutation/guided_mutator.go"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9e2dc40db518ed5d925db65744db45b84a7b70bf368187316e4d0b04787c39"}},{"ruleId":"D2","level":"warning","message":{"text":"evolution.NewService (cognitive 19): evolution.NewService has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 5 (nesting depth added 2). 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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/service/service.go"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd244a997246940428d7dde61dc9060614460170c30a03815d6f280f2350576f"}},{"ruleId":"D2","level":"warning","message":{"text":"eval.findJSONEnd (cognitive 19): eval.findJSONEnd has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/eval/llm_judge.go"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c73c02ce1358647d57cdd9be6a7698286780ce2673cb01c91f7489c7a347c3"}},{"ruleId":"D2","level":"warning","message":{"text":"Manager.scheduleResurrection (cognitive 19): Manager.scheduleResurrection has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 11). None of this is in the body itself: all 19 points belong to one function literal inside it that branches (line 698). 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":"internal/runtime/manager.go"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2716f60eb03f058a4360406ac250a2d042880acc517ad8f721ceee214f3f855"}},{"ruleId":"D2","level":"warning","message":{"text":"ConflictResolver.DetectConflictGroups (cognitive 19): ConflictResolver.DetectConflictGroups has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (6 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":"internal/runtime/memory/experience/conflict_resolver.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f19209bd92bfd2a5f1d5f8dbdbd33c7842a44d98cad0eb80119ae46fb7170ee"}},{"ruleId":"D2","level":"warning","message":{"text":"Collector.handleMemoryDistilled (cognitive 19): Collector.handleMemoryDistilled has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 1 (3 pts), boolean chains 2 (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":"internal/runtime/observability/flight/collector.go"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"de33895cc0656df5778d5c419e6abe18c28e65089f666955f7246244b2655d37"}},{"ruleId":"D2","level":"warning","message":{"text":"MCPToolFactory.Create (cognitive 19): MCPToolFactory.Create has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/protocol/mcp/factory.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcef7035a6ec836d92f66b19c3523a5e225d1ee60f3057766dc900fb573c29c0"}},{"ruleId":"D2","level":"warning","message":{"text":"toolResolver.Resolve (cognitive 19): toolResolver.Resolve has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 5 (6 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tools/planner/resolver.go"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a5b0c962eb8a1fe62a1c8d7ad400f3ea212c23ff09f80a54532e03dcdab332"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexTool.extract (cognitive 19): RegexTool.extract has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts), boolean chains 2 (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":"internal/tools/resources/builtin/text/regex_tool.go"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0f78f7aa0c861f608b55589fa33774d5ec99ae0f0db52bddde886009371ba2"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigFile.validateKnowledge (cognitive 19): ConfigFile.validateKnowledge has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 6 (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":"sdk/config.go"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bee5881fa07bcb60444699dd135b498ace944940454c49da712b61c37ac2540"}},{"ruleId":"D2","level":"warning","message":{"text":"main.wireChaos (cognitive 18): main.wireChaos has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 1, match/switch 1 (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":"cmd/ares/serve_chaos_domain.go"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce0cfa8ffa686fc0f3190ce9494d04b9697d66e8eae2afcd0a8f6ff4b718c45"}},{"ruleId":"D2","level":"warning","message":{"text":"actionHandler.checkAuthRead (cognitive 18): actionHandler.checkAuthRead has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/ares/agent.go"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b13dd6d9c295f2cfe28368ea95ce5a0bdb704feee856af8227364c850141b53"}},{"ruleId":"D2","level":"warning","message":{"text":"fileTool.Execute (cognitive 18): fileTool.Execute has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 1 (2 pts), boolean chains 1, match/switch 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":"internal/apitools/builtin.go"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bbd735695f6e2553724daab85f12418ef467aaaf92f7c7feea846858912d69e"}},{"ruleId":"D2","level":"warning","message":{"text":"ares_bootstrap.runEvolutionTicker (cognitive 18): ares_bootstrap.runEvolutionTicker has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 9). None of this is in the body itself: all 18 points belong to one function literal inside it that branches (line 474). 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":"internal/ares_bootstrap/bootstrap_evolution.go"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e8821c2179ee1df6e73668fff9aa3d764de25a82c41151fe16b4f3dc48cea4"}},{"ruleId":"D2","level":"warning","message":{"text":"ares_bootstrap.buildEvolutionSuggestionPrompt (cognitive 18): ares_bootstrap.buildEvolutionSuggestionPrompt 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":"internal/ares_bootstrap/bootstrap_fitness.go"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"06928430ba0b910d3a1e6005f0da3a4eb9fe79a0789c7509a3917f74870ed6b1"}},{"ruleId":"D2","level":"warning","message":{"text":"ares_bootstrap.buildEvalGate (cognitive 18): ares_bootstrap.buildEvalGate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 1 (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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/ares_bootstrap/eval_gate_wiring.go"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de50cb6d0655c024da022cac6e5b73095e6508b760c18d64c52206540ed842c"}},{"ruleId":"D2","level":"warning","message":{"text":"Config.validateKernelL1 (cognitive 18): Config.validateKernelL1 has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/ares_config/config_validate.go"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"392cb1f330716d7a1de06f87c1ab0e792b6631d46a93b3e5bb63fd622ff72463"}},{"ruleId":"D2","level":"warning","message":{"text":"MemoryEventStore.Read (cognitive 18): MemoryEventStore.Read has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, loops 2 (3 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":"internal/ares_events/memory_store.go"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f5058686c1992d07b9b0b4f5a84c54be9cd780fc2786bb16720a67cda9f767"}},{"ruleId":"D2","level":"warning","message":{"text":"MemoryEventStore.matchesFilter (cognitive 18): MemoryEventStore.matchesFilter has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (4 pts), boolean chains 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":"internal/ares_events/memory_store.go"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"612f6e657d58f411ecdd8c2ddd342b2162760da771a7fc7cfc3a047bf82cfea1"}},{"ruleId":"D2","level":"warning","message":{"text":"SlidingWindowLimiter.Wait (cognitive 18): SlidingWindowLimiter.Wait has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (7 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":"internal/ares_ratelimit/sliding_window.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"59bc9290ffcb2b6103c0910ae3e98933d60496fb155ee23f36f3818bc5a92cbb"}},{"ruleId":"D2","level":"warning","message":{"text":"ares_security.maskAPIKey (cognitive 18): ares_security.maskAPIKey has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (17 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. This shape REPEATS in the file: one other method here (ares_security.maskToken) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/ares_security/sanitizer.go"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4c48983c391633051332bb9ea89a147106e06b832fd85272059e9452b3e670"}},{"ruleId":"D2","level":"warning","message":{"text":"ares_security.maskToken (cognitive 18): ares_security.maskToken has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (17 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. This shape REPEATS in the file: one other method here (ares_security.maskAPIKey) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/ares_security/sanitizer.go"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca2f2a616f8c5748108fdcefda96251e90633034f3c029a9eb3caf896c863ed"}},{"ruleId":"D2","level":"warning","message":{"text":"answerCognition.ExecuteStep (cognitive 18): answerCognition.ExecuteStep has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 4 (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":"internal/fabric/agent/l2graph.go"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"f416878de5dc1d20b25485814f85f3a5c7a2784993eda9466e63559dcb2ce477"}},{"ruleId":"D2","level":"warning","message":{"text":"snapshotStore.save (cognitive 18): snapshotStore.save has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (6 pts), boolean chains 2 (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":"internal/fabric/agent/snapshot.go"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78661c511d9d41b225f825aaaac5a5ac5e8d1a8c44b037a1143e766ab06f13b"}},{"ruleId":"D2","level":"warning","message":{"text":"Fabric.Delete (cognitive 18): Fabric.Delete has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, match/switch 2 (nesting depth added 6). Most of this is not in the body itself: 8 of the 18 points are its own statements and the rest belongs to one function literal inside it that branches (line 1349). 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":"internal/fabric/task/fabric_lifecycle.go"},"region":{"startLine":1345}}}],"partialFingerprints":{"codehealthFindingId/v1":"359a1aef90f3d7fe819bc462623be60f2fa307575aeef7b4926fa24544b38272"}},{"ruleId":"D2","level":"warning","message":{"text":"MutableDAG.AddNode (cognitive 18): MutableDAG.AddNode has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 3 (7 pts), boolean chains 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":"internal/fabric/task/workflow/engine/mutable_dag.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc8dcb879b3dfb7c2f8965239dbfb3fae10056fd52ebd1e9624c10a9cbe3160"}},{"ruleId":"D2","level":"warning","message":{"text":"MutableDAG.RemoveNode (cognitive 18): MutableDAG.RemoveNode has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 5 (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":"internal/fabric/task/workflow/engine/mutable_dag.go"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e43acd04e3a9d0a326332506f49fffb0fb39d1736dd10e5f895f0f7eca18b7"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler.Capabilities (cognitive 18): Scheduler.Capabilities has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/kernel/executor_registry.go"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"8794f38128820699bcaa9a4e6fc8651840980e41e329589e146d3dd4bb71d68e"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler.Run (cognitive 18): Scheduler.Run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (4 pts), loops 2 (nesting depth added 7). Of this number, 12 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/kernel/scheduler.go"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14f222fe6e3af404cef545be05d3a65f61adcc1ac9f33066472c661ad24f79d"}},{"ruleId":"D2","level":"warning","message":{"text":"KnowledgeRetriever.Retrieve (cognitive 18): KnowledgeRetriever.Retrieve has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/knowledge/adapter/context_retriever.go"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c631948261266ae4ee2edd686b8c4351b7251c53f1a1f64b7c8f3f6232ec09"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultCompiler.formatXML (cognitive 18): DefaultCompiler.formatXML has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/knowledge/compiler/compiler.go"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b44f1474c2098f39d618fb42899bc487f3fc207d98e1fb9f469b1c831df2d0"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorProvider.resultToObject (cognitive 18): VectorProvider.resultToObject has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 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":"internal/knowledge/provider/vector/provider.go"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6e9b48041092d08a7ec29ceb0902d7cdc662212ca60c389ad1d010f81437f3"}},{"ruleId":"D2","level":"warning","message":{"text":"fileArchiveReader.List (cognitive 18): fileArchiveReader.List has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (5 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":"internal/runtime/archive/reader.go"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ac63f68b85d8572d8cfaca870051c2d67c84b2712c67cb27c67e499fd66ad5"}},{"ruleId":"D2","level":"warning","message":{"text":"evolution.ValidateStrategySize (cognitive 18): evolution.ValidateStrategySize has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/validation.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34f4282770857cf76a735ee872bb9b135bfc0767a981ae7f0f2f72cc720cfd4"}},{"ruleId":"D2","level":"warning","message":{"text":"DreamCycle.runGAEvolution (cognitive 18): DreamCycle.runGAEvolution has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 2 (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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/dream_cycle_ga.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c072ef5d7941a8a7e9c8ecd883c357dcb83d044ce259924847c3746580c045"}},{"ruleId":"D2","level":"warning","message":{"text":"ExperimentQuery.ListFiltered (cognitive 18): ExperimentQuery.ListFiltered has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/experiment_query.go"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d6c83f11d01957d051e265bd3b579a8c08aab8b67a54673e63dcdfbb5abb7a"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeFitnessAggregator.WindowAt (cognitive 18): RuntimeFitnessAggregator.WindowAt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/fitness_aggregator.go"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"39069daff931319d3d8d0656fd0f8d489db2ed2ed2c7b9a80f77e505d216452e"}},{"ruleId":"D2","level":"warning","message":{"text":"Population.applyFitnessSharingSpatial (cognitive 18): Population.applyFitnessSharingSpatial has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 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":"internal/runtime/ares_evolution/genome/population_guard.go"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"f453f56912bf4e22dcdef1b7794927882fe37d74b4efb027dc295264238b11a7"}},{"ruleId":"D2","level":"warning","message":{"text":"StrategyLifecycle.Submit (cognitive 18): StrategyLifecycle.Submit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3, loops 2 (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":"internal/runtime/ares_evolution/lifecycle_promotion.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"28610b32ea096f0b4eb27b400f2465540168eaee662525c3ceef640e029c9c16"}},{"ruleId":"D2","level":"warning","message":{"text":"ExperienceGuidedMutator.guidedMutateTool (cognitive 18): ExperienceGuidedMutator.guidedMutateTool has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (17 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":"internal/runtime/ares_evolution/mutation/guided_mutator.go"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51b8367c607062139d9cf979f956058d76bf90f82599aa7875044c27b95388f"}},{"ruleId":"D2","level":"warning","message":{"text":"PluginBus.Start (cognitive 18): PluginBus.Start has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (4 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":"internal/runtime/bus.go"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8d098a21fa400648fee742c01c1c55d3d10b655675c3e33a41547da5973567"}},{"ruleId":"D2","level":"warning","message":{"text":"eval.extractJudgeJSON (cognitive 18): eval.extractJudgeJSON has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (2 pts), boolean chains 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":"internal/runtime/eval/llm_judge.go"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"1adae6331466c3d70c7d39970981d10a9b7b71031e6e9584207d02220db257ee"}},{"ruleId":"D2","level":"warning","message":{"text":"Manager.Start (cognitive 18): Manager.Start has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 4 (5 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 5). Of this number, 13 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. 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":"internal/runtime/manager_lifecycle.go"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85ce7e46df7446166efaed61798d16a5b2e3cfcd38a20610817f493e14191e1"}},{"ruleId":"D2","level":"warning","message":{"text":"Distiller.SubscribeAndDistill (cognitive 18): Distiller.SubscribeAndDistill has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). Most of this is not in the body itself: 3 of the 18 points are its own statements and the rest belongs to one function literal inside it that branches (line 98). 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":"internal/runtime/memory/distillation/distiller_admin.go"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"af58fa2aa3ae7f42967e6639445ff8ac0ffb6163cc958fbea193a16b872ca101"}},{"ruleId":"D2","level":"warning","message":{"text":"ExperienceExtractor.extractCoreSolution (cognitive 18): ExperienceExtractor.extractCoreSolution has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (4 pts), boolean chains 2 (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":"internal/runtime/memory/distillation/extractor.go"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34482d4eefceeacd713fc4b6e5135cc6a5c92d7b6d487753c69de7569745dde"}},{"ruleId":"D2","level":"warning","message":{"text":"DistillationService.Distill (cognitive 18): DistillationService.Distill has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/memory/experience/distillation_service.go"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9be256e7b6480b471b5b3d73bb8385a4722630a0f23f593c7854354dd56e4a"}},{"ruleId":"D2","level":"warning","message":{"text":"ares_skills.LoadSkillSources (cognitive 18): ares_skills.LoadSkillSources has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 1 (2 pts), boolean chains 1, 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":"internal/runtime/protocol/skills/config.go"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b665a1f2f10c2c9c5d65f9efa4af5648e26cc8ba08ed211cf81ec294fd966e29"}},{"ruleId":"D2","level":"warning","message":{"text":"KnowledgeRepository.searchByVectorQuery (cognitive 18): KnowledgeRepository.searchByVectorQuery has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (17 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":"internal/storage/postgres/repositories/knowledge_repository.go"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd6742118c16abdc080c52bcbb3649660e90bc90e550064385e11a1d47d8173"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolExecutionBridge.Execute (cognitive 18): ToolExecutionBridge.Execute has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tools/planner/bridge.go"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c685e29a3abfd844d896aa07e04b49882a7bd3190e0c077de6e67f6a21da0e"}},{"ruleId":"D2","level":"warning","message":{"text":"DAGValidator.detectCycles (cognitive 18): DAGValidator.detectCycles has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (nesting depth added 8). Most of this is not in the body itself: 7 of the 18 points are its own statements and the rest belongs to one function literal inside it that branches (line 100). 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":"internal/tools/planner/dag.go"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"a594b3039132199e1eab3bb3fd3d055d4546622858eeda026cdd55e6d8cc31da"}},{"ruleId":"D2","level":"warning","message":{"text":"DataTransform.csvToJSON (cognitive 18): DataTransform.csvToJSON has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (7 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":"internal/tools/resources/builtin/text/data_transform.go"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"20759caa67d6d0f5a8afd71b87dce78dc87d3af1d5a049f4ff002fdcddd6b146"}},{"ruleId":"D2","level":"warning","message":{"text":"DataTransform.jsonToCSV (cognitive 18): DataTransform.jsonToCSV has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 6 (8 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tools/resources/builtin/text/data_transform.go"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"005ad50184f4416c0b85b31873fc5e57ed935f3cd420c8a0370bb118b151d26f"}},{"ruleId":"D2","level":"warning","message":{"text":"CapabilitySelector.Select (cognitive 18): CapabilitySelector.Select has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tools/toolsource/capability_selector.go"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6ff83cf8eb9a2fee97d40f33cc7a64270cdd11fd1dbe88207b4b003a29a92f"}},{"ruleId":"D2","level":"warning","message":{"text":"sdk.wireMemory (cognitive 18): sdk.wireMemory has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/memory_wiring.go"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"609eae9f1c9c1302609b7035d38b7ea69b6a922e51cbc3cc8e7c9d24bc77c9ce"}},{"ruleId":"D2","level":"warning","message":{"text":"graphRun.readySet (cognitive 18): graphRun.readySet has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/graph_run.go"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"9532e43194dcacaa06a95904bd7b98dbac4f8e6c8ce26560233adcb0133a934e"}},{"ruleId":"D2","level":"warning","message":{"text":"main.findCycle (cognitive 17): main.findCycle has cognitive complexity 17 (threshold 15). Drivers by points: loops 7 (9 pts), if/else 4 (8 pts) (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/ares/agent_routes_tasks.go"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d5839becfe07aa46da8e38c5f640180c85141d460345c8eff6deba52713736"}},{"ruleId":"D2","level":"warning","message":{"text":"agentruntime.SessionStalledWith (cognitive 17): agentruntime.SessionStalledWith has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agentruntime/session.go"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"411d04ac602b6a70e70c7079d093d1bbf17ea22305114644daaf30bbc6d0553c"}},{"ruleId":"D2","level":"warning","message":{"text":"ares_bootstrap.wireMemory (cognitive 17): ares_bootstrap.wireMemory has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 1 (nesting depth added 2). 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":"internal/ares_bootstrap/bootstrap.go"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"df20a0fa22966667aa03563aa1bec91b680e8fdacca309e70659517316ded0c1"}},{"ruleId":"D2","level":"warning","message":{"text":"ares_bootstrap.applyGATuning (cognitive 17): ares_bootstrap.applyGATuning has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, boolean chains 8. 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":"internal/ares_bootstrap/bootstrap_evolution.go"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb423a5ca445d4954df78b95f51c591eab435b0a1866462a9dd44ba27b6f7e1"}},{"ruleId":"D2","level":"warning","message":{"text":"ares_bootstrap.findUnknownPoolTools (cognitive 17): ares_bootstrap.findUnknownPoolTools has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (4 pts), boolean chains 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":"internal/ares_bootstrap/bootstrap_evolution.go"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"158efbaaab6237cbe1de5910fb696167cd21fa8ef2e4a731b6d74fd04c7e0c92"}},{"ruleId":"D2","level":"warning","message":{"text":"mcpHealthJoin.resolve (cognitive 17): mcpHealthJoin.resolve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/ares_bootstrap/provide_mcp.go"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4007e16f3da0615751d0657f2f4781c63813fd2df542e06c06b88f8f86dafe"}},{"ruleId":"D2","level":"warning","message":{"text":"ares_config.Load (cognitive 17): ares_config.Load has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 1 (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":"internal/ares_config/config.go"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41ffd22948d5a0337530027b8bc903ea0d77044ed1ec3983d36d90fba4d8f1d"}},{"ruleId":"D2","level":"warning","message":{"text":"CompactableEventStore.Read (cognitive 17): CompactableEventStore.Read has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, loops 1 (2 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":"internal/ares_events/compactable_store.go"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf346a95dd919e0f6c0b2acbdee769072afb295e3e4c1d7fe5f87b39e7dcb46b"}},{"ruleId":"D2","level":"warning","message":{"text":"MemoryEventStore.ReadAll (cognitive 17): MemoryEventStore.ReadAll has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 5). Of this number, 13 points are the body\u0027s own statements and 4 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":"internal/ares_events/memory_store.go"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b26b23f71fa9939f998387b6524225083792e03a3659f25a0284a9acd27b6b"}},{"ruleId":"D2","level":"warning","message":{"text":"agentfabric.decodeCognitiveMap (cognitive 17): agentfabric.decodeCognitiveMap has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 1 (2 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":"internal/fabric/agent/context.go"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe7c6caf9bc8e0e5aee40a0c279b878ad17dbfb92d834441958d49d7daa76a8"}},{"ruleId":"D2","level":"warning","message":{"text":"Fabric.ReapRetired (cognitive 17): Fabric.ReapRetired has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (5 pts), boolean chains 1, match/switch 1 (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":"internal/fabric/agent/reap.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"394e892846adfb637219433df52a46f19eaa0d6ab6b2e89ecc1f0fd0abd9ef95"}},{"ruleId":"D2","level":"warning","message":{"text":"CompileCoordinator.applyReplaceNode (cognitive 17): CompileCoordinator.applyReplaceNode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/planprojection/coordinator.go"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"4606e0fb1d9742facd49b14940207a33a7e83d992204d0245dfbc7f9f58f31b4"}},{"ruleId":"D2","level":"warning","message":{"text":"CompileCoordinator.SubscribeGraphEvents (cognitive 17): CompileCoordinator.SubscribeGraphEvents has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 9). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to one function literal inside it that branches (line 702). 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":"internal/fabric/planprojection/coordinator.go"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"8795719ddac12247057868e3b01cbf53cfb8350515e933c899d1551d5150a652"}},{"ruleId":"D2","level":"warning","message":{"text":"Fabric.createLocked (cognitive 17): Fabric.createLocked has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, loops 1 (2 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":"internal/fabric/task/fabric_lifecycle.go"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cab7f785cd39003409d311f4242e7154352512e9ec5e198c74393853c499d7a"}},{"ruleId":"D2","level":"warning","message":{"text":"Fabric.RestoreFromStore (cognitive 17): Fabric.RestoreFromStore has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/task/restore.go"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"3905333562b758f88e93309efe1bad7e2e46ed565bec548f79a8ea322807ca43"}},{"ruleId":"D2","level":"warning","message":{"text":"KnowledgePipeline.matchTokenAware (cognitive 17): KnowledgePipeline.matchTokenAware has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/knowledge/pipeline.go"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"9811f79c227683b5a6d1fc514d906555528db372c190f29f871a121315cd1ba4"}},{"ruleId":"D2","level":"warning","message":{"text":"code.tokenize (cognitive 17): code.tokenize has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 5, loops 1 (nesting depth added 5). 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, 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":"internal/knowledge/provider/code/provider.go"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbadd2205bd0109207619c4bcac5286b58ed8cac59335fee572882d4d5f11f2d"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.Query (cognitive 17): Store.Query has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 3 (5 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/knowledge/store/sqlite/store.go"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"792f6565b8f66f6f01f5d05074b9269d70b885e42d7fea972d036a6e43273951"}},{"ruleId":"D2","level":"warning","message":{"text":"Crossover.segmentCrossParams (cognitive 17): Crossover.segmentCrossParams has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/genome/crossover.go"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"e38d86109d63651704fdc7fa4e5294fd0a0d4205d3996ef12889d64b245e1d44"}},{"ruleId":"D2","level":"warning","message":{"text":"EmbeddingQueue.MarkFailed (cognitive 17): EmbeddingQueue.MarkFailed has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 1 (nesting depth added 4). Of this number, 14 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/storage/postgres/embedding_queue.go"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4586c3420cfd361dbfa3803ad28d0a2fde0f86855a6a50757081a1eb56b320"}},{"ruleId":"D2","level":"warning","message":{"text":"FileTools.readFile (cognitive 17): FileTools.readFile has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tools/resources/builtin/file/file_tools.go"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d497d6d12c7cb0bacfd5ad1799b80d8aeb6871eecb42d5a9563c3d0504af6b8"}},{"ruleId":"D2","level":"warning","message":{"text":"PDFTool.extractText (cognitive 17): PDFTool.extractText has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 1, loops 1 (nesting depth added 2). 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, 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":"internal/tools/resources/builtin/pdf/pdf.go"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5894fa2eaaa6a7f923689781929314abe4570fa3202537806b92a41f461d33"}},{"ruleId":"D2","level":"warning","message":{"text":"builtin.extractJSON (cognitive 17): builtin.extractJSON has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tools/resources/builtin/planning/task_planner.go"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fd8f9f45ee7184ee17a3de44cff7df64029e4f46f752641f3df2664570175f"}},{"ruleId":"D2","level":"warning","message":{"text":"DataTransform.flatten (cognitive 17): DataTransform.flatten has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 2 (6 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tools/resources/builtin/text/data_transform.go"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"7019f6fa8e25ec5f99a8f6b57552b83dee9eb8df3284fc85750925d04aa20825"}},{"ruleId":"D2","level":"warning","message":{"text":"main.loadServeConfig (cognitive 16): main.loadServeConfig has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/ares/serve.go"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"7107dba138122c8cb4c8879e999c40ed0f74e43fce0c14a0bb438984cdf2042d"}},{"ruleId":"D2","level":"warning","message":{"text":"Submitter.Submit (cognitive 16): Submitter.Submit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 3). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. 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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agentruntime/submit.go"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e66ce21bc4fe289a9a880d5efc04de9fe8d2d1d9e59994da53588f54b3aaba7"}},{"ruleId":"D2","level":"warning","message":{"text":"webSearchTool.Execute (cognitive 16): webSearchTool.Execute has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, boolean chains 3, loops 1. 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, 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":"internal/apitools/builtin.go"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfdf0a018489068442fb5c89e5170199728148f971f6c770d759309ccc5772aa"}},{"ruleId":"D2","level":"warning","message":{"text":"ares_bootstrap.ProvideEvolution (cognitive 16): ares_bootstrap.ProvideEvolution has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/ares_bootstrap/provide_evolution.go"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ede0d597d519a2214276b201d18d34ddea9a0ded5ad5ec0029496db2605fe64"}},{"ruleId":"D2","level":"warning","message":{"text":"ares_bootstrap.BuildKnowledgeRuntime (cognitive 16): ares_bootstrap.BuildKnowledgeRuntime has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2 (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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/ares_bootstrap/provide_new_evolution.go"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f017c8c94da8f509d0d6fdb8563cf271f0226c6ce3f24b7c03cf41f487dcf42"}},{"ruleId":"D2","level":"warning","message":{"text":"Config.validateKernel (cognitive 16): Config.validateKernel has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 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":"internal/ares_config/config_validate.go"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea8ac9c3c3aa7097bfb582526b2586b338ca6e9024394f3a508811af188ae62"}},{"ruleId":"D2","level":"warning","message":{"text":"PostgresStore.Query (cognitive 16): PostgresStore.Query has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 1, loops 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":"internal/evidence/postgres_store.go"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bff22617af241d0430f42e8456878676483794efdd520d184804c25b745ae7d"}},{"ruleId":"D2","level":"warning","message":{"text":"plannerCognition.advertisedToolSchemas (cognitive 16): plannerCognition.advertisedToolSchemas has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, loops 2 (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":"internal/fabric/agent/planner_cognition.go"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"14211c3441bd42387fd5f70f6ed94466b89a33a83648b80efee7eb6b86cd4391"}},{"ruleId":"D2","level":"warning","message":{"text":"Fabric.cascadeFailureLocked (cognitive 16): Fabric.cascadeFailureLocked has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 4 (6 pts), boolean chains 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":"internal/fabric/task/dag.go"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"76414530cb517b712eaf1524e231de228efa677a37679c4bdfbdc47f729d184f"}},{"ruleId":"D2","level":"warning","message":{"text":"Fabric.blastRadiusLocked (cognitive 16): Fabric.blastRadiusLocked has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 4 (6 pts), boolean chains 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":"internal/fabric/task/fabric_lifecycle.go"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a50763c76249316c47461d28df09d481e98437db49c13ce3f9e8766b544c9d"}},{"ruleId":"D2","level":"warning","message":{"text":"Fabric.RunQuantumResult (cognitive 16): Fabric.RunQuantumResult has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/task/quantum.go"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"e143af4ce6ec9e6472faf1469027ed321b5b022fd4005351713d7d1d27cc8d72"}},{"ruleId":"D2","level":"warning","message":{"text":"engine.NewDAG (cognitive 16): engine.NewDAG has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (4 pts), boolean chains 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":"internal/fabric/task/workflow/engine/types.go"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"f923be258cd80f0ec52ae5ac8c87a05e378de8d57b184cc3b49d78ba80aaebdb"}},{"ruleId":"D2","level":"warning","message":{"text":"RecoveryPatchExecutor.CanApply (cognitive 16): RecoveryPatchExecutor.CanApply has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (3 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":"internal/fabric/task/workflow/engine/recovery_patcher.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"030ba6bf41b7e51ec87557d90a732b2ec0f55353c41cdf92339bc64be112660e"}},{"ruleId":"D2","level":"warning","message":{"text":"Orchestrator.startComponent (cognitive 16): Orchestrator.startComponent has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (16 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/kernel/orchestrator.go"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dec9e5758ce8acb1e90bd81072d0d6ba84fef658a87edc8da6fc31d620cb09b"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler.buildQuantumStep (cognitive 16): Scheduler.buildQuantumStep has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, match/switch 1 (nesting depth added 3). None of this is in the body itself: all 16 points belong to one function literal inside it that branches (line 72). 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":"internal/kernel/scheduler_quantum.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b706ef979d72310f4887dc2bba160ccedce694fd8ccb9ae3bd6ded837d5eff"}},{"ruleId":"D2","level":"warning","message":{"text":"DistillBridge.persistAndPromote (cognitive 16): DistillBridge.persistAndPromote has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/knowledge/adapter/distill.go"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"239f4f9b2c577fe3e605e9d029a4c6ff722e0b047566f72f2be7d8d0b5b06f3b"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline.sourceIDMatch (cognitive 16): pipeline.sourceIDMatch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/knowledge/pipeline/normalizer.go"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99366d140306f6cb5eb151195e09029aaf8c94e831c1a8505a2804c0aae676a"}},{"ruleId":"D2","level":"warning","message":{"text":"PGProvider.Stream (cognitive 16): PGProvider.Stream has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 6). None of this is in the body itself: all 16 points belong to one function literal inside it that branches (line 131). 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":"internal/knowledge/provider/postgres/provider.go"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd33ee3a538cdb7014b26e784451930019dee36e76694f8799b7c24530d4a4ea"}},{"ruleId":"D2","level":"warning","message":{"text":"RelationExtractor.Extract (cognitive 16): RelationExtractor.Extract has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 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":"internal/knowledge/relation_extract.go"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5322ef2b2fc0023eda03ed29dc9abcd395f03b9cf5c6db058f8baf2ceb942a"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalHarness.runCase (cognitive 16): EvalHarness.runCase has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, loops 1 (2 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":"internal/knowledge/retriever/eval.go"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c84ff7080e29a9bf82827f9e4b8ced079c85b42c65df9b596de0d4644e1eb75"}},{"ruleId":"D2","level":"warning","message":{"text":"Service.GenerateEmbedding (cognitive 16): Service.GenerateEmbedding has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 1 (3 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":"internal/llmservice/service.go"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd0a9e536d40c7e74731038c0e9b3124dc3387b9501b7ae3331e67cd8fdd0a3"}},{"ruleId":"D2","level":"warning","message":{"text":"fileArchiveReader.Read (cognitive 16): fileArchiveReader.Read has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 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":"internal/runtime/archive/reader.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"14accc76010eb7686a0b6a138f5bffc1fdd03aa2b83d572be756c6cf09fa0f98"}},{"ruleId":"D2","level":"warning","message":{"text":"evolution.buildMutator (cognitive 16): evolution.buildMutator has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 2 (nesting depth added 2). 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":"internal/runtime/ares_evolution/genome_wiring_builders.go"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19f5d29b62a6062b571cfe32a1164345d8699d028167100eaf156dc7fbe4cde"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultNormalizer.normalizeScore (cognitive 16): DefaultNormalizer.normalizeScore has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/experience/normalizer.go"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c5f2fce34e9ae405b0542d3fa0a14fdafa2d43b5b990a27299321048acfea4"}},{"ruleId":"D2","level":"warning","message":{"text":"genome.ParetoFront (cognitive 16): genome.ParetoFront has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (4 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":"internal/runtime/ares_evolution/genome/multi_objective.go"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd42aa2f437b6cc49d4491e6c56d16d8a167836eee5bebed5d9e48038523805"}},{"ruleId":"D2","level":"warning","message":{"text":"genome.selectTopVarDims (cognitive 16): genome.selectTopVarDims has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 5 (7 pts), boolean chains 1 (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":"internal/runtime/ares_evolution/genome/spatial_index.go"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0670a75640e6193b7e7a7eb5631534db9aea561e57d2c30a3632cc6c857fdc"}},{"ruleId":"D2","level":"warning","message":{"text":"Population.measureCategoricalDiversityLocked (cognitive 16): Population.measureCategoricalDiversityLocked has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 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":"internal/runtime/ares_evolution/genome/adaptive.go"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7bee324ea6c7a73111e6dccce11dec3bd1eb68c1a0cf48dffc7c45a88821bb0"}},{"ruleId":"D2","level":"warning","message":{"text":"GenomePopulationAdapter.baseRunScorer (cognitive 16): GenomePopulationAdapter.baseRunScorer has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 7). Of this number, 12 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/genome_wiring_run.go"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ad69c2bad109c64cfae5cee01af97c700f9784e4cd965527170a4812027780"}},{"ruleId":"D2","level":"warning","message":{"text":"Strategy.ComputeEvidenceKey (cognitive 16): Strategy.ComputeEvidenceKey has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 2 (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":"internal/runtime/ares_evolution/mutation/types.go"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"410dcfbf6f305514b5e9809c00a93002c85ce511cd2c88b1f87d3473c28bbdbf"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeObserver.eventToSample (cognitive 16): RuntimeObserver.eventToSample has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/observer.go"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"58bf09dd76ef3079d1837ec061f13ceb7ed61633662d963950e0af18d87c4d93"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.matchFilter (cognitive 16): runtime.matchFilter has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/bus.go"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8b0b2e1c8c502851f9e37decf9e78a2937681ae02535d281956c4a248b1787"}},{"ruleId":"D2","level":"warning","message":{"text":"PluginBus.removeLocked (cognitive 16): PluginBus.removeLocked has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (5 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/bus.go"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ef775f132b136460c2e5291ac3fb6c0c3cf53556d3b826aa1d20595722d47c"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowGenome.Crossover (cognitive 16): WorkflowGenome.Crossover has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/evolution/genome/workflow_genome.go"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cff41307318e07b18c3f8b12aacf0897d3d4f635c3f26a3f966a8b12d8d5e3a"}},{"ruleId":"D2","level":"warning","message":{"text":"ExperienceExtractor.extractUserProfile (cognitive 16): ExperienceExtractor.extractUserProfile has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/memory/distillation/extractor.go"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe2c6e66e4f3bca41cc977b66a34cef7bb5fc7500974018a112474082fa7c26"}},{"ruleId":"D2","level":"warning","message":{"text":"flight.computeSummary (cognitive 16): flight.computeSummary has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/observability/flight/timeline.go"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8cc60f44b6c61dd66185938e111e0469fa75fc47f9c9c786dd2f3c95846e06"}},{"ruleId":"D2","level":"warning","message":{"text":"Genealogy.RecordResurrection (cognitive 16): Genealogy.RecordResurrection 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":"internal/runtime/observability/flight/genealogy.go"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"516a2740372da967a8237da07341d7e13c10edf8bdb68332dd1a198ca089c718"}},{"ruleId":"D2","level":"warning","message":{"text":"MCPClient.call (cognitive 16): MCPClient.call has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/protocol/mcp/client.go"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c465d82d4539abc81e4f867f5b00b24c7d8f0fc1865a9bace1bd42b9ce6d36"}},{"ruleId":"D2","level":"warning","message":{"text":"SSEServerTransport.handleSSEConnect (cognitive 16): SSEServerTransport.handleSSEConnect has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 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":"internal/runtime/protocol/mcp/transport_server.go"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5c5cc5ff8622f2991f1690da7c5e307e41f5eb29f94850c99d8b0eb760a945"}},{"ruleId":"D2","level":"warning","message":{"text":"ExperienceRepository.SearchByVector (cognitive 16): ExperienceRepository.SearchByVector has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 1 (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":"internal/storage/postgres/repositories/experience_repository.go"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"1866ed45bfaf921322fdb691df3a88e07aceb23630890537d3a601d8c351b5ac"}},{"ruleId":"D2","level":"warning","message":{"text":"DAGValidator.checkIOCompatibility (cognitive 16): DAGValidator.checkIOCompatibility has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (5 pts), boolean chains 2 (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":"internal/tools/planner/dag.go"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5b20d7ec1ca47815a8c2cbde4a2584d0e184613fb36de201d635be4fb3e761"}},{"ruleId":"D2","level":"warning","message":{"text":"memoryEvidenceStore.Aggregate (cognitive 16): memoryEvidenceStore.Aggregate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tools/planner/executor.go"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"b666e4fbed20293250937468c397490968ed8ca81f65be505d43cfe7ccbdcf20"}},{"ruleId":"D2","level":"warning","message":{"text":"core.ValidateParams (cognitive 16): core.ValidateParams has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (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":"internal/tools/resources/core/registry.go"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27948efea9749ae5168237e64d771aead59611c55dff8fe6694fdf5564ada75"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Fabric: TooManyMethods \u2014 92 methods, declared across 13 files: task/fabric_lifecycle.go (31), task/fabric.go (15), task/fabric_deps.go (8), task/checkpoint_schema.go (7), \u002B9 more file(s). The bar is 30 methods; this is 62 over it, 3.07\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/task/fabric.go"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dca1e4ea04c99b972c6ad11f1807e8e13f0461213faea58bee93308bad8b92b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Scheduler: TooManyMethods \u2014 81 methods, declared across 10 files: kernel/scheduler_dispatch.go (20), kernel/executor_registry.go (15), kernel/scheduler.go (15), kernel/scheduler_execute.go (8), \u002B6 more file(s). The bar is 30 methods; this is 51 over it, 2.70\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/kernel/scheduler.go"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93b296354aba664dfb3076ae7ad1193ed0281d486537497ef09d973ca432f31"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: observability.NewPrometheusMetrics: FunctionTooLong \u2014 NewPrometheusMetrics runs 196 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 96 over it, 1.96\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":"internal/runtime/observability/prometheus.go"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca7f20356047c47fa86dbf1d4b747ae71a821ad5213a3fd0af2f36bddfd4965"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Fabric: TooManyMethods \u2014 50 methods, declared across 9 files: agent/fabric.go (12), agent/lifecycle.go (10), agent/context.go (8), agent/governance.go (6), \u002B5 more file(s). The bar is 30 methods; this is 20 over it, 1.67\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/agent/fabric.go"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f5134f7e73a9e39373b12c70cec4d87d1c651ffd519abfb918108261fabae3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Population: TooManyMethods \u2014 49 methods, declared across 4 files: genome/population.go (22), genome/adaptive.go (11), genome/population_guard.go (10), genome/population_history.go (6). The bar is 30 methods; this is 19 over it, 1.63\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/genome/population.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"3701ae240490e5f140c6c2a6df384c286103cdd6fc92fd927a95333c6ccafd8b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: actionHandler: TooManyMethods \u2014 40 methods, declared across 8 files: ares/agent.go (12), ares/agent_routes_tools.go (8), ares/evolution_experiments.go (5), ares/agent_routes_task_read.go (4), \u002B4 more file(s). The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/ares/agent.go"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12fba2528717e9baa5114bfa84ec55e5ffe75ff519bb7a81d8bd9f105c053be"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Runtime: TooManyFields \u2014 40 stored fields beside 24 methods. The bar is 30 stored fields; this is 10 over it, 1.33\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk.go"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cefa13bc8991f46ab24398c93af6751241d33c89c0ab7987a49532a1e61175b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Population.doEvolve: MethodTooLong \u2014 doEvolve runs 128 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\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":"internal/runtime/ares_evolution/genome/population.go"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d414cfda9fd4f963bd009ba0844ec39f2ad4e451fd8760f8c1e468bc5b3128"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: task/fabric_lifecycle.go: FileTooLong \u2014 634 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: Fabric (31 blocks, 61-1477). The bar is 500 significant lines; this is 134 over it, 1.27\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":"internal/fabric/task/fabric_lifecycle.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b9bb488e6dcd2f603b295d6c942ac98730339947d95c2f9503edd4ef1f5f063"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Manager: TooManyMethods \u2014 38 methods, declared across 3 files: runtime/manager.go (18), runtime/manager_chaos.go (14), runtime/manager_lifecycle.go (6). The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/manager.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a85a7d8e9d8944310696e99cbf33c453ab4686d1184415f394917209943b96"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Task: TooManyFields \u2014 38 stored fields beside 4 methods. The bar is 30 stored fields; this is 8 over it, 1.27\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/task/task.go"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"14693f66f2d99c76c2ec89d5148842905d96a6fa7a6706ca66f4c61f66d07a22"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: main.runKernelRecoveryLoop: FunctionTooLong \u2014 runKernelRecoveryLoop 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":"cmd/ares/kernel_loop.go"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"30560f34574bdd4fc5356cf9525d88b53c36b626c2a2be037acd1dab8e91e19f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: memoryManager: ClassTooLong \u2014 481 significant lines (blank, comment-only and punctuation-only lines excluded), 36 methods, 32 blocks, lines 33-1119. The bar is 400 significant lines; this is 81 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/memory/manager_impl.go"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"e83cb5665dcdda9fee260c6bf530e7d26acb418094c74e435f9aefe241818e4b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: memoryManager: TooManyMethods \u2014 36 methods, declared across 4 files: memory/manager_impl.go (31), memory/manager_rag.go (3), memory/manager_distill_wire.go (1), memory/manager_status.go (1). The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/memory/manager_impl.go"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0bd195119907868c041620f2d8103cc2c2463d531e4cce24bfecc7c887c78e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MutableDAG: ClassTooLong \u2014 480 significant lines (blank, comment-only and punctuation-only lines excluded), 29 methods, 30 blocks, lines 34-990. The bar is 400 significant lines; this is 80 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/task/workflow/engine/mutable_dag.go"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e0bbf77a7f94deb65e5a879ebebc036731326ac9cbae8700e3399ccd3c6318"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Service.CreateWiredSystem: MethodTooLong \u2014 CreateWiredSystem 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":"internal/runtime/ares_evolution/service/service.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"0172261aaf5b7f31ec7ece683f2a67567efe48ea9a820267721cb0a53f5b0733"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: arena.RunScenarioReport: FunctionTooLong \u2014 RunScenarioReport runs 117 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\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":"internal/runtime/arena/scenario.go"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fcf5e515a9d822ac3722de1ae44bf5e7e47b6cc42bf5f5bc58048732b47bfe1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MutableDAG.ReplaceNode: MethodTooLong \u2014 ReplaceNode runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\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":"internal/fabric/task/workflow/engine/mutable_dag.go"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"a839417e6e60b3c24825723b24077beba05fdce4311803f9e980cb87bb06f5c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: service/service.go: FileTooLong \u2014 579 significant lines (blank, comment-only and punctuation-only lines excluded), about 71% of them inside a single declaration: Service (20 blocks, 43-1078). The bar is 500 significant lines; this is 79 over it, 1.16\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":"internal/runtime/ares_evolution/service/service.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df39dd37c075b1070fc5163a9159aaef6fc2aa0577ec5ecb341c13d402f0f28"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: SystemConfig: TooManyFields \u2014 34 stored fields. The bar is 30 stored fields; this is 4 over it, 1.13\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/service/types.go"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b68dca83c2b47302bd109a39b1075946e5fdc93c3fc759ef3ec2c521adcdf87"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ares/serve_arena.go: FileTooLong \u2014 564 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 64 over it, 1.13\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":"cmd/ares/serve_arena.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d281c6ba0ddae5f0ab8df3c7511c9ae684f8b6ac2cfc2af6f0f67e6fa4898199"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: memory/manager_impl.go: FileTooLong \u2014 564 significant lines (blank, comment-only and punctuation-only lines excluded), about 85% of them inside a single declaration: memoryManager (32 blocks, 33-1119). The bar is 500 significant lines; this is 64 over it, 1.13\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":"internal/runtime/memory/manager_impl.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b91d47b27f8aed4ca71d03df7156c6956915bf800555b3cca0c867de8b1e408"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: planner.BuiltinCapabilities: FunctionTooLong \u2014 BuiltinCapabilities runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\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":"internal/tools/planner/capdef.go"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0909a5f55f9f9d06d8a629a3e63ac1267b1102d5cd128199c954e94fef0875"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Population: ClassTooLong \u2014 447 significant lines (blank, comment-only and punctuation-only lines excluded), 49 methods, 23 blocks, lines 28-1052. The bar is 400 significant lines; this is 47 over it, 1.12\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/genome/population.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8bace7f42794effe82f599f5781da123b433e60d81d9ca2030181acb9276c2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: math/calculator.go: FileTooLong \u2014 557 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 57 over it, 1.11\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":"internal/tools/resources/builtin/math/calculator.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ecee1c335561f5d6ad4acacbf301f0b8be3dffb04aa14a3cc65803f8e383d1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Scheduler.executeWithCandidates: MethodTooLong \u2014 executeWithCandidates runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.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":"internal/kernel/scheduler_execute.go"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf62d136bdd533cdd9bc80098a70a35abb18bd06cc21f0dfbda4cf9e5b09de3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: planner.defaultRules: FunctionTooLong \u2014 defaultRules runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.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":"internal/tools/planner/analyzer.go"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fadd5abc693122ffbfb89483065f45f9d25ed4ebde30523ba1714b398207b32"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: builtin.RegisterGeneralTools: FunctionTooLong \u2014 RegisterGeneralTools runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.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":"internal/tools/resources/builtin/builtin.go"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c2de06d0c1d667c50626eda1d21328783d64d11da42506a465e8a95f73cd05"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ares_skills.CatalogTools: FunctionTooLong \u2014 CatalogTools runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\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":"internal/runtime/protocol/skills/tools.go"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"3593e63ef2cc33945c979aeae0c8cbfbf5bf2ca659a8171b27ffd199ccc67d57"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/mutable_dag.go: FileTooLong \u2014 536 significant lines (blank, comment-only and punctuation-only lines excluded), about 90% of them inside a single declaration: MutableDAG (30 blocks, 34-990). The bar is 500 significant lines; this is 36 over it, 1.07\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":"internal/fabric/task/workflow/engine/mutable_dag.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d0c788d5c08a9b58bf313e8b296915c75b93112d1559bb71f268403f8c7ec5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DreamCycle.findWinner: MethodTooLong \u2014 findWinner 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":"internal/runtime/ares_evolution/dream_cycle_winner.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5e229ec241f8832bce09d3a28d49abe4821e4f71317caa17eccc1357eca494"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Scheduler: TooManyFields \u2014 32 stored fields beside 81 methods. The bar is 30 stored fields; this is 2 over it, 1.07\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/kernel/scheduler.go"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fcb3f21a21af91eeba39b5f8fa419626be4ed13638cf164c99a9d908059ac90"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Service.Execute: MethodTooLong \u2014 Execute runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\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":"internal/runtime/arena/service.go"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"4553767afdc0d45efc89d3d1e26a330be8d8bdbe2abd8e53ef7c93d969b6684c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Calculator: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tools/resources/builtin/math/calculator.go"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e4593760be4db32e3e391d7c87a86c4b4058da982a14e6ece0f902fefa04dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: postgres/store.go: FileTooLong \u2014 515 significant lines (blank, comment-only and punctuation-only lines excluded), about 61% of them inside a single declaration: Store (16 blocks, 25-850). The bar is 500 significant lines; this is 15 over it, 1.03\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":"internal/knowledge/store/postgres/store.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7427bfb02383a1941281909a15b9c05a2da4eed86879845c006a297e04678538"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Service: ClassTooLong \u2014 409 significant lines (blank, comment-only and punctuation-only lines excluded), 20 methods, 20 blocks, lines 43-1078. The bar is 400 significant lines; this is 9 over it, 1.02\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/service/service.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6dc42dcd2e8077f09a0ea964af9a5a4ef8fd62d1f8670fdd169911c4e85a7a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ares_bootstrap.ProvideNewEvolution: FunctionTooLong \u2014 ProvideNewEvolution runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\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":"internal/ares_bootstrap/provide_new_evolution.go"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"971f3134632d32546d6e0cd7dbf0bb2203588868f919d7e80b0921e5e77bee93"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FileTools.listFiles: MethodTooLong \u2014 listFiles runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\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":"internal/tools/resources/builtin/file/file_tools.go"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ff59ddc7d89d0f600528a025575705273ad07c25f806333017360d3713003f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: genome/population.go: FileTooLong \u2014 503 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: Population (23 blocks, 28-1052). The bar is 500 significant lines; this is 3 over it, 1.01\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":"internal/runtime/ares_evolution/genome/population.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"407575cbea35c62626b375af37773b2b304dc652ab9e124f295f3ce3d0e99b00"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 29 shared lines): internal/knowledge/store/memory/store.go:337-421 | internal/knowledge/store/postgres/store.go:577-700 | internal/knowledge/store/sqlite/store.go:566-659 \u2014 These 3 members are variants of one another: a block of 29 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 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 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/knowledge/store/memory/store.go"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"752992a716715b7029c26c14c06f42781520b9296baaeb35d9c998a8585f7934"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (53 shared lines): internal/storage/postgres/repositories/task_result_repository.go:297-405 | internal/storage/postgres/repositories/task_result_repository.go:414-502 \u2014 These two members are variants of one another: 53 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/storage/postgres/repositories/task_result_repository.go"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03267ea2f27d5617aa203f1a4ac090060e97ce0cc6058909276895dd3bcaa33"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (32 shared lines): internal/knowledge/store/postgres/store.go:396-445 | internal/knowledge/store/sqlite/store.go:506-556 \u2014 These two members are variants of one another: 32 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/knowledge/store/postgres/store.go"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af179d3c63a698a4923d1e58581b163db7735b9663ef2800656d8e3012bcce3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): internal/knowledge/store/postgres/store.go:271-335 | internal/knowledge/store/postgres/store.go:352-384 | internal/knowledge/store/postgres/store.go:773-821 | internal/knowledge/store/sqlite/store.go:259-326 | internal/knowledge/store/sqlite/store.go:343-375 | internal/knowledge/store/sqlite/store.go:763-807 \u2014 These 6 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 6 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 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/knowledge/store/postgres/store.go"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"debe873fcbead65eb3487044e69f853216ef0ff63123d6efa42ef460140a8b66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (65 lines \u00D7 2): internal/runtime/ares_evolution/mutation/guided_mutator.go:18-82 | internal/runtime/ares_evolution/service/types.go:22-86 \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":"internal/runtime/ares_evolution/mutation/guided_mutator.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3f6b68132cc104d8a81ab653661f8e0efe0d8eb0006f59f233301e0d0daa82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): internal/storage/postgres/repositories/knowledge_repository.go:722-759 | internal/storage/postgres/repositories/knowledge_repository.go:797-834 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/storage/postgres/repositories/knowledge_repository.go:722\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/storage/postgres/repositories/knowledge_repository.go"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"af53751546d3e2c5e38b6fe5a304b09c66ef9b49875667e48b87410bcd6cd295"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 3): internal/storage/postgres/repositories/experience_repository.go:394-426 | internal/storage/postgres/repositories/experience_repository.go:451-483 | internal/storage/postgres/repositories/experience_repository.go:567-599 \u2014 all 3 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/storage/postgres/repositories/experience_repository.go:394\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/storage/postgres/repositories/experience_repository.go"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"5766736e0899603034ebee0ce13eb572584046b067d545929203229ae52fd72a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201330 lines \u00D7 3): internal/knowledge/store/memory/store.go:383-412 | internal/knowledge/store/postgres/store.go:638-666 | internal/knowledge/store/sqlite/store.go:629-657 \u2014 \u0060internal/knowledge/store/postgres/store.go\u0060 and \u0060internal/knowledge/store/sqlite/store.go\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 14 separate duplicated blocks between them, totalling at least 202 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 after the matched lines, \u0060internal/knowledge/store/memory/store.go:418\u0060 calls \u0060cloneObject\u0060 and \u0060internal/knowledge/store/sqlite/store.go:658\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":"internal/knowledge/store/memory/store.go"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"118e2d12f960e55f9761183023485060a00848fca6c7fc6e5adc83093c33b022"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): internal/runtime/ares_evolution/scoring/memory_aware_scorer.go:374-403 | internal/runtime/ares_evolution/scoring/memory_aware_scorer.go:457-486 \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":"internal/runtime/ares_evolution/scoring/memory_aware_scorer.go"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d4f38e8af12402e2f50b2675b61aeda08038f9408524f37074f415f00c472e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): internal/knowledge/mcp/mcp.go:160-187 | internal/knowledge/mcp/mcp.go:202-229 \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":"internal/knowledge/mcp/mcp.go"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd78f0e7402bc042a8a15f263f9eaa0de577f9c9eeb6871e7f2b4614a21fd6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): internal/tools/resources/builtin/execution/code_runner.go:75-102 | internal/tools/resources/builtin/execution/code_runner.go:121-148 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/tools/resources/builtin/execution/code_runner.go:75\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":"internal/tools/resources/builtin/execution/code_runner.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ac890cf995254513522fecd8f687fca2b6183f6282416f22e46788e93105b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201326 lines \u00D7 2): internal/runtime/ares_evolution/experience/memory_store.go:219-244 | internal/runtime/ares_evolution/experience/memory_store.go:336-359 \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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/experience/memory_store.go"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7c374399172ebe07a4246d69f22f2d50ccd3c46ffabfa531109b0cad1b5ce7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): internal/storage/postgres/embedding/client.go:280-305 | internal/storage/postgres/embedding/client.go:330-355 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/storage/postgres/embedding/client.go:280\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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/storage/postgres/embedding/client.go"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"b980f8b42fce97af65f326685d2e97d094e7661da5242e62cc5f20cf166b3d0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201326 lines \u00D7 2): internal/storage/postgres/repositories/task_result_repository.go:36-59 | internal/storage/postgres/repositories/task_result_repository.go:224-249 \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":"internal/storage/postgres/repositories/task_result_repository.go"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e90cc4c31a2ccf4b3d6b10e0df0732a98b4f3de25ae9678cf965b1552cc888"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201325 lines \u00D7 2): internal/agents/sub/agent.go:287-311 | internal/agents/sub/agent.go:490-510 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060internal/agents/sub/agent.go:313\u0060 calls \u0060Add\u0060, \u0060Done\u0060, \u0060setStatus\u0060 and \u0060internal/agents/sub/agent.go:512\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":"internal/agents/sub/agent.go"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"3256075f9b4a42755fbc003dbd5a7ac2baa591e0d9c67be1131b22caeea0fee4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201325 lines \u00D7 2): internal/ares_security/sanitizer.go:305-329 | internal/ares_security/sanitizer.go:363-385 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/ares_security/sanitizer.go:305\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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 \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":"internal/ares_security/sanitizer.go"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"75428e44b1c04dce4ef599a477d034b80143a66116f5ae335edb29bbbbf869aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 3): internal/storage/postgres/profile.go:46-69 | internal/storage/postgres/profile.go:157-180 | internal/storage/postgres/profile.go:230-253 \u2014 all 3 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. 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":"internal/storage/postgres/profile.go"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"92197d04c0a6fff23a6eacdd497cc65da285f22504883edad4a156777d180abe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201324 lines \u00D7 2): internal/tools/planner/bridge.go:146-169 | internal/tools/planner/bridge.go:203-221 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/tools/planner/bridge.go:146\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"internal/tools/planner/bridge.go"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a75269e1aa9b6f37230a74af9f729ff654e92b67b55664f6a05c79a700a7dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201322 lines \u00D7 2): cmd/ares/serve_chaos_domain.go:84-105 | internal/introspect/chaos.go:206-221 \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 \u0060cmd/ares/serve_chaos_domain.go:84\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. Check import visibility before settling on that home: \u0060internal/introspect/chaos.go\u0060 sits under a restricted \u0060internal\u0060 directory, which only code inside its own subtree is permitted to import from \u2014 so it is reachable from some of these sites and not from others, and being able to see the copies is not the same as being allowed to share them. The home has to be somewhere every one of these sites is permitted to import from; if there is no such place, that restriction may be exactly why the copies are separate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/ares/serve_chaos_domain.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"94faaecb7ded96e55bad206fba5e8f2949f6070f918130de1544d947c9cc4f71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201322 lines \u00D7 2): internal/fabric/task/fabric_lifecycle.go:372-387 | internal/fabric/task/fabric_lifecycle.go:582-603 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/fabric/task/fabric_lifecycle.go:372\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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/task/fabric_lifecycle.go"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d558bf53a69e8732732b3fd91ac3c1e026da51741f70e4d142d6d62c87abaa4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): internal/runtime/memory/manager_impl.go:136-157 | internal/runtime/memory/manager_impl.go:184-205 \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":"internal/runtime/memory/manager_impl.go"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"d787300e07d6ad205c2be4f86cd1dad60d8fafbd0d159fa6001ea5b8cd2afa2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): internal/runtime/ares_evolution/experience/types.go:241-261 | internal/runtime/ares_evolution/experience/types.go:326-344 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/runtime/ares_evolution/experience/types.go:241\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":"internal/runtime/ares_evolution/experience/types.go"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea753498cfbc7c8d01ee6e3a4f1d3d3ee518c4e5555401f3852500a0d1d832d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): internal/runtime/ares_evolution/genome_wiring_builders.go:237-255 | internal/runtime/ares_evolution/rollback_policy.go:584-604 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/genome_wiring_builders.go"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab703fccb781d56f73a51aa9f08a7110ccb5f26b462471c9ec47e7615b73324"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): internal/runtime/ares_evolution/scoring/tiered_scorer.go:179-199 | internal/runtime/ares_evolution/scoring/tiered_scorer.go:250-270 \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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060internal/runtime/ares_evolution/scoring/tiered_scorer.go:201\u0060 calls \u0060MakeEntry\u0060, \u0060Put\u0060 and \u0060internal/runtime/ares_evolution/scoring/tiered_scorer.go:272\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":"internal/runtime/ares_evolution/scoring/tiered_scorer.go"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded64e3d0efe579522266cfac539aeb2b38d23f14a49e43c5bae0ed441d8e752"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): internal/storage/postgres/repositories/task_result_repository.go:361-381 | internal/storage/postgres/repositories/task_result_repository.go:465-484 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/storage/postgres/repositories/task_result_repository.go:465\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":"internal/storage/postgres/repositories/task_result_repository.go"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"3886c294144d7c8dd042d4abdc9e27828af77bdcf9941750b01f58eb5708c6f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 3): internal/knowledge/store/postgres/store.go:316-335 | internal/knowledge/store/postgres/store.go:365-384 | internal/knowledge/store/postgres/store.go:803-821 \u2014 all 3 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/knowledge/store/postgres/store.go:316\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/knowledge/store/postgres/store.go"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc344e8dc96bb12a35c9e2e457781e97ec498065cb76aacbe2356e9e546b5dbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 3): internal/knowledge/store/sqlite/store.go:307-326 | internal/knowledge/store/sqlite/store.go:356-375 | internal/knowledge/store/sqlite/store.go:789-807 \u2014 all 3 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/knowledge/store/sqlite/store.go:307\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/knowledge/store/sqlite/store.go"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"5889d62166baa7b429d574375e68ca9f4672e0c070d7ef93551cbe2aa9506327"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): internal/knowledge/pipeline.go:254-273 | internal/knowledge/pipeline.go:318-336 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/knowledge/pipeline.go:254\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/knowledge/pipeline.go"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a77d4e1d71789031cfccd106550adaa3ca8a0ad902ab6e3bd7c1f1b258a8986"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): internal/knowledge/store/postgres/store.go:750-769 | internal/knowledge/store/sqlite/store.go:740-759 \u2014 \u0060internal/knowledge/store/postgres/store.go\u0060 and \u0060internal/knowledge/store/sqlite/store.go\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 14 separate duplicated blocks between them, totalling at least 202 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/knowledge/store/postgres/store.go"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"17894c6cac0da7598bf7e66527bee5bb5f34163177838016fb269227a775880c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201319 lines \u00D7 2): internal/ares_events/memory_store.go:204-215 | internal/ares_events/memory_store.go:243-261 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/ares_events/memory_store.go:204\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":"internal/ares_events/memory_store.go"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26856a9abecc2568c6e49c5d980d9058328cfc19ee3a930c9061f4fb03ff5b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): internal/runtime/ares_evolution/genome/crossover.go:340-358 | internal/runtime/ares_evolution/genome/crossover.go:405-423 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/runtime/ares_evolution/genome/crossover.go:340\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/genome/crossover.go"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc4d7c1add34ccb57778b1e338a1b333375dd6010dae195e433830997a50ade"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 3): internal/ares_events/summary_repository.go:124-141 | internal/ares_events/summary_repository.go:169-185 | internal/ares_events/summary_repository.go:213-229 \u2014 all 3 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/ares_events/summary_repository.go:124\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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/ares_events/summary_repository.go"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6102861ed51049496355c194a9dfa91c649603d4b5f6678a0f8e6e11cb47820"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): internal/discovery/providers/filesystem.go:135-152 | internal/discovery/providers/filesystem.go:196-213 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/discovery/providers/filesystem.go:135\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 \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":"internal/discovery/providers/filesystem.go"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb8b97d624c561bfc8170ba42ecadae01ce6cd8f4867a666b35e051a7cc3995"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201318 lines \u00D7 2): internal/fabric/task/fabric_lifecycle.go:439-456 | internal/fabric/task/fabric_lifecycle.go:513-526 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/fabric/task/fabric_lifecycle.go:439\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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/task/fabric_lifecycle.go"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0270daf97183d4222c0fc19d8f5b039fa593d2de8576aa884cfe26bf00b9093"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): internal/knowledge/store/postgres/store.go:272-289 | internal/knowledge/store/postgres/store.go:707-723 \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":"internal/knowledge/store/postgres/store.go"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"33839f885d125c2081559d6fb3904a2993ac04962f0f5561e3671815b4d12424"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): internal/knowledge/store/postgres/store.go:493-510 | internal/knowledge/store/sqlite/store.go:414-431 \u2014 \u0060internal/knowledge/store/postgres/store.go\u0060 and \u0060internal/knowledge/store/sqlite/store.go\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 14 separate duplicated blocks between them, totalling at least 202 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 \u0060internal/knowledge/store/postgres/store.go:493\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/knowledge/store/postgres/store.go"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce658f9f29c87bba690a557ebbcc7d633779a0ad945b609857fedefa1d3b9249"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): internal/llm/generate.go:218-234 | internal/llm/generate.go:303-320 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/llm/generate.go:218\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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register. 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, \u0060internal/llm/generate.go:215\u0060 calls \u0060Set\u0060 and \u0060internal/llm/generate.go:300\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":"internal/llm/generate.go"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"b042764b83f34c1ac83bb67031397b6b3dcb2d2429d5bfc691341bfeac794758"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): internal/storage/postgres/repositories/knowledge_repository.go:68-83 | internal/storage/postgres/repositories/knowledge_repository.go:415-432 \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":"internal/storage/postgres/repositories/knowledge_repository.go"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"412db23265707c9d5309dfd1907d3855acc4281bc1b771a9fd614df8c337f0b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): internal/evidence/evidence.go:186-202 | internal/evidence/postgres_store.go:242-257 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/evidence/evidence.go"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"035f77ed14449c5896ae3dfa15cea0a77c0f6b2be4e9aead6a0f2e5101a02a36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): internal/knowledge/store/memory/store.go:165-181 | internal/knowledge/store/memory/store.go:348-364 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/knowledge/store/memory/store.go:165\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":"internal/knowledge/store/memory/store.go"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea7796b19f1c66b726ec35683f1881b9ea8b545576d2b7083a678b242c52f19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): internal/knowledge/store/postgres/store.go:617-633 | internal/knowledge/store/sqlite/store.go:608-624 \u2014 \u0060internal/knowledge/store/postgres/store.go\u0060 and \u0060internal/knowledge/store/sqlite/store.go\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 14 separate duplicated blocks between them, totalling at least 202 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 \u0060internal/knowledge/store/postgres/store.go:617\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/knowledge/store/postgres/store.go"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98c5dffd970fb0aefded548b1baeca1497d5dfe3b07c0f3647384f65c6c4e29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): internal/llm/client.go:499-515 | internal/llm/generate.go:161-177 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/llm/client.go"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a47d3e3479ff4da598b8e60a03b703439d95607011b11599ea765cd7343f81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): internal/runtime/ares_evolution/genome/selection.go:398-414 | internal/runtime/ares_evolution/genome/selection.go:707-721 \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":"internal/runtime/ares_evolution/genome/selection.go"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"96dbbff54a0eea7680eeb6049d6b8ee8290a0b278c3bed66d979d4230e7b49ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): internal/runtime/ares_evolution/report.go:272-288 | internal/runtime/ares_evolution/report.go:313-328 \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":"internal/runtime/ares_evolution/report.go"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01b4c0f58336d479b0a1fc6faf5c8a1ba278ea5b33a0921170b7747074bf52a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): internal/storage/postgres/profile.go:76-92 | internal/storage/postgres/profile.go:203-219 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/storage/postgres/profile.go:76\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":"internal/storage/postgres/profile.go"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"afdc44cadce14c7a940acb90a118f38a73614a28496b9b9bb6b4d8daf3c40c70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): internal/storage/postgres/repositories/experience_repository.go:333-346 | internal/storage/postgres/repositories/task_result_repository.go:377-393 \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 \u0060internal/storage/postgres/repositories/experience_repository.go:333\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 after the matched lines, \u0060internal/storage/postgres/repositories/task_result_repository.go:396\u0060 calls \u0060Warn\u0060 and \u0060internal/storage/postgres/repositories/experience_repository.go:348\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":"internal/storage/postgres/repositories/experience_repository.go"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"9950c78f98c980625db5772e1b7f08400c10e488ba15890ba338aef0428f30dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): internal/storage/postgres/repositories/experience_repository.go:627-642 | internal/storage/postgres/repositories/knowledge_repository.go:864-879 | internal/storage/postgres/repositories/task_result_repository.go:614-629 \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 all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/storage/postgres/repositories/experience_repository.go:627\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"internal/storage/postgres/repositories/experience_repository.go"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"148d6df84976af5db5949d000d8c0bbcf09cb8cc02a47723d491bbb1df3f9a89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): internal/ares_bootstrap/knowledge_akg.go:254-269 | sdk/distill_events.go:224-236 \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 \u0060internal/ares_bootstrap/knowledge_akg.go:254\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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register. Check import visibility before settling on that home: \u0060internal/ares_bootstrap/knowledge_akg.go\u0060 sits under a restricted \u0060internal\u0060 directory, which only code inside its own subtree is permitted to import from \u2014 so it is reachable from some of these sites and not from others, and being able to see the copies is not the same as being allowed to share them. The home has to be somewhere every one of these sites is permitted to import from; if there is no such place, that restriction may be exactly why the copies are separate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/ares_bootstrap/knowledge_akg.go"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"b052afebe6a7832cff945a5448979ad87e84c145432c7db01c32c1923c3091d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): internal/ares_security/sanitizer.go:411-426 | internal/ares_security/sanitizer.go:431-446 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/ares_security/sanitizer.go"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"79e580980780fc9e65ea009522407dc0af3295f86d3e171ef6938cf3e4630585"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): internal/aresrecovery/deterministic_scorer.go:61-76 | internal/aresrecovery/deterministic_scorer.go:82-97 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/aresrecovery/deterministic_scorer.go"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"c663e69645c419d146f9f48a9ffa62c37ab8dd73b58df8eaa424cd58dad407cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): internal/knowledge/provider/postgres/provider.go:106-120 | internal/knowledge/provider/vector/provider.go:137-152 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/knowledge/provider/postgres/provider.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1232d988bc606be31d8cf24bdc35825234e1d590749d7d4bd596486232462c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): internal/knowledge/store/postgres/store.go:797-812 | internal/knowledge/store/sqlite/store.go:783-798 \u2014 \u0060internal/knowledge/store/postgres/store.go\u0060 and \u0060internal/knowledge/store/sqlite/store.go\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 14 separate duplicated blocks between them, totalling at least 202 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 \u0060internal/knowledge/store/postgres/store.go:797\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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/knowledge/store/postgres/store.go"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"637b6575d56a54af8948ae0689bdaa988c94507da71581738d4b3b3848c880ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): internal/runtime/archive/extract.go:370-385 | internal/runtime/archive/extract.go:455-470 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/runtime/archive/extract.go:370\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"internal/runtime/archive/extract.go"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa5689e984f4805d3170d03311921507ab953fcce93576dc1d5e5e3ae0b27f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): internal/runtime/ares_evolution/channel_feedback.go:211-226 | internal/runtime/ares_evolution/lifecycle.go:670-685 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060internal/runtime/ares_evolution/channel_feedback.go:206\u0060 calls \u0060write\u0060 and \u0060internal/runtime/ares_evolution/lifecycle.go:665\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":"internal/runtime/ares_evolution/channel_feedback.go"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd043460b6ccaa3a9144c00c45a6b4fe0e6b16dbaef62fe1d4ac4aeb776777c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): internal/tools/planner/evidence.go:138-152 | internal/tools/planner/scorer.go:56-71 \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 \u0060internal/tools/planner/evidence.go:138\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"internal/tools/planner/evidence.go"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79a8823b639e99dd2899a000be8a121207e2d45a4110feac6c7809b2aa74791"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): internal/knowledge/provider/code/provider.go:172-186 | internal/knowledge/provider/memory/provider.go:88-102 | internal/knowledge/provider/store/provider.go:134-148 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/knowledge/provider/code/provider.go:172\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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/knowledge/provider/code/provider.go"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"c491159363a3510c5f0ab96daf24497e531472d9abf5e7cee9d585be0b04af03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): internal/runtime/ares_evolution/genome/selection.go:336-350 | internal/runtime/ares_evolution/genome/selection.go:597-611 | internal/runtime/ares_evolution/genome/selection.go:735-749 \u2014 all 3 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/runtime/ares_evolution/genome/selection.go:336\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":"internal/runtime/ares_evolution/genome/selection.go"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"d730d87fe173f2ec2a8fe3434476214ff343d69211ca95b81d6fa1800918f454"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): internal/discovery/engine.go:226-240 | internal/runtime/evolution/genome/workflow_genome.go:567-581 \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 \u0060internal/discovery/engine.go:226\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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 \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":"internal/discovery/engine.go"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f35546ea805fa83f724c0472077d9934b5625820d1149cc0d774c198fa7a00d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): internal/knowledge/store/sqlite/store.go:260-274 | internal/knowledge/store/sqlite/store.go:689-702 \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":"internal/knowledge/store/sqlite/store.go"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff216839f0b7cb380bdfec7987c899a1e3ed41fa3cfb773c50a43e3bcc50926"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): internal/llm/client.go:548-562 | internal/llm/client.go:758-772 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/llm/client.go:548\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060internal/llm/client.go:755\u0060 calls \u0060Set\u0060 and \u0060internal/llm/client.go:545\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":"internal/llm/client.go"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7d5dbb1540e631aa0ddc5033d83d49031fd201ac18814d70008a505a4492bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): internal/runtime/ares_evolution/genome_wiring_idle.go:176-190 | internal/runtime/ares_evolution/service/service_bridge.go:23-37 \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 \u0060internal/runtime/ares_evolution/genome_wiring_idle.go:176\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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 \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":"internal/runtime/ares_evolution/genome_wiring_idle.go"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0c68fd4e9a7ed9c7914fba4c7d88fedcf60591a3e4527a6573d28ea25ad197"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): internal/runtime/manager.go:292-306 | internal/runtime/manager_chaos.go:79-93 \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 \u0060internal/runtime/manager.go:292\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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/manager.go"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad871739ada404de57b9c8518d361ecc7e66876ef7749614bf39510c0e97072"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): internal/storage/postgres/repositories/task_result_repository.go:476-490 | internal/storage/postgres/repositories/task_result_repository.go:564-578 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/storage/postgres/repositories/task_result_repository.go:476\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/storage/postgres/repositories/task_result_repository.go"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"12182d73cc6c7639c35a4131a94f7d01fbb2fd4dbc6e1568e7f9f9225fecba0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): internal/tools/resources/builtin/knowledge/knowledge_base.go:261-275 | internal/tools/resources/builtin/knowledge/knowledge_base.go:356-370 \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":"internal/tools/resources/builtin/knowledge/knowledge_base.go"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"abcecc3ab4b7580b4ae8789ebecc549dead13d4117d16902f4e7b41e8e364f62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): internal/storage/postgres/repositories/knowledge_repository.go:672-685 | internal/storage/postgres/repositories/knowledge_repository.go:735-748 | internal/storage/postgres/repositories/knowledge_repository.go:810-823 \u2014 all 3 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/storage/postgres/repositories/knowledge_repository.go:672\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/storage/postgres/repositories/knowledge_repository.go"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"0790d02b45e9a140a911c31320c803b81073cbfe9e556ec36494c409139a4dd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 2): internal/ares_config/store.go:212-221 | internal/runtime/protocol/mcp/config_watcher.go:213-226 \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 \u0060internal/ares_config/store.go:212\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"internal/ares_config/store.go"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3e39ada258931eeb8b5b0f9cf104d67454dfb324c048f99f4b4ce3620f083d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): internal/fabric/task/workflow/engine/reloader.go:417-430 | internal/fabric/task/workflow/engine/reloader.go:437-450 \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":"internal/fabric/task/workflow/engine/reloader.go"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"03508e7072e24bc22eb56f46edb6c84a20c29169d301dfdd861ab33b00a98015"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): internal/knowledge/pipeline/llm_summarizer.go:101-114 | internal/knowledge/pipeline/normalizer.go:89-102 \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. 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":"internal/knowledge/pipeline/llm_summarizer.go"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"f29a324e7bd1219f06793799d1618ee7584018deb69400150cb2a5e8838b687a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): internal/knowledge/store/postgres/store.go:596-609 | internal/knowledge/store/sqlite/store.go:585-598 \u2014 \u0060internal/knowledge/store/postgres/store.go\u0060 and \u0060internal/knowledge/store/sqlite/store.go\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 14 separate duplicated blocks between them, totalling at least 202 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 \u0060internal/knowledge/store/postgres/store.go:596\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/knowledge/store/postgres/store.go"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2bf3ba1b67587ce00f923c49336faad2f707ba87e1e536cab3cf45b7a7a5fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): internal/runtime/ares_evolution/experience/memory_store.go:165-178 | internal/runtime/ares_evolution/experience/memory_store.go:272-285 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/runtime/ares_evolution/experience/memory_store.go:165\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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/experience/memory_store.go"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"94391e4c7027b7f06c8ae49e26a60d8f6e8108801b599ef5599a4ddcdd7ac63d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): internal/runtime/ares_evolution/genome/population_guard.go:483-496 | internal/runtime/ares_evolution/genome/population_guard.go:539-552 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/runtime/ares_evolution/genome/population_guard.go:483\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/genome/population_guard.go"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96f677efdd62a255c96462831e44a6a6d045915ccb78a0351fd80292b538ba5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): internal/storage/postgres/repositories/experience_repository.go:175-188 | internal/storage/postgres/repositories/knowledge_repository.go:382-395 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/storage/postgres/repositories/experience_repository.go"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e787e7311df7238e298ce0f06704fad7b0c8ec00827b398617936cb5f358ee7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): internal/storage/postgres/repositories/task_result_repository.go:392-405 | internal/storage/postgres/repositories/task_result_repository.go:489-502 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/storage/postgres/repositories/task_result_repository.go:392\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"internal/storage/postgres/repositories/task_result_repository.go"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"aecc2d29608a6515f0c10a727971b18e5729998a44954ff0c21266d3957d4925"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): internal/knowledge/store/postgres/store.go:313-325 | internal/knowledge/store/postgres/store.go:362-374 | internal/knowledge/store/sqlite/store.go:304-316 | internal/knowledge/store/sqlite/store.go:353-365 \u2014 \u0060internal/knowledge/store/postgres/store.go\u0060 and \u0060internal/knowledge/store/sqlite/store.go\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 14 separate duplicated blocks between them, totalling at least 202 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 \u0060internal/knowledge/store/postgres/store.go:313\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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/knowledge/store/postgres/store.go"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5cdf4814a9b8316993d82ee3e8a4622f369758ea36e24568d44c4eba73f1677"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): internal/runtime/ares_evolution/genome/population_guard.go:423-434 | internal/runtime/ares_evolution/genome/population_guard.go:488-500 | internal/runtime/ares_evolution/genome/population_guard.go:544-556 \u2014 all 3 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/runtime/ares_evolution/genome/population_guard.go:423\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"internal/runtime/ares_evolution/genome/population_guard.go"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"374adaa985d1195e528913aa7e036ca7fb3a699771683e974f2373efcbebe99b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): internal/agentipc/primitives.go:78-90 | internal/agentipc/primitives.go:169-181 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/agentipc/primitives.go:78\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agentipc/primitives.go"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7595219e8606cd9ce3fff6898e106dad32142bd188c0e725737e757a6d2e73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): internal/ares_events/memory_summary_repo.go:43-54 | internal/ares_events/memory_summary_repo.go:64-76 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/ares_events/memory_summary_repo.go:64\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. 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":"internal/ares_events/memory_summary_repo.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"d974db6267c4a24b780b6d9e21bc518e2f29da978a33742eb3bb0a0eb579e169"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): internal/ares_ratelimit/sliding_window.go:107-119 | internal/ares_ratelimit/sliding_window.go:148-159 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/ares_ratelimit/sliding_window.go:107\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"internal/ares_ratelimit/sliding_window.go"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae246bda460e02fff6609ed0c6578f2712a4aaf59d50cc7489df96a4f94d5ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): internal/fabric/task/workflow/engine/mutable_dag.go:244-256 | internal/fabric/task/workflow/engine/mutable_dag.go:304-316 \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. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/task/workflow/engine/mutable_dag.go"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e779fde8d490dc6102e842e1a2c947522c542ec45ef5f468322afc3e1a291ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): internal/kernel/registry.go:222-234 | internal/tools/planner/bridge.go:487-497 \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":"internal/kernel/registry.go"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e8aa38930cf3f5158a37c3b6b517a6942ce84e8311df418e077fe2b9ab59d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): internal/knowledge/store/postgres/store.go:433-445 | internal/knowledge/store/sqlite/store.go:544-556 \u2014 \u0060internal/knowledge/store/postgres/store.go\u0060 and \u0060internal/knowledge/store/sqlite/store.go\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 14 separate duplicated blocks between them, totalling at least 202 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 \u0060internal/knowledge/store/postgres/store.go:433\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"internal/knowledge/store/postgres/store.go"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"2faa2bc57d63a9d13769ab7a6182a1609266117c1c30ba35193255510d6488ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): internal/runtime/observability/flight/genealogy.go:298-310 | internal/runtime/observability/flight/graph.go:219-231 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060string\u0060 to \u0060g *Genealogy) RecordPromotion(agentID\u0060 in one and \u0060g *Graph) UpdateNodeStatus(id\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/observability/flight/genealogy.go"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"6133932eb350ba20cdcf18ab88415e47e3c8fcfdd4ca260b3259c29899be242d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): internal/runtime/protocol/mcp/server.go:472-484 | internal/runtime/protocol/mcp/server.go:724-736 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/runtime/protocol/mcp/server.go:472\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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/protocol/mcp/server.go"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"0479373de85cdbca925f994d9ad1951c72186042734ddae0a2bf51439861dbcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): internal/storage/postgres/repositories/secret_repository.go:337-349 | internal/storage/postgres/repositories/secret_repository.go:836-848 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/storage/postgres/repositories/secret_repository.go:337\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"internal/storage/postgres/repositories/secret_repository.go"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ab1323ddb12124671cf00cabb0a613655ae4ab2e945779245d7f61b01935da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): internal/storage/postgres/repositories/secret_repository.go:379-391 | internal/storage/postgres/repositories/secret_repository.go:644-655 \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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/storage/postgres/repositories/secret_repository.go"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffdc71f718256b5567d61d54d85bb5ec29a300cfd43b2288278d0614eb8e708b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): cmd/ares/main.go:854-865 | cmd/ares/main.go:894-905 \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":"cmd/ares/main.go"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12bb581ea01a2a23d87331cea04a23535ebaabb574351428b605da7221d848c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): internal/ares_security/sanitizer.go:290-301 | internal/ares_security/sanitizer.go:348-359 \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":"internal/ares_security/sanitizer.go"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"360ad7d6a79f84feef3df38e50d716bdd06e4f1d5c572e54783fd20d9213e7f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): internal/fabric/task/workflow/graph/graph.go:130-141 | internal/fabric/task/workflow/graph/graph.go:195-206 \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. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/task/workflow/graph/graph.go"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"7029ad7eab5395ff9175adf9c9aed19dd263c95473496e40aa7fa6308b2c0313"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): internal/knowledge/store/postgres/store.go:583-594 | internal/knowledge/store/sqlite/store.go:572-583 \u2014 \u0060internal/knowledge/store/postgres/store.go\u0060 and \u0060internal/knowledge/store/sqlite/store.go\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 14 separate duplicated blocks between them, totalling at least 202 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 \u0060internal/knowledge/store/postgres/store.go:583\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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/knowledge/store/postgres/store.go"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e9ba7e10bed591c0f9732d0e85a0880704455ed4715bab26463144d292c02b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): internal/runtime/ares_evolution/experience/normalizer.go:286-297 | internal/runtime/ares_evolution/experience/normalizer.go:374-385 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/runtime/ares_evolution/experience/normalizer.go:286\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060internal/runtime/ares_evolution/experience/normalizer.go:299\u0060 calls \u0060ParseDuration\u0060, \u0060Seconds\u0060 and \u0060internal/runtime/ares_evolution/experience/normalizer.go:386\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":"internal/runtime/ares_evolution/experience/normalizer.go"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3e792bde507eb12641c89a48b16a518f92939217116d3be8cff2c3ff9dbd0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): internal/runtime/ares_evolution/scheduler.go:389-400 | internal/runtime/ares_evolution/scheduler.go:898-909 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/runtime/ares_evolution/scheduler.go:389\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":"internal/runtime/ares_evolution/scheduler.go"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c1d28678506fca0eafe8a66b4b9d825a55acfc8abbc8f2d281d06da4cb0e79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): internal/storage/postgres/repositories/task_result_repository.go:326-337 | internal/storage/postgres/repositories/task_result_repository.go:428-439 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/storage/postgres/repositories/task_result_repository.go:326\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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/storage/postgres/repositories/task_result_repository.go"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9458b6b183a635838c3cc1f0cbb2cb10e02524f67af57db864e7de97cf77373"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201312 lines \u00D7 3): internal/storage/postgres/repositories/task_result_repository.go:340-343 | internal/storage/postgres/repositories/task_result_repository.go:436-447 | internal/storage/postgres/repositories/task_result_repository.go:532-543 \u2014 all 3 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/storage/postgres/repositories/task_result_repository.go:340\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 after the matched lines, \u0060internal/storage/postgres/repositories/task_result_repository.go:448\u0060 calls \u0060Error\u0060 and \u0060internal/storage/postgres/repositories/task_result_repository.go:544\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":"internal/storage/postgres/repositories/task_result_repository.go"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"d622d40cc4846a24b2c193e68749864cb62c9de9cbbc6c6567bf151ce212be0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): internal/tools/resources/builtin/text/data_transform.go:60-70 | internal/tools/resources/builtin/text/data_validation.go:51-61 | internal/tools/resources/builtin/text/json_tools.go:57-67 \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 all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/tools/resources/builtin/text/data_transform.go:60\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":"internal/tools/resources/builtin/text/data_transform.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"45373d6f6681c84f003b545a8c953efe96f1870b3f857b2a910e6960d7df2995"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): cmd/ares/evolution.go:465-475 | cmd/ares/evolution.go:508-516 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060string\u0060 to \u0060targetID\u0060 in one and \u0060capability\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/ares/evolution.go"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"604b2b8173274b83f2fbe2309fae180ee4bf4adf248ae65fbf6f7fb2058f8352"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/discovery/providers/filesystem.go:166-176 | internal/discovery/providers/filesystem.go:196-206 \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":"internal/discovery/providers/filesystem.go"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1cae9b2b379eaf6b9aa45595f89d80a1db2f35762dd35bee1b5f31ca87aadd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/fabric/task/fabric_lifecycle.go:816-826 | internal/fabric/task/fabric_schedule.go:83-93 \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. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/task/fabric_lifecycle.go"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"84303e533e21bb6f7625bcefc95374cf2535672ccef0da2e44954365827454cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/knowledge/store/postgres/store.go:407-417 | internal/knowledge/store/sqlite/store.go:515-525 \u2014 \u0060internal/knowledge/store/postgres/store.go\u0060 and \u0060internal/knowledge/store/sqlite/store.go\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 14 separate duplicated blocks between them, totalling at least 202 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 \u0060internal/knowledge/store/postgres/store.go:407\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/knowledge/store/postgres/store.go"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b61905f16d655299168d13e61c4af98d33ccd24965c2ef6c14b357be6d6990"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/runtime/ares_evolution/service/report_hook.go:32-42 | internal/runtime/ares_evolution/service/service.go:272-285 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/service/report_hook.go"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a61dcf7a12f2bc1ec33f8ca32bd206322d4b5e09a56c180a68e86816e4252ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/runtime/observability/flight/genealogy.go:274-284 | internal/runtime/observability/flight/graph.go:151-161 \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 \u0060internal/runtime/observability/flight/genealogy.go:274\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":"internal/runtime/observability/flight/genealogy.go"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b69996ad130a1a2a4463c7cd819802b1ecd3921c30af1a8b73b7ce39f77345"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/tools/resources/builtin/file/file_tools.go:511-521 | internal/tools/resources/builtin/file/file_tools.go:560-570 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/tools/resources/builtin/file/file_tools.go:511\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, \u0060internal/tools/resources/builtin/file/file_tools.go:510\u0060 calls \u0060Name\u0060 and \u0060internal/tools/resources/builtin/file/file_tools.go:559\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":"internal/tools/resources/builtin/file/file_tools.go"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"93524bc06d7c85ac9ed4464b6f65c2ffd289711cb8da82a8dff73ff1bc4cbedb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/tools/resources/builtin/hash/hash.go:51-61 | internal/tools/resources/builtin/stringutils/stringutils.go:73-83 \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 \u0060internal/tools/resources/builtin/hash/hash.go:51\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":"internal/tools/resources/builtin/hash/hash.go"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f12aa21ddf08de62ed1fd40e8a51eea4283bcf9548b3ce564fbe97138c3055"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/tools/resources/builtin/planning/task_planner.go:462-472 | internal/tools/resources/builtin/text/json_tools.go:271-281 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tools/resources/builtin/planning/task_planner.go"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d534dd9d8fc0ac631d5e13c817dc36c54d050d626b9b1b40f213b5cd4f31ab6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): internal/tools/resources/builtin/text/json_tools.go:127-136 | internal/tools/resources/builtin/text/json_tools.go:156-166 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/tools/resources/builtin/text/json_tools.go:127\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tools/resources/builtin/text/json_tools.go"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3511f9d9bdc2e2f7811387b88060e5d51bc51d0ecf496ca2a0002c0a330b1f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): internal/knowledge/store/postgres/store.go:316-325 | internal/knowledge/store/postgres/store.go:365-374 | internal/knowledge/store/postgres/store.go:803-812 | internal/knowledge/store/sqlite/store.go:307-316 | internal/knowledge/store/sqlite/store.go:356-365 | internal/knowledge/store/sqlite/store.go:789-798 \u2014 \u0060internal/knowledge/store/postgres/store.go\u0060 and \u0060internal/knowledge/store/sqlite/store.go\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 14 separate duplicated blocks between them, totalling at least 202 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 \u0060internal/knowledge/store/postgres/store.go:316\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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/knowledge/store/postgres/store.go"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"61733b279de3dab362710cc2a4a0bc43a720781057ad495e3380c8b0f38bb5fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): cmd/ares/serve_wiring.go:392-401 | internal/ares_bootstrap/bootstrap_builder.go:289-298 | internal/ares_bootstrap/provide_distillation.go:59-68 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cmd/ares/serve_wiring.go:392\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. Check import visibility before settling on that home: \u0060internal/ares_bootstrap/bootstrap_builder.go\u0060, \u0060internal/ares_bootstrap/provide_distillation.go\u0060 sit under a restricted \u0060internal\u0060 directory, which only code inside its own subtree is permitted to import from \u2014 so it is reachable from some of these sites and not from others, and being able to see the copies is not the same as being allowed to share them. The home has to be somewhere every one of these sites is permitted to import from; if there is no such place, that restriction may be exactly why the copies are separate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/ares/serve_wiring.go"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"4589cc4fb24f4739b3abd18eedc3e8a2ef1ca0f2e1143cadf8bd2f3ecb7305e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): internal/fabric/task/workflow/engine/recovery_patcher.go:233-242 | internal/fabric/task/workflow/engine/recovery_patcher.go:325-333 | internal/fabric/task/workflow/engine/recovery_patcher.go:416-424 \u2014 all 3 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/fabric/task/workflow/engine/recovery_patcher.go:233\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/task/workflow/engine/recovery_patcher.go"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7d0f1c6ad8807772306f310acd4cabca7c08ddc1f328b7391b1262922ffae7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): internal/tools/resources/builtin/embedding/embedding.go:151-160 | internal/tools/resources/builtin/embedding/embedding.go:193-202 | internal/tools/resources/builtin/embedding/embedding.go:253-262 \u2014 all 3 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. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tools/resources/builtin/embedding/embedding.go"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"71eb72039ac52e95d27334e2295e85694cc053adec6d94ceb3802e88964b4dc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): cmd/ares/agent_kernel.go:222-231 | sdk/syscall.go:112-121 \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 \u0060cmd/ares/agent_kernel.go:222\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060sdk/syscall.go:110\u0060 calls \u0060Errorf\u0060 and \u0060cmd/ares/agent_kernel.go:214\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":"cmd/ares/agent_kernel.go"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"df3a943416636a0743ca16d30991b73374fe7144ab4569e76a0f239ed6b5cc19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/agents/lease/lease.go:86-95 | internal/agents/lease/lease.go:109-118 \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. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agents/lease/lease.go"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db8c943beb318d29a14bb31d462f96e1445dfba0449836a854786358279139d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/ares_bootstrap/provide_mcp.go:191-200 | internal/runtime/protocol/mcp/config_watcher.go:259-268 \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 \u0060internal/ares_bootstrap/provide_mcp.go:191\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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 \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":"internal/ares_bootstrap/provide_mcp.go"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff14c9f44bb17a8c1171fe5e3fcf424cb7089a9ae1f4e23fb0b1e47e177bae2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/aresrecovery/evolution_execution_feedback.go:224-233 | internal/aresrecovery/evolution_execution_feedback.go:247-256 \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":"internal/aresrecovery/evolution_execution_feedback.go"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"0722ffe747c174217f53ba086c03e310aa83f12cde5623b613cf0a9de7e4b1f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/fabric/agent/planner_cognition.go:370-379 | internal/fabric/agent/planner_context.go:237-246 \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 \u0060internal/fabric/agent/planner_cognition.go:370\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":"internal/fabric/agent/planner_cognition.go"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e801d80ea4030bc652c0440b8fa05bc5f76557c3debd49606c2b1afc704c18e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/fabric/task/checkpoint_schema.go:198-207 | internal/fabric/task/checkpoint_schema.go:283-292 \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":"internal/fabric/task/checkpoint_schema.go"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"430d6f9cfcc05eabbe84e045f209744b397f48bff216a3840382b747bad1dd49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/llm/client.go:396-405 | internal/llm/client.go:428-437 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/llm/client.go:396\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 \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":"internal/llm/client.go"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"065ac617dfbd51696c07d74e6c4a159a3ef28b03347e89d36155b785baafb86d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/runtime/memory/memory_patcher.go:105-114 | internal/runtime/memory/memory_patcher.go:132-142 \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. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/memory/memory_patcher.go"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b28f3b6b606a2a5265a4d8b898c521c6152a165b2248f785423102912d814b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/storage/postgres/pool.go:279-288 | internal/storage/postgres/pool.go:372-381 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/storage/postgres/pool.go:279\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":"internal/storage/postgres/pool.go"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d3ae96003d154774def66f3922518ac6cb025fd1f43ad34a6da84e7ffbbcfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/storage/postgres/session.go:116-125 | internal/storage/postgres/session.go:227-236 \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":"internal/storage/postgres/session.go"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a89b85681979cd69a3a753681360cd8386d3fafd9dd1c3a407acb0a2e0c1781"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/tools/resources/builtin/text/log_analyzer.go:206-215 | internal/tools/resources/builtin/text/log_analyzer.go:232-241 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/tools/resources/builtin/text/log_analyzer.go:206\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":"internal/tools/resources/builtin/text/log_analyzer.go"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"022bd8eb37420aef44843fee612353b9c32903f6ff391a1efdb3369ebdaab947"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): cmd/ares/agent_routes_interrupts.go:23-31 | cmd/ares/agent_routes_interrupts.go:55-63 | cmd/ares/agent_routes_task_read.go:191-199 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. 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":"cmd/ares/agent_routes_interrupts.go"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4d822f6db5cd3161633efbdee3d41f161dc92d3d3a8618160972c5b88abb23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/ares_bootstrap/knowledge_akg.go:128-136 | sdk/memory_wiring.go:348-356 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Check import visibility before settling on that home: \u0060internal/ares_bootstrap/knowledge_akg.go\u0060 sits under a restricted \u0060internal\u0060 directory, which only code inside its own subtree is permitted to import from \u2014 so it is reachable from some of these sites and not from others, and being able to see the copies is not the same as being allowed to share them. The home has to be somewhere every one of these sites is permitted to import from; if there is no such place, that restriction may be exactly why the copies are separate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/ares_bootstrap/knowledge_akg.go"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb281c14fc4a4756a053e9712eb5f9bdf5b6fb9cd3f98948c0cd0f5fa5969f9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/fabric/task/workflow/graph/graph.go:61-69 | internal/fabric/task/workflow/graph/graph.go:83-91 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/fabric/task/workflow/graph/graph.go:61\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":"internal/fabric/task/workflow/graph/graph.go"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61276813cf09732cb563d7b2dabf136fddfe7dc135ed76d477a3bcc27e8eff8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/knowledge/mcp/mcp.go:189-197 | internal/knowledge/mcp/mcp.go:381-389 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/knowledge/mcp/mcp.go:189\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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 \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":"internal/knowledge/mcp/mcp.go"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"2abdbf3bc5395d2ff126322fe5844575c10c3aebbb270e34082597c99d61b6c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/knowledge/store/postgres/store.go:724-732 | internal/knowledge/store/sqlite/store.go:703-711 \u2014 \u0060internal/knowledge/store/postgres/store.go\u0060 and \u0060internal/knowledge/store/sqlite/store.go\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 14 separate duplicated blocks between them, totalling at least 202 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 \u0060internal/knowledge/store/postgres/store.go:724\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":"internal/knowledge/store/postgres/store.go"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"42488e7caefe6fd39afd964ca988c3d4868c8598e30925987e687aa08890bea9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/llm/client.go:566-574 | internal/llm/client.go:776-784 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/llm/client.go:566\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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/llm/client.go"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"5213edea607541129bd0cbb502da82b98d5168147f6c3b4b10fa10581dd5c758"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/runtime/arena/regression.go:738-746 | internal/runtime/arena/regression.go:750-758 \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":"internal/runtime/arena/regression.go"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"d617357241b1adb83f48e4cb3e5b2b37e8a0499d512337d563bdbefa8eb08069"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/runtime/ares_evolution/genome/adaptive.go:599-607 | internal/runtime/ares_evolution/genome/population_guard.go:89-97 \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 \u0060internal/runtime/ares_evolution/genome/adaptive.go:599\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":"internal/runtime/ares_evolution/genome/adaptive.go"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"b644fd490ea55c89af0b070ea5a7ea3226888d7c48beda10fe7df6ad4cfc2568"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/runtime/ares_evolution/mutation/guided_mutator.go:260-268 | internal/runtime/ares_evolution/mutation/guided_mutator.go:309-317 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/runtime/ares_evolution/mutation/guided_mutator.go:260\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":"internal/runtime/ares_evolution/mutation/guided_mutator.go"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"7acbe8506a1a23925cf9a12705210b2a39030973d5495dd27c670b88e7beb126"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/runtime/eval/agent_runner.go:142-150 | internal/runtime/eval/report.go:196-204 \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 \u0060internal/runtime/eval/agent_runner.go:142\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":"internal/runtime/eval/agent_runner.go"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"b433c871dbd390c303f817bc6d7a7ec39672c90b72d3393992d613c8853edd7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/runtime/eval/dimension_judge.go:241-249 | internal/runtime/eval/llm_judge.go:377-386 \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. 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":"internal/runtime/eval/dimension_judge.go"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9928eb6afe7c44f39978ce3bb93928aa9fa4762849e94901b4f52d35001024"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/tools/envcap/envcap.go:80-88 | internal/tools/toolsource/toolsource.go:55-63 \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 \u0060internal/tools/toolsource/toolsource.go:55\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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 \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":"internal/tools/envcap/envcap.go"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6d1694aae8dec03fc9f09542d1a94eca61bf1f4e17adf6deece47ee4501045"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): internal/fabric/task/fabric_lifecycle.go:344-351 | internal/fabric/task/fabric_lifecycle.go:815-822 | internal/fabric/task/fabric_schedule.go:82-89 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. 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. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/task/fabric_lifecycle.go"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c064c11797578202282d18bd3fb5a17dd5a2d2aa91caa05b4b038daf054dc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/ares_events/memory_summary_repo.go:163-171 | internal/ares_events/memory_summary_repo.go:187-194 \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":"internal/ares_events/memory_summary_repo.go"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0bf7cae084448e2d6e5e5799762b5a4fefe8fdb596c4285e1bbcbec63c65de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/fabric/task/fabric.go:511-518 | internal/fabric/task/fabric.go:571-578 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/fabric/task/fabric.go:511\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"internal/fabric/task/fabric.go"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"b955c65f753da6ad93629f77b4cbe4d39b81550a4f6e900f3d26d7f262e5703e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/fabric/task/fabric_lifecycle.go:401-408 | internal/fabric/task/fabric_lifecycle.go:457-464 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/fabric/task/fabric_lifecycle.go:401\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 \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. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/task/fabric_lifecycle.go"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5553d7e0bdf7dfb75b33cf0bfbf63cdcb2e1c79b8ab41f80f11183478b3af8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/kernel/executor_registry.go:154-161 | internal/kernel/scheduler_execute.go:102-109 \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 \u0060internal/kernel/executor_registry.go:154\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060string\u0060 to \u0060s *Scheduler) UnregisterExecutor(agentID\u0060 in one and \u0060taskID\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/kernel/executor_registry.go"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8cc93595905bc7897b03ddac3929669f48436ea39cbd8e18ab83e4b703c7e29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/knowledge/store/postgres/store.go:424-431 | internal/knowledge/store/sqlite/store.go:534-542 \u2014 \u0060internal/knowledge/store/postgres/store.go\u0060 and \u0060internal/knowledge/store/sqlite/store.go\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 14 separate duplicated blocks between them, totalling at least 202 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":"internal/knowledge/store/postgres/store.go"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e89fd0e005bb2bc026be5f28eda95ff20dfe0a16d266b8507bb0182e3ce3c96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): internal/knowledge/store/sqlite/store.go:451-458 | internal/knowledge/store/sqlite/store.go:728-734 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/knowledge/store/sqlite/store.go:451\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"internal/knowledge/store/sqlite/store.go"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c93cc027b12bb0ebe1272c644af307db6183dbb8a9847b8a46623309c4bcb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/runtime/ares_evolution/dream_cycle_winner.go:141-148 | internal/runtime/ares_evolution/dream_cycle_winner.go:206-213 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/runtime/ares_evolution/dream_cycle_winner.go:141\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":"internal/runtime/ares_evolution/dream_cycle_winner.go"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"51cc818891b3da04008055662d491146e74aff3088f01b4e6e2b4a3975dfd862"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/storage/postgres/recommend.go:117-124 | internal/storage/postgres/recommend.go:194-201 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/storage/postgres/recommend.go:117\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":"internal/storage/postgres/recommend.go"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"3407191df3981d72eac8b9f782baab719d0a0a8b5ca7cae5f2b187e669bfb1d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): sdk/bootstrap_runtime.go:32-41 | sdk/memory_wiring.go:275-282 \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. 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":"sdk/bootstrap_runtime.go"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10e900ba965231c388f7d5bd36f9b58a25b79612dee65d1be550062088999ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/agents/sub/agent.go:438-444 | internal/agents/sub/agent.go:456-462 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/agents/sub/agent.go:438\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"internal/agents/sub/agent.go"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"153b78613086f8aefa091ef52be89f3a8b646c7b53d4394fd6ee4ff4b9bb6125"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/agents/sub/agent.go:433-439 | internal/agents/sub/agent.go:592-598 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/agents/sub/agent.go:433\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":"internal/agents/sub/agent.go"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"e829fbf35fd2c26674c5195e7f00013aab77dcc9afa9d45389d0efc2591c4b4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/discovery/providers/filesystem.go:158-164 | internal/discovery/providers/filesystem.go:188-194 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/discovery/providers/filesystem.go:158\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/discovery/providers/filesystem.go"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfcc00b4a25a36cb047efb39e979c5d02bbbb7bee43b2289b2486317519b240d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/fabric/task/fabric_lifecycle.go:848-854 | internal/fabric/task/fabric_lifecycle.go:1284-1290 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/fabric/task/fabric_lifecycle.go:848\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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/task/fabric_lifecycle.go"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"8384f373d45631b1c23a25982229edc192b17a9fd5fd230ce07d98a55058e393"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/fabric/task/workflow/engine/mutable_dag.go:112-118 | internal/fabric/task/workflow/engine/types.go:221-227 \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 \u0060internal/fabric/task/workflow/engine/mutable_dag.go:112\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060internal/fabric/task/workflow/engine/types.go:219\u0060 calls \u0060TrimSpace\u0060 and \u0060internal/fabric/task/workflow/engine/mutable_dag.go:109\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":"internal/fabric/task/workflow/engine/mutable_dag.go"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"068ea0c6b9e806b77c0143928f4e7c744554b47c4e410e43ef600ef06a9f2108"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/runtime/archive/reader.go:111-117 | internal/runtime/archive/reader.go:171-177 \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":"internal/runtime/archive/reader.go"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"20bac6e0ea5d36ff0404703e26c44cd863b17236738d5f8a88bf85cf22e989be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/runtime/bus.go:443-449 | internal/runtime/bus.go:467-473 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/runtime/bus.go:443\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":"internal/runtime/bus.go"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6772a88aa10edd3a40b74bf689afef0f9ad72c49b33337bd88a0e30631c4099"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/runtime/evolution/genome/workflow_genome.go:420-426 | internal/runtime/evolution/genome/workflow_genome.go:427-433 \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":"internal/runtime/evolution/genome/workflow_genome.go"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e02ca99036f69295053c56d5fe04c09445812480966ab040bf063ec3f6b300"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): sdk/graph_run.go:275-281 | sdk/graph_run.go:441-447 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sdk/graph_run.go:275\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"sdk/graph_run.go"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d43e2c4b575afd496a01d574f52a6cf1111d61fb2806b5b91a31e1fb633075"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): internal/agents/sub/agent.go:434-439 | internal/agents/sub/agent.go:452-457 | internal/agents/sub/agent.go:593-598 \u2014 all 3 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/agents/sub/agent.go:434\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":"internal/agents/sub/agent.go"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9970034ee43bdf6546fd086e06c37ea2b58f2069d9cba14fea05cc949fcf73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): internal/storage/postgres/repositories/knowledge_repository.go:664-669 | internal/storage/postgres/repositories/knowledge_repository.go:727-732 | internal/storage/postgres/repositories/knowledge_repository.go:802-807 \u2014 all 3 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/storage/postgres/repositories/knowledge_repository.go:664\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":"internal/storage/postgres/repositories/knowledge_repository.go"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5abe2be022c4425ef8da5a39b57f9c64128987d5b85d97c1a8e11e9e7c5bb14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/agents/sub/agent.go:466-471 | internal/agents/sub/agent.go:613-618 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/agents/sub/agent.go:466\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":"internal/agents/sub/agent.go"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"87cc7adf86f48509a15de72aeaeee6199be15c2a382f49cf3a2e91656d7490ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/fabric/task/fabric_lifecycle.go:1013-1018 | internal/fabric/task/fabric_lifecycle.go:1186-1191 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/fabric/task/fabric_lifecycle.go:1013\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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/task/fabric_lifecycle.go"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a430c57a436cf4e6a0d95ff1729774342fc29031a938f1b6a248ea5de725ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/kernel/orchestrator.go:165-172 | internal/kernel/orchestrator.go:616-621 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/kernel/orchestrator.go:165\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":"internal/kernel/orchestrator.go"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7712ba346d1a47f2f7cdef1df036f5bedd45283b377ab4cc470e7877c094cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/runtime/evolution/genome/workflow_genome.go:408-413 | internal/runtime/evolution/genome/workflow_genome.go:415-420 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/runtime/evolution/genome/workflow_genome.go:408\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/evolution/genome/workflow_genome.go"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"8edb0dd6f338c2be0f21062989c779b62f14ce4f9a6eddac5e7297972b2514b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/storage/postgres/session.go:234-241 | internal/storage/postgres/vector.go:151-156 \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 \u0060internal/storage/postgres/session.go:234\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/storage/postgres/session.go"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"229a3f96a8e328bf5f94749c9d29c7d79d704c79082e2ea1529adc6deeda5c9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/tools/resources/builtin/embedding/embedding.go:185-190 | internal/tools/resources/builtin/embedding/embedding.go:245-250 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/tools/resources/builtin/embedding/embedding.go:185\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":"internal/tools/resources/builtin/embedding/embedding.go"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"17cf130886bf3be8b705cb910cf09766c5dffbb600000d252d305b31efd076b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): internal/storage/postgres/repositories/knowledge_repository.go:365-369 | internal/storage/postgres/repositories/knowledge_repository.go:731-735 | internal/storage/postgres/repositories/knowledge_repository.go:806-810 \u2014 all 3 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/storage/postgres/repositories/knowledge_repository.go:365\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"internal/storage/postgres/repositories/knowledge_repository.go"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac32b6ec8b8a81f4bfe7a24aadeaffe13601bc6ec73980fd83c94a1821f5064"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): internal/ares_events/compactor.go:506-510 | internal/ares_events/compactor.go:516-520 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/ares_events/compactor.go:506\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":"internal/ares_events/compactor.go"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"921a71c219337094d477e30f03a63d1bcaab962936c8c65e05ec35ded6d35661"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): internal/storage/postgres/repositories/experience_repository.go:390-394 | internal/storage/postgres/repositories/knowledge_repository.go:654-658 \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. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/storage/postgres/repositories/experience_repository.go"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78661c06491759f5457f5f91c06acba6cd1a197e1fdfb6c5ea9ecc1f58ad3a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): internal/storage/postgres/repositories/knowledge_repository.go:566-570 | internal/storage/postgres/repositories/knowledge_repository.go:669-673 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/storage/postgres/repositories/knowledge_repository.go:566\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 after the matched lines, \u0060internal/storage/postgres/repositories/knowledge_repository.go:571\u0060 calls \u0060Warn\u0060 and \u0060internal/storage/postgres/repositories/knowledge_repository.go:674\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":"internal/storage/postgres/repositories/knowledge_repository.go"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"8162d68bfdeb95d0001a4c6fc3a27aa6889db303e74dcaf29c1e6cff5825eaef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): internal/agentipc/bus.go:128-135 | internal/fabric/agent/fabric.go:122-129 | internal/fabric/task/fabric.go:201-208 \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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agentipc/bus.go"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2068e89c3fc5b946fb8be6ad5df3a7a4e0e65aa6d62a68f8f7b4ee8fe4a53f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): internal/agents/sub/tools.go:128-137 | internal/apitools/tools.go:158-166 | internal/tools/resources/core/factory.go:126-134 | internal/tools/resources/core/registry.go:100-110 \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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agents/sub/tools.go"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"66070c5f325aad3dc82175001a5d93613f75397ff668cc9ca47147da5076d480"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): internal/apitools/tools.go:141-146 | internal/runtime/protocol/mcp/client.go:272-277 | internal/tools/resources/core/factory.go:118-123 | internal/tools/resources/core/registry.go:91-97 \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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/apitools/tools.go"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"987c103be4a091cf854a91c9cc95cb9b3f62e8bc28f21b1bf002c9474d427f82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/ares_bootstrap/provide_distillation.go:310-317 | sdk/distill_events.go:247-254 \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. Check import visibility before settling on that home: \u0060internal/ares_bootstrap/provide_distillation.go\u0060 sits under a restricted \u0060internal\u0060 directory, which only code inside its own subtree is permitted to import from \u2014 so it is reachable from some of these sites and not from others, and being able to see the copies is not the same as being allowed to share them. The home has to be somewhere every one of these sites is permitted to import from; if there is no such place, that restriction may be exactly why the copies are separate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/ares_bootstrap/provide_distillation.go"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"75899b02179a5794d645c2c88993e7b6f25c58a3b42af4689a61e17c549392d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/discovery/identity.go:151-161 | internal/runtime/ares_evolution/toolclass_reconcile.go:207-217 \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":"internal/discovery/identity.go"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4000f9d2e0ebe7a8f55ff7b10b727e74ec725f01f64aeda73eca6deb5ccf3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/fabric/agent/context.go:251-257 | sdk/graph_run.go:452-458 \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. Check import visibility before settling on that home: \u0060internal/fabric/agent/context.go\u0060 sits under a restricted \u0060internal\u0060 directory, which only code inside its own subtree is permitted to import from \u2014 so it is reachable from some of these sites and not from others, and being able to see the copies is not the same as being allowed to share them. The home has to be somewhere every one of these sites is permitted to import from; if there is no such place, that restriction may be exactly why the copies are separate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/agent/context.go"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f639ed92ad55b4ca01e12256ae90e9b6dd04c44bc40d73a38f2c7258a441b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): internal/fabric/agent/reclaim.go:306-313 | internal/kernel/registry.go:256-263 | internal/runtime/ares_evolution/experiment_record.go:187-194 | internal/runtime/ares_evolution/mutation/guided_mutator.go:405-412 | internal/runtime/memory/report/formatter.go:170-177 | internal/runtime/memory/report/formatter.go:180-187 \u2014 there are 6 copies across 5 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 6 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/agent/reclaim.go"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"58063602ef381501d5676fdda3bf257bf048b7c82814fea38bbbe867e09d8b7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/fabric/task/workflow/engine/registry.go:73-83 | internal/tools/resources/core/factory.go:137-145 \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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/task/workflow/engine/registry.go"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e3860ce35dec364bb09033c9d2103312b11fca254c1abede96fdf3eada13f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/knowledge/adapter/distill.go:534-540 | internal/knowledge/provider/store/provider.go:208-214 \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":"internal/knowledge/adapter/distill.go"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f9af59bb2bab7c014ac2ceeba8806880da104a65e4b8cfe2e2af0313de9040"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/knowledge/store/postgres/store.go:559-568 | internal/knowledge/store/sqlite/store.go:674-683 \u2014 \u0060internal/knowledge/store/postgres/store.go\u0060 and \u0060internal/knowledge/store/sqlite/store.go\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 14 separate duplicated blocks between them, totalling at least 202 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":"internal/knowledge/store/postgres/store.go"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c05964ad4ef05165f0040664a3b6c0cff4530592423b8d6782dc758e6f7b76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/knowledge/store/sqlite/store.go:147-152 | internal/storage/postgres/query_utils.go:8-13 \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":"internal/knowledge/store/sqlite/store.go"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ad42be6ecc7a08a0dcb5c0dd8a6021d76d8f9deeb59fe22b3bd3197c71dc1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/runtime/evolution/diff/workflow_differ.go:117-127 | internal/runtime/protocol/mcp/manager.go:760-770 \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":"internal/runtime/evolution/diff/workflow_differ.go"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08cf97645b3173f0147332874a4d671f5723256f1f0f5473ecb4a57395f08f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/runtime/evolution/diff/workflow_differ.go:130-136 | internal/tools/resources/builtin/execution/code_runner.go:163-169 \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":"internal/runtime/evolution/diff/workflow_differ.go"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"11401d73e669a6b9556f84e5ce524e9f145b5223180c9b48a8461bd90bf2b2cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): internal/runtime/memory/context/session.go:167-176 | internal/runtime/memory/context/task.go:93-102 | internal/runtime/memory/distillation/resolver.go:47-56 \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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060int\u0060 to \u0060m *SessionMemory) Reconfigure(maxSize\u0060 in one and \u0060m *TaskMemory) Reconfigure(maxSize\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/memory/context/session.go"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4dbda6e3cd345b79f63a80c6da1a0345ac3ed37702b7c7a70c28c4a0b4fde33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 6): internal/tools/resources/builtin/execution/code_runner.go:580-592 | internal/tools/resources/builtin/file/file_tools.go:607-619 | internal/tools/resources/builtin/memory/memory_tools.go:286-298 | internal/tools/resources/builtin/network/http_request.go:197-209 | internal/tools/resources/builtin/system/id_generator.go:115-127 | internal/tools/resources/builtin/text/json_tools.go:285-297 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 call sites can already reach \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 6 times. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060internal/tools/resources/builtin/text/json_tools.go:283\u0060 calls \u0060IsIdempotent\u0060 and \u0060internal/tools/resources/builtin/execution/code_runner.go:577\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":"internal/tools/resources/builtin/execution/code_runner.go"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a666cc7594963d543530129743ca5372b766bdb24f1e939c820efbb9492c5b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): internal/agents/peer/registry.go:73-82 | internal/fabric/agent/fabric.go:191-200 | internal/knowledge/provider/registry.go:61-70 \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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agents/peer/registry.go"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d39591f16ca9c82c27c3a720c36b4339e1d7eb362ce503f14c63a21fa5f333"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): internal/kernel/registry.go:87-94 | internal/kernel/registry.go:97-104 | internal/runtime/manager.go:331-338 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/kernel/registry.go"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b6ac53fd7537987ddd6e058d18399f518bc989ef16c063f29dc43e496507b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): internal/runtime/evolution/genome/knowledge_genome.go:132-138 | internal/runtime/evolution/genome/memory_genome.go:122-128 | internal/runtime/evolution/genome/workflow_genome.go:181-187 \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 all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/evolution/genome/knowledge_genome.go"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"808dbb0b16450aad0d515e3b1e40a573a4f28fcdbd331b9543b98f9ab369c3d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): internal/runtime/evolution/genome/knowledge_genome.go:147-156 | internal/runtime/evolution/genome/memory_genome.go:137-146 | internal/runtime/evolution/genome/memory_genome.go:148-157 | internal/runtime/evolution/genome/memory_genome.go:159-168 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/evolution/genome/knowledge_genome.go"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"0452d9882bb5b709eeac0eae7104dfaf2ac725e910196eb6c09794a0aeb1e5fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): internal/runtime/memory/context/retriever.go:128-132 | internal/runtime/memory/distillation/scorer.go:230-234 \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":"internal/runtime/memory/context/retriever.go"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1718fbc96b9a3045ee37876dca1632b636e5a6d28484b7b197fdb1d925eab35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): internal/runtime/memory/context/session.go:458-472 | internal/runtime/memory/context/task.go:339-353 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/memory/context/session.go"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"9334dbbcdc09c37f154c60e8220dfc4a9d3fa07326099522de8b17e4324434de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/runtime/observability/flight/genealogy.go:313-321 | internal/runtime/observability/flight/graph.go:170-178 \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. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/observability/flight/genealogy.go"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad9036551f4f1189a2057b1a681e6e3aa88676f538f3a99092d2c529fb361b22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/runtime/observability/flight/genealogy.go:324-332 | internal/runtime/observability/flight/graph.go:204-212 \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. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/observability/flight/genealogy.go"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"42fbe6bc8da326603540cfb9f375bae121b80875cb22496b4ec89b9f50d29db4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): internal/storage/postgres/repositories/knowledge_repository.go:109-126 | internal/storage/postgres/repositories/knowledge_repository.go:148-164 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/storage/postgres/repositories/knowledge_repository.go:109\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. 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":"internal/storage/postgres/repositories/knowledge_repository.go"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce64baf51591eb7328641bec85b9b20c158918a2b2761100c485ffcfd591eb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): internal/runtime/ares_evolution/guardrails.go:325-341 | internal/runtime/ares_evolution/guardrails.go:448-462 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/runtime/ares_evolution/guardrails.go:325\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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/guardrails.go"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"3330485f9bfa575887853ee10b1bca8ab51a5a455c5d19451e9efe38f0d2ec5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): internal/storage/postgres/repositories/experience_repository.go:225-240 | internal/storage/postgres/repositories/task_result_repository.go:263-278 \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 \u0060internal/storage/postgres/repositories/experience_repository.go:225\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":"internal/storage/postgres/repositories/experience_repository.go"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"d428507403619ffd63c4319f923570a280c5cd0dda080e8f70d8f88254cf69a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): internal/storage/postgres/repositories/experience_repository.go:164-177 | internal/storage/postgres/repositories/knowledge_repository.go:369-384 | internal/storage/postgres/repositories/task_result_repository.go:174-187 \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 all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/storage/postgres/repositories/experience_repository.go:164\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/storage/postgres/repositories/experience_repository.go"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c57b494c5d0ef002da71f814a91c64e4458b38a626fe407b70c2bd3f5156185"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): internal/storage/postgres/repositories/knowledge_repository.go:586-601 | internal/storage/postgres/repositories/knowledge_repository.go:679-690 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/storage/postgres/repositories/knowledge_repository.go:586\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/storage/postgres/repositories/knowledge_repository.go"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eae20c9421b879d847bf8a667eb9b4f2c101bee31f35c1b399b811d2666efe4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 10): internal/storage/postgres/repositories/experience_repository.go:528-542 | internal/storage/postgres/repositories/experience_repository.go:628-642 | internal/storage/postgres/repositories/experience_repository.go:736-750 | internal/storage/postgres/repositories/experience_repository.go:776-790 | internal/storage/postgres/repositories/knowledge_repository.go:865-879 | internal/storage/postgres/repositories/knowledge_repository.go:899-913 | internal/storage/postgres/repositories/secret_repository.go:145-159 | internal/storage/postgres/repositories/secret_repository.go:265-279 | internal/storage/postgres/repositories/task_result_repository.go:615-629 | internal/storage/postgres/repositories/task_result_repository.go:650-664 \u2014 there are 10 copies across 4 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 10 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/storage/postgres/repositories/experience_repository.go:528\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"internal/storage/postgres/repositories/experience_repository.go"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe31350d603809bf3d2ed2e4fb8615d261d6fa8d6a8691af2bb8bad0708ddc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): internal/storage/postgres/embedding_queue.go:92-106 | internal/storage/postgres/embedding_queue.go:161-175 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/storage/postgres/embedding_queue.go:92\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"internal/storage/postgres/embedding_queue.go"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7439d85ddb462849fc4ca56bae0c035adb2fe93b6fc834765cdf6d8c3f9ca3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): internal/llm/failover.go:267-281 | internal/llm/failover.go:343-357 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/llm/failover.go:267\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":"internal/llm/failover.go"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"910f0b5bf5a423827246b26dbeafee06f633d88e15675e55d1e642c092527f04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): internal/storage/postgres/profile.go:297-310 | internal/storage/postgres/recommend.go:139-152 | internal/storage/postgres/recommend.go:219-232 | internal/storage/postgres/session.go:176-189 \u2014 there are 4 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/storage/postgres/profile.go:297\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"internal/storage/postgres/profile.go"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a09fdc4477996c6f4166f3a57d7862ad7d3ca1bd1e01ffa617f4973868ea99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): internal/llm/failover.go:239-252 | internal/llm/failover.go:318-331 | internal/llm/failover.go:490-503 \u2014 all 3 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/llm/failover.go:239\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":"internal/llm/failover.go"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ed7c29051dcad78523f3f67bf08d47e85c60bd733d1bd084654a7d2a7ef38b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): internal/storage/postgres/repositories/task_result_repository.go:81-93 | internal/storage/postgres/repositories/task_result_repository.go:112-124 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/storage/postgres/repositories/task_result_repository.go:81\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/storage/postgres/repositories/task_result_repository.go"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"e661d558048e0a26920110767f2f3423552686ee5dad82bd3ed9f3b3fce97e5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): cmd/ares/knowledge_store.go:234-245 | internal/ares_bootstrap/knowledge_akg.go:84-94 \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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register. Check import visibility before settling on that home: \u0060internal/ares_bootstrap/knowledge_akg.go\u0060 sits under a restricted \u0060internal\u0060 directory, which only code inside its own subtree is permitted to import from \u2014 so it is reachable from some of these sites and not from others, and being able to see the copies is not the same as being allowed to share them. The home has to be somewhere every one of these sites is permitted to import from; if there is no such place, that restriction may be exactly why the copies are separate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/ares/knowledge_store.go"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec00a25a58428c038db08ee455f73fb0380bc00ebeea4a12af9b26fc398fff49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): internal/knowledge/runtime/patcher.go:202-213 | internal/knowledge/runtime/patcher.go:223-234 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/knowledge/runtime/patcher.go:202\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":"internal/knowledge/runtime/patcher.go"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c224ae701d9c5f2583b0404566241d788280e4bc997c8f6002150adb0f9a4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/storage/postgres/repositories/experience_repository.go:662-672 | internal/storage/postgres/repositories/secret_repository.go:299-309 \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 \u0060internal/storage/postgres/repositories/experience_repository.go:662\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"internal/storage/postgres/repositories/experience_repository.go"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd414dc3595fb2de61806d8fe1af740ea818eacddcabcb271f0885c2ac5da10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/agentsyscall/syscall.go:356-365 | internal/agentsyscall/syscall.go:487-497 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/agentsyscall/syscall.go:356\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":"internal/agentsyscall/syscall.go"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c896c7eee22b76c8dd2395923712d0ad46e208d7846d1b84043b2b5a08e5e99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/runtime/eval/process_verifier.go:81-91 | internal/runtime/eval/result_verifier.go:103-113 \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 \u0060internal/runtime/eval/process_verifier.go:81\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":"internal/runtime/eval/process_verifier.go"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"6593172ec6bd5252434c0b840a7d27a0fa9f9ffe421543f06ab47c70e1c508aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/tools/resources/builtin/math/calculator.go:410-419 | internal/tools/resources/builtin/math/calculator.go:429-438 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/tools/resources/builtin/math/calculator.go:410\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":"internal/tools/resources/builtin/math/calculator.go"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"90320f81839d2ac1154fd5cacf6dca6f49748374630cd87da39c5dd053f608bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/knowledge/compiler/compiler.go:229-238 | internal/knowledge/compiler/compiler.go:336-344 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/knowledge/compiler/compiler.go:229\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":"internal/knowledge/compiler/compiler.go"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"83171d41040c18d8751ab73450480b3631b482d9213045bd13b9766465158fbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/fabric/task/workflow/graph/patcher.go:162-171 | internal/fabric/task/workflow/graph/patcher.go:288-296 \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":"internal/fabric/task/workflow/graph/patcher.go"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3951ea80013e7204d6f830715bc51c2a8a3fd6cee2e4643e76951a027a44881"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/runtime/ares_evolution/genome_wiring_run.go:439-448 | internal/runtime/ares_evolution/genome_wiring_run.go:482-491 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/runtime/ares_evolution/genome_wiring_run.go:439\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/genome_wiring_run.go"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf1f154faa0c0017bda2e2c8c8218e3d77535d6e1e9e19bfb410df5de6eadcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): internal/knowledge/compiler/compiler.go:171-180 | internal/knowledge/compiler/compiler.go:229-238 | internal/knowledge/compiler/compiler.go:336-344 \u2014 all 3 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/knowledge/compiler/compiler.go:171\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":"internal/knowledge/compiler/compiler.go"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"135c4e6f0a222fd5869c43f88d6e22dfb81bf51ddc73b375714679fecc37d108"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/runtime/ares_evolution/mutation/guided_mutator.go:649-657 | internal/runtime/ares_evolution/mutation/guided_mutator.go:660-668 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/runtime/ares_evolution/mutation/guided_mutator.go:649\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 \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":"internal/runtime/ares_evolution/mutation/guided_mutator.go"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c70d33ee4f7307b7c431626841de44e1a7f2aecd35789a2099e8a06ed7ba95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/llm/client.go:662-670 | internal/llm/client.go:778-786 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/llm/client.go:662\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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/llm/client.go"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a6a91be2122258c961db1f7d9fec8363882be080499c0d359ef534126c745f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/storage/postgres/embedding/client.go:269-277 | internal/storage/postgres/embedding/client.go:319-327 \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":"internal/storage/postgres/embedding/client.go"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e338707a1dae97290a0d7cfc5a473208d3fc6081d4d5188b58bd673525562e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/runtime/memory/experienceadapters/adapters.go:82-90 | internal/runtime/memory/experienceadapters/adapters.go:135-143 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/runtime/memory/experienceadapters/adapters.go:82\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"internal/runtime/memory/experienceadapters/adapters.go"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"159ac89c5d13d9c493781e5ab02b30bfc9fa9edb4aec116376bcf46c6c3f5146"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): internal/runtime/evolution/llm_adapter.go:254-262 | internal/runtime/evolution/llm_adapter.go:279-287 | internal/runtime/evolution/llm_adapter.go:304-312 \u2014 all 3 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/runtime/evolution/llm_adapter.go:254\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":"internal/runtime/evolution/llm_adapter.go"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41b0eabdb5719e1a9455a959b55b789f2ceed7290241b58962de3194163c4ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): internal/storage/postgres/repositories/task_result_repository.go:324-332 | internal/storage/postgres/repositories/task_result_repository.go:426-434 | internal/storage/postgres/repositories/task_result_repository.go:523-531 \u2014 all 3 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/storage/postgres/repositories/task_result_repository.go:324\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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/storage/postgres/repositories/task_result_repository.go"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"448f134380e680dc6fb17e3852590e851cc34d765218b766b891ac941bcbb177"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/tools/resources/builtin/text/data_validation.go:136-144 | internal/tools/resources/builtin/text/data_validation.go:145-153 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/tools/resources/builtin/text/data_validation.go:136\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tools/resources/builtin/text/data_validation.go"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3b78466ed39ca67748f9f24d8b98785d10538c2c1a4472c31a4f5ced3ad6fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/knowledge/compiler/compiler.go:200-207 | internal/knowledge/compiler/compiler.go:360-367 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/knowledge/compiler/compiler.go:200\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060internal/knowledge/compiler/compiler.go:355\u0060 calls \u0060WriteString\u0060 and \u0060internal/knowledge/compiler/compiler.go:195\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":"internal/knowledge/compiler/compiler.go"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2a67580c5904aa6113e2b096cf169f884e30804b3a6fcb6326b5745b27bf14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): internal/llm/chat.go:175-182 | internal/llm/chat.go:298-305 | internal/llm/chat.go:508-515 \u2014 all 3 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/llm/chat.go:175\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 \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":"internal/llm/chat.go"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8dcdc7307b9f3081a75e17aece5752cc1c6b412869cfd2ab8f4cbb79299f4a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/knowledge/store/postgres/store.go:733-740 | internal/knowledge/store/postgres/store.go:784-791 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/knowledge/store/postgres/store.go:733\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/knowledge/store/postgres/store.go"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"993bc6222d838cba2d629d236671c7ff0d71690a62a3ad372bcb99b9b8f03e3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/runtime/observability/flight/collector.go:310-317 | internal/runtime/observability/flight/collector.go:329-336 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/runtime/observability/flight/collector.go:310\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/observability/flight/collector.go"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"97756b85b937d52823a147ed6cab8fba199f8f1024c779ab9a317692c3d5ca01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): internal/llm/client.go:548-555 | internal/llm/client.go:642-649 | internal/llm/client.go:758-765 \u2014 all 3 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/llm/client.go:548\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060internal/llm/client.go:639\u0060 calls \u0060Set\u0060 and \u0060internal/llm/client.go:545\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":"internal/llm/client.go"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f3c482a6f23ffa0bbc063610da985b0f32e557c7ce7589d5d9b236f53b3b2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/storage/postgres/vector_index.go:409-416 | internal/storage/postgres/vector_index.go:451-456 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/storage/postgres/vector_index.go:409\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: \u0060internal/storage/postgres/vector_index.go:409\u0060 is reached only past a guard at line 390 that tests \u0060idx.Method\u0060 and leaves the function early, and \u0060internal/storage/postgres/vector_index.go:451\u0060 reads \u0060idx.Method\u0060 with no such check. What separates these copies is not which lines they run but which PRECONDITION they enforce, so one of them is operating on state the other one refuses. Decide which is intended BEFORE unifying them \u2014 extract the shared part and whichever copy is missing the check keeps running unchecked, and if the guard is the correct behaviour then that hole is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/storage/postgres/vector_index.go"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9567cb38d87e10c3ea25789910d12357e68f31b14bf06012a499e0132df1fba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/llm/chat.go:277-283 | internal/llm/client.go:751-758 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060internal/llm/chat.go:285\u0060 calls \u0060decodeOpenAIChatResponse\u0060 and \u0060internal/llm/client.go:760\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":"internal/llm/chat.go"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb25da812c43e8b4c9d3b9a5abdbc7ab3838270704e2b354fb779cba9d328ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): cmd/ares/serve_arena.go:75-82 | cmd/ares/serve_arena.go:351-358 \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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/ares/serve_arena.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee0c2a3e19f03921def430bfc2be85db1b21986a6e70ac84ddf40e7a169e282"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/llm/chat.go:487-493 | internal/llm/client.go:635-642 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060internal/llm/chat.go:495\u0060 calls \u0060decodeAnthropicChatResponse\u0060 and \u0060internal/llm/client.go:644\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":"internal/llm/chat.go"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"8359b8b69b224fb6158310a81b45e64a2d5f24ac570c96eb2dd1302a8392a287"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): cmd/ares/agent_kernel.go:329-336 | sdk/syscall.go:109-116 \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":"cmd/ares/agent_kernel.go"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea420c8d06ecbaa53a33cf072e4dbf67b37cc2d1dfe93b85c265ae4a1f1e4f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/ares_events/compactor.go:288-294 | internal/ares_events/compactor.go:304-310 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/ares_events/compactor.go:288\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/ares_events/compactor.go"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f27449db548181292f863aaf1784456dced67fef8931a2dc5ea6b8cbd30ef98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/tools/resources/builtin/text/data_validation.go:237-242 | internal/tools/resources/builtin/text/json_tools.go:184-190 \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 \u0060internal/tools/resources/builtin/text/data_validation.go:237\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":"internal/tools/resources/builtin/text/data_validation.go"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a3d1099b18b657455c03ea520d8f99084a919b64b9a533348ab4a225bbab77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/runtime/evolution/patch/patch.go:274-280 | internal/runtime/evolution/patch/patch.go:288-294 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/runtime/evolution/patch/patch.go:274\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/evolution/patch/patch.go"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa69fcbb19e8f1daaac9983abfe93baca7906677f8fb4226e5daad171f7a4100"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/runtime/ares_evolution/genome/selection.go:165-171 | internal/runtime/ares_evolution/genome/selection.go:730-736 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/runtime/ares_evolution/genome/selection.go:165\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":"internal/runtime/ares_evolution/genome/selection.go"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ffd9bd7f7aade48469c3b8b7474374a2e97de4ce5a2738b01ca1357482c4ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): internal/llm/chat.go:173-179 | internal/llm/chat.go:296-302 | internal/llm/chat.go:506-512 | internal/llm/generate.go:226-232 | internal/llm/generate.go:311-317 | internal/llm/generate.go:396-402 \u2014 there are 6 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 6 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/llm/chat.go:173\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/llm/chat.go"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"be788fbf43e91b9e30c900a7d650fead80ae3e621db7514d02cb10d1faef68e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/storage/postgres/repositories/experience_repository.go:691-697 | internal/storage/postgres/repositories/task_result_repository.go:683-689 \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 \u0060internal/storage/postgres/repositories/experience_repository.go:691\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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/storage/postgres/repositories/experience_repository.go"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead09b7f53ebb517b48731c80a577032aef6ada9e8cad9499afe3d502b806d2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/ares_bootstrap/bootstrap_evolution.go:962-968 | internal/ares_bootstrap/knowledge_akg.go:79-84 \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. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/ares_bootstrap/bootstrap_evolution.go"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"01be90d9fe7070bb7822629ef8d87dc3af7099ea64c6041009ecbbfc0f3eb9a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): internal/llm/generate.go:218-224 | internal/llm/generate.go:303-309 | internal/llm/generate.go:388-394 \u2014 all 3 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/llm/generate.go:218\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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060internal/llm/generate.go:215\u0060 calls \u0060Set\u0060 and \u0060internal/llm/generate.go:300\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":"internal/llm/generate.go"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"43eb55e8fcc9896acc2e68598f07ca908782200b5144c4ee149e395fd12b6566"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/tools/resources/builtin/text/data_validation.go:231-236 | internal/tools/resources/builtin/text/json_tools.go:178-183 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tools/resources/builtin/text/data_validation.go"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b4c88620ac6a3b16c213b5cb51a0be9fade6bfa1cf8eec547aa11a2db0e999"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): cmd/ares/agent_routes_chaos.go:71-76 | cmd/ares/agent_routes_chaos.go:105-110 \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":"cmd/ares/agent_routes_chaos.go"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"42cd04a00484ba2e703c9357b9de4e96a9548fe29e9cf8651c437d311436c7de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): cmd/ares/agent_routes_chaos.go:107-112 | cmd/ares/agent_routes_chaos.go:138-143 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cmd/ares/agent_routes_chaos.go:107\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/ares/agent_routes_chaos.go"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a75129458fe4cdbf904554938c8ab901a2dd667df703dcf66c96f4efccd711"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): internal/storage/postgres/repositories/experience_repository.go:296-301 | internal/storage/postgres/repositories/experience_repository.go:391-396 | internal/storage/postgres/repositories/experience_repository.go:448-453 | internal/storage/postgres/repositories/experience_repository.go:564-569 \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. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/storage/postgres/repositories/experience_repository.go"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73f8d396e09ff11746b5fc0db7c9bedc0461dbed1172783cc2841d200309cf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): internal/llm/client.go:556-560 | internal/llm/client.go:650-654 | internal/llm/client.go:766-770 \u2014 all 3 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/llm/client.go:556\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":"internal/llm/client.go"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e4d423c378d72f8f43e79ca2dbeb31d0cfd20a6205ff37a8c6242edb91069f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): internal/introspect/flight.go:132-136 | internal/introspect/flight.go:160-164 \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":"internal/introspect/flight.go"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33029f95cb5c31a9fc05ec1547664862a42a148d629ba0793a876535b3e0eb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): internal/tools/resources/builtin/math/calculator.go:316-320 | internal/tools/resources/builtin/math/calculator.go:331-335 \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":"internal/tools/resources/builtin/math/calculator.go"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f670b6f17c1ee0de90f6bb65a92866ad6f2777fb1ef19bc16ab6822ae58f87"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PrometheusMetrics (LCOM4 28): PrometheusMetrics\u0027s methods fall into 28 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 28 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/observability/prometheus.go"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa009741d7518565adc5d08c7bd8d9c1c0a978f39213ae720d9531b083bca7d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Handler (LCOM4 5): Handler\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/arena/http.go"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da3ac11dd23d2b3206ea10bed50d0fec3f74d0b7d54f619604dc2d76ccbd233"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: sseTransport (LCOM4 4): sseTransport\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/mcpclient/sse.go"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"256b8c43ca02014dc427e3e3bc0bb04be9f8224cc82a789b4e3a7b2e360435c8"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Metrics (LCOM4 4): Metrics\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/observability/metrics.go"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1cbadc335b98cd09b1134cd8594ac534e1a145023453ea27bb96a639cc996c5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/ares_config/config_defaults.go: internal/ares_config/config_defaults.go changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in Config.setDefaults at line 147. 5 of those changes were fix/bug commits, and the other 14 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/ares_config/config_defaults.go\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":"internal/ares_config/config_defaults.go"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cbceba73c3ca22cbd7b72f859a3df377fada04032f5a0565f0f29f4fed091a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/fabric/task/workflow/engine/mutable_dag.go: internal/fabric/task/workflow/engine/mutable_dag.go changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in MutableDAG.ReplaceNode at line 784. 5 of those changes were fix/bug commits, and the other 9 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/fabric/task/workflow/engine/mutable_dag.go\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":"internal/fabric/task/workflow/engine/mutable_dag.go"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"513894a8c0b9ffdd98cc9309748fc6d767819c0b670b9ace2ff6fa45ed34da21"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/ares_bootstrap/bootstrap.go: internal/ares_bootstrap/bootstrap.go changed 41 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ares_bootstrap.wireMemory at line 355. 10 of those changes were fix/bug commits, and the other 31 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/ares_bootstrap/bootstrap.go\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":"internal/ares_bootstrap/bootstrap.go"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44dea07b4b767cfa5f4f061d5c5be216cd6f827f520f77692161a6431e984f4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/fabric/agent/planner_cognition.go: internal/fabric/agent/planner_cognition.go changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in plannerCognition.ExecuteStep at line 516. 12 of those changes were fix/bug commits, and the other 14 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/fabric/agent/planner_cognition.go\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":"internal/fabric/agent/planner_cognition.go"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"974936f6da2e4d07c43de2871e813e07adc5bc7ea2193b6a0e315efc92a1bf45"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/agentsyscall/syscall.go: internal/agentsyscall/syscall.go changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in agentsyscall.BindTools at line 806. 10 of those changes were fix/bug commits, and the other 16 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/agentsyscall/syscall.go\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":"internal/agentsyscall/syscall.go"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a563efe536105b9e6a4847736d29ad43fcb8b6d239181e0aeff9eabd6be299a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: cmd/ares/agent_routes_tasks.go: cmd/ares/agent_routes_tasks.go changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in main.runCollabGraph at line 592. 6 of those changes were fix/bug commits, and the other 13 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- cmd/ares/agent_routes_tasks.go\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":"cmd/ares/agent_routes_tasks.go"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"f418fd695ec292a9380ee301546b3e3965650ca72ae6cad8831b3ab5019b0e5b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/ares_bootstrap/provide_new_evolution.go: internal/ares_bootstrap/provide_new_evolution.go changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in ares_bootstrap.ProvideNewEvolution at line 135. 8 of those changes were fix/bug commits, and the other 17 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/ares_bootstrap/provide_new_evolution.go\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":"internal/ares_bootstrap/provide_new_evolution.go"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"9863c39003fa9af001ae8e5fc4f75f12857128802b77bf704318a4d51c304f2b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/fabric/task/restore.go: internal/fabric/task/restore.go changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in Fabric.foldRestoreEvent at line 244. 8 of those changes were fix/bug commits, and the other 10 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/fabric/task/restore.go\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":"internal/fabric/task/restore.go"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e639a635a9879ce98c055a59cfaeade89182f2abc16ee36530febbdfc4334d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/fabric/task/workflow_plan.go: internal/fabric/task/workflow_plan.go changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in Fabric.CompilePlan at line 128. 8 of those changes were fix/bug commits, and the other 12 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/fabric/task/workflow_plan.go\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":"internal/fabric/task/workflow_plan.go"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"1537ef36bd408b18796698190cd057af39120344a820beecada43787a1a44e3a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: cmd/ares/kernel_loop.go: cmd/ares/kernel_loop.go changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in main.runKernelRecoveryLoop at line 418. 6 of those changes were fix/bug commits, and the other 11 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- cmd/ares/kernel_loop.go\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":"cmd/ares/kernel_loop.go"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"77758cf1af4dd3a104c4ae4bbf4e4b1fa2602a2183fa76f77815c8f1be19e15d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/kernel/scheduler_execute.go: internal/kernel/scheduler_execute.go changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in Scheduler.executeWithCandidates at line 246. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/kernel/scheduler_execute.go\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":"internal/kernel/scheduler_execute.go"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"63dae6c3a4a0cb7a7b7540384952514d746a805a448ec530b0fd8cb0db5b71d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/fabric/task/fabric_events.go: internal/fabric/task/fabric_events.go changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in Fabric.recordWithExtrasLocked at line 89. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/fabric/task/fabric_events.go\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":"internal/fabric/task/fabric_events.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a504acb164fbc14353de603f1752c1b940c678edc0c3d34051c6c975d1efbd70"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/fabric/agent/l2graph.go: internal/fabric/agent/l2graph.go changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in answerCognition.ExecuteStep at line 690. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/fabric/agent/l2graph.go\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":"internal/fabric/agent/l2graph.go"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"2487e3522e40f1eb8a1f88be5fbe2442ecf07ca31e4a8c4fc7ea754769bba25a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sdk/config.go: sdk/config.go changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in ConfigFile.ToOptions at line 375. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- sdk/config.go\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":"sdk/config.go"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a34aa9cf3131e4347ed658e0a37466eb36247198cf0bacedfc32f42e4cc7a0e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/runtime/memory/manager_impl.go: internal/runtime/memory/manager_impl.go changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in memoryManager.BuildContext at line 599. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/runtime/memory/manager_impl.go\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":"internal/runtime/memory/manager_impl.go"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"e320ce19636b531d9e05b2198780f8a47ccbb381397b1a870bcf25e18caa765a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/fabric/task/fabric_lifecycle.go: internal/fabric/task/fabric_lifecycle.go changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in Fabric.createLocked at line 160. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/fabric/task/fabric_lifecycle.go\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":"internal/fabric/task/fabric_lifecycle.go"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"428678cdd9e34f751b446b1c7a78d5f92c3adfa1291d4d1ed52fa6ed55485818"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/runtime/ares_evolution/genome/population.go: internal/runtime/ares_evolution/genome/population.go changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in Population.doEvolve at line 272. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/runtime/ares_evolution/genome/population.go\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":"internal/runtime/ares_evolution/genome/population.go"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ab2faffb3b6d5780e606614de239bb500c9929aa29eb9fe31e9e2ab4e5d547"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/runtime/ares_evolution/service/service.go: internal/runtime/ares_evolution/service/service.go changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in Service.CreateWiredSystem at line 134. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/runtime/ares_evolution/service/service.go\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":"internal/runtime/ares_evolution/service/service.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"7645dd801f176f9acde513ed31165e336dd184fd9436c3f5f2e899501768dd74"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/kernel/orchestrator.go: internal/kernel/orchestrator.go changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in Orchestrator.Shutdown at line 204. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/kernel/orchestrator.go\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":"internal/kernel/orchestrator.go"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"6687c7792f7df3e31e2bbc21240479f8657d710d42a0fa5194007474435ae651"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/ares_config/config_validate.go: internal/ares_config/config_validate.go changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Config.validateEvolution at line 277. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/ares_config/config_validate.go\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":"internal/ares_config/config_validate.go"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"346e7a7efd0fe48a3870994687315f21b21c97a7c0d58f5209f7996c2eae7b0d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/runtime/ares_evolution/genome_wiring_run.go: internal/runtime/ares_evolution/genome_wiring_run.go changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in GenomePopulationAdapter.Run at line 128. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/runtime/ares_evolution/genome_wiring_run.go\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":"internal/runtime/ares_evolution/genome_wiring_run.go"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e86fd4eb5f9c22871310b2775cc1bb06603055befdd2b221dbf4ec9209b1ea5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/ares_events/compactor.go: internal/ares_events/compactor.go changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in Compactor.buildSummary at line 230. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/ares_events/compactor.go\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":"internal/ares_events/compactor.go"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7fa71b1770157541d32d83de8b280a440ec3f0f76c736ac00071aad1cbc553"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: cmd/ares/agent.go: cmd/ares/agent.go changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in actionHandler.checkAuthRead at line 213. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- cmd/ares/agent.go\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":"cmd/ares/agent.go"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"65da29e4d2c2ab66282879681992c683f4423e42228b3f3845879c2f16316b77"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/llm/failover.go: internal/llm/failover.go changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in FailoverClient.GenerateStream at line 317. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/llm/failover.go\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":"internal/llm/failover.go"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c76997db71f92c06ae38f2fd7cbd737db04aef42d625f0b357c8694436ccaa1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/llm/client.go: internal/llm/client.go changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in Client.GenerateStream at line 368. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/llm/client.go\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":"internal/llm/client.go"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66bb6fc320deafa4585035f3380f4c633785eba3bdd4a70424cdbba004552f3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/runtime/ares_evolution/fitness_aggregator.go: internal/runtime/ares_evolution/fitness_aggregator.go changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in RuntimeFitnessAggregator.querySourceMeanScopedAt at line 440. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/runtime/ares_evolution/fitness_aggregator.go\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":"internal/runtime/ares_evolution/fitness_aggregator.go"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24e6ee1cdd96bd143d74368c31e72699a1289fd8807fee6df4a1d10958c4e14"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/ares_events/compactable_store.go: internal/ares_events/compactable_store.go changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in CompactableEventStore.archivePendingRoundsOnce at line 684. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/ares_events/compactable_store.go\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":"internal/ares_events/compactable_store.go"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d702c70abed74d104f33c3580ccba889332300eeb201f0ca6cadc48783ca14"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/runtime/memory/memory_patcher.go: internal/runtime/memory/memory_patcher.go changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in MemoryPatchExecutor.Apply at line 131. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/runtime/memory/memory_patcher.go\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":"internal/runtime/memory/memory_patcher.go"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d53b53d6b725d032fbcce41589ae5409e5f4c7ad047df99e64962e33ae3c68"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/fabric/task/workflow/engine/reloader.go: internal/fabric/task/workflow/engine/reloader.go changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in FileWatcher.scanAndLoad at line 226. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/fabric/task/workflow/engine/reloader.go\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":"internal/fabric/task/workflow/engine/reloader.go"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c57074bd9c9d67f191739a886548a23ed9c5d23bcdce5feed4f806b521783f6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/knowledge/store/sqlite/store.go: internal/knowledge/store/sqlite/store.go changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Store.HybridSearch at line 566. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/knowledge/store/sqlite/store.go\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":"internal/knowledge/store/sqlite/store.go"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"1278efaf47d43c0eb8af0567918526bfa8ad66a0a98e224b04c0726d4e3c0297"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: cmd/ares/serve_peer.go: cmd/ares/serve_peer.go changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in main.setupPeerRegistry at line 368. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- cmd/ares/serve_peer.go\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":"cmd/ares/serve_peer.go"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5fccee81d2f00a0842882c30bec66a6b2b14da768e3ea8c09c345e1e185f455"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/knowledge/runtime/runtime.go: internal/knowledge/runtime/runtime.go changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in KnowledgeRuntime.Execute at line 133. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/knowledge/runtime/runtime.go\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":"internal/knowledge/runtime/runtime.go"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c02ee0cf5c0866e79f828a69ebd36a1ffe8de3906d62040ea4a9d0e6ba180f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/storage/postgres/repositories/secret_repository.go: internal/storage/postgres/repositories/secret_repository.go changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in SecretRepository.Import at line 615. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/storage/postgres/repositories/secret_repository.go\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":"internal/storage/postgres/repositories/secret_repository.go"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98cf38cbd1322c1536cc7f57c066ae7bcece412380098fe5be83113df013d74"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/knowledge/store/postgres/store.go: internal/knowledge/store/postgres/store.go changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in Store.HybridSearch at line 577. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/knowledge/store/postgres/store.go\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":"internal/knowledge/store/postgres/store.go"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"63620ba360f5db5cfcb865c1d319e5dc2410e68c1aaf01661958574e2563874d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sdk/agent.go: sdk/agent.go changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Agent.composePrompt at line 263. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- sdk/agent.go\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":"sdk/agent.go"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"b631a65603063f478d1d8a00979c30312e1ffde09be67ec698e58e2fdd6cba78"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/runtime/manager_lifecycle.go: internal/runtime/manager_lifecycle.go changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Manager.Stop at line 114. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/runtime/manager_lifecycle.go\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":"internal/runtime/manager_lifecycle.go"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d20d853d322679c4a325c5cf7394dd71f64a823591eec9eb43fb0c58e242f4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/ares_bootstrap/retriever_wiring.go: internal/ares_bootstrap/retriever_wiring.go changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in ares_bootstrap.wireRetrievers at line 72. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/ares_bootstrap/retriever_wiring.go\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":"internal/ares_bootstrap/retriever_wiring.go"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a9adca768fe2618d8467da166c3203f49981e184e1172064c9e5b3324208be"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/runtime/evolution/patch/patch.go: internal/runtime/evolution/patch/patch.go changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in PatchType.String at line 73. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/runtime/evolution/patch/patch.go\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":"internal/runtime/evolution/patch/patch.go"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa11e234ebfc94fcf093ffeff87ad0b00d47044ef7a474fd0b31109ca058dc47"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/knowledge/adapter/distill.go: internal/knowledge/adapter/distill.go changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in DistillBridge.DistillConversationWithReport at line 192. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/knowledge/adapter/distill.go\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":"internal/knowledge/adapter/distill.go"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf9f791dfc5aed9acce0d6cc74e469f8d32862ded655f90686f12fe84a24ce89"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/knowledge/pipeline.go: internal/knowledge/pipeline.go changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in KnowledgePipeline.Process at line 177. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/knowledge/pipeline.go\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":"internal/knowledge/pipeline.go"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27eefd92fdbee40a1da2f68d66fd44c9345f8af760da23d62799188e7e90f20"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/apitools/builtin.go: internal/apitools/builtin.go changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in webSearchTool.Execute at line 486. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/apitools/builtin.go\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":"internal/apitools/builtin.go"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a057dd219c36413864013e001a2ec8fb8ec82f98c8c103db2f38466d792c25f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/llm/chat.go: internal/llm/chat.go changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in llm.buildAnthropicChatMessages at line 581. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/llm/chat.go\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":"internal/llm/chat.go"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9184d291b54766eacc4ea17bb2e51b140dae413f00f2a3b5ae2e253224bba4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/tools/resources/builtin/memory/memory_tools.go: internal/tools/resources/builtin/memory/memory_tools.go changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in UserProfile.Execute at line 174. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/tools/resources/builtin/memory/memory_tools.go\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":"internal/tools/resources/builtin/memory/memory_tools.go"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea0a408ef23c76eb4f9e388b4867ebba46f85acb0ec0a6b5b27401b7a690c42"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/fabric/task/workflow/graph/patcher.go: internal/fabric/task/workflow/graph/patcher.go changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in GraphPatchExecutor.CanApply at line 98. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/fabric/task/workflow/graph/patcher.go\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":"internal/fabric/task/workflow/graph/patcher.go"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d5be6c09278b391d52eeee2b9d0adc5c012f0e024bed3ce66f8ceb915c1eaf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/introspect/web/panel.html: internal/introspect/web/panel.html changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in panel.html.renderOverview at line 281. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/introspect/web/panel.html\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":"internal/introspect/web/panel.html"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48461e06a9d41bcb13ada6da048d1aa26092451eb345d368f5b68785d444b84"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/runtime/ares_evolution/gate_eval.go: internal/runtime/ares_evolution/gate_eval.go changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in EvalGate.Check at line 150. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/runtime/ares_evolution/gate_eval.go\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":"internal/runtime/ares_evolution/gate_eval.go"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca566ffc2fc85be90556a30699b0cfdc69f3fdabecc06fd7600d66a1e3d15a8d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/knowledge/provider/evolution/provider.go: internal/knowledge/provider/evolution/provider.go changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in EvolutionProvider.Stream at line 93. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/knowledge/provider/evolution/provider.go\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":"internal/knowledge/provider/evolution/provider.go"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"7911a718cd195810ae4d396c1d03ef27daf025dcefb580c8541c2a2c78dc7cf0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/fabric/task/workflow/engine/dag_patcher.go: internal/fabric/task/workflow/engine/dag_patcher.go changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in DAGPatchExecutor.Apply at line 140. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/fabric/task/workflow/engine/dag_patcher.go\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":"internal/fabric/task/workflow/engine/dag_patcher.go"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f615e2dd71eb38c7e16ca4063be133d62cffdd6687bffc54789368e5dce292"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/evidence/evidence.go: internal/evidence/evidence.go changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in MemoryStore.Query at line 146. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/evidence/evidence.go\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":"internal/evidence/evidence.go"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f34b61ff22a630121c9da328fcb14dabe0437d449d4de4b7d1f4a675931e1bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/fabric/task/checkpoint_schema.go: internal/fabric/task/checkpoint_schema.go changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in taskfabric.DecodeCheckpoint at line 188. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/fabric/task/checkpoint_schema.go\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":"internal/fabric/task/checkpoint_schema.go"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd393911d41fe4414b160577a0d72158374dc93b6e0d1b91753102868dca9d4b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/knowledge/pipeline/normalizer.go: internal/knowledge/pipeline/normalizer.go changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in DefaultEntityMatcher.MatchTokens at line 163. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/knowledge/pipeline/normalizer.go\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":"internal/knowledge/pipeline/normalizer.go"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"5264eef12f9dfc64336bd0ea4a88f6eb7c31603dd40175b7dd7a1e2522d209f1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/knowledge/store/memory/store.go: internal/knowledge/store/memory/store.go changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Store.Query at line 161. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/knowledge/store/memory/store.go\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":"internal/knowledge/store/memory/store.go"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca28e41f5e5bf91cd4afb51b800e0a34e4457b748c59a1bcf2dc6ec5cbd1c148"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/introspect/control.go: internal/introspect/control.go changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in ControlServer.ServeHTTP at line 173. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/introspect/control.go\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":"internal/introspect/control.go"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"531a17d20b1aa3cf6ca4d1491cff32b7c8aa0bc8beebbce69d3dd8a31bd7dbdd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/evidence/postgres_store.go: internal/evidence/postgres_store.go changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in PostgresStore.Query at line 137. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/evidence/postgres_store.go\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":"internal/evidence/postgres_store.go"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"836327f6658ed18fe2c0573724ca4b8d7fd1702b70515ed3a55a0fe908f568d2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/runtime/ares_evolution/dream_cycle_ga.go: internal/runtime/ares_evolution/dream_cycle_ga.go changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in DreamCycle.runGAEvolution at line 41. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/runtime/ares_evolution/dream_cycle_ga.go\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":"internal/runtime/ares_evolution/dream_cycle_ga.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd1d42e81aee179a8cc0c64c394adcee91777b206aee2a3f5e5e880f5cf26fd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/runtime/memory/distillation/distiller.go: internal/runtime/memory/distillation/distiller.go changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in Distiller.resolveConflictsPhase at line 554. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/runtime/memory/distillation/distiller.go\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":"internal/runtime/memory/distillation/distiller.go"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af2443f801b5c96d3295e0b86d98ee0c597f6adb4210334872f8019ddd10f45"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/ares_shutdown/manager.go: internal/ares_shutdown/manager.go changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in Manager.executePhase at line 148. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/ares_shutdown/manager.go\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":"internal/ares_shutdown/manager.go"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"fadff1a06399b400bf83fddb1ca8a0453a71654ecdc8eb6d52170e4db8e71394"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/agentruntime/session.go: internal/agentruntime/session.go changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Sessions.admitFreshLocked at line 150. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/agentruntime/session.go\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":"internal/agentruntime/session.go"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bea0a380977c318a686ed89dfbf374af7277cb6f6a54fb77c344a66e53a342f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/runtime/observability/flight/graph.go: internal/runtime/observability/flight/graph.go changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Graph.AddNode at line 70. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/runtime/observability/flight/graph.go\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":"internal/runtime/observability/flight/graph.go"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3bf21525713ad413b845d9035fd2ed5c4f1e853257657440e3c7cbc6bc51ef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sdk/l2_submit.go: sdk/l2_submit.go changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in Runtime.submitThroughL2 at line 50. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- sdk/l2_submit.go\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":"sdk/l2_submit.go"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb26e84e58473a48241c315794e1945f891172e15ddaf38f04cf54e48d8ea694"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/kernel/scheduler_quantum.go: internal/kernel/scheduler_quantum.go changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in Scheduler.buildQuantumStep at line 65. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/kernel/scheduler_quantum.go\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":"internal/kernel/scheduler_quantum.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ccb86b14aef1e949eff68d1da01753ccb0312992f772a0bc540bdb5c621a0b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/ares_bootstrap/dashboard_observability.go: internal/ares_bootstrap/dashboard_observability.go changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in evolutionTrajectoryAdapter.EvolutionTrajectory at line 50. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/ares_bootstrap/dashboard_observability.go\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":"internal/ares_bootstrap/dashboard_observability.go"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed6f5dc7b09ee9369f8611518abc55d7c34a1142f2419a36b808e833af0c250"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/runtime/protocol/mcp/config_watcher.go: internal/runtime/protocol/mcp/config_watcher.go changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in MCPConfigWatcher.Start at line 103. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/runtime/protocol/mcp/config_watcher.go\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":"internal/runtime/protocol/mcp/config_watcher.go"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b38c972322c893784cd76af1c69a3e165b27b514d6b3a5f300a454f445add0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/knowledge/workflow/workflow.go: internal/knowledge/workflow/workflow.go changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in KnowledgeAgent.Process at line 74. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/knowledge/workflow/workflow.go\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":"internal/knowledge/workflow/workflow.go"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"425395d1b80063d469a28b59c670e170e7536e0458c911fbaf5b7d2f6dec7851"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/tools/resources/builtin/network/web_search.go: internal/tools/resources/builtin/network/web_search.go changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in WebSearch.Execute at line 151. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/tools/resources/builtin/network/web_search.go\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":"internal/tools/resources/builtin/network/web_search.go"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4903afbc8ee5e0c70d6e7c888c4a8cf80832d01df3ccde05b5538c2dda6597e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/runtime/ares_evolution/service/llm_arena_scorer.go: internal/runtime/ares_evolution/service/llm_arena_scorer.go changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in LLMArenaScorer.ScoreBatch at line 350. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/runtime/ares_evolution/service/llm_arena_scorer.go\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":"internal/runtime/ares_evolution/service/llm_arena_scorer.go"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65300c465c28c8a9dbc7fff8dff5fe77fea290f5a115be8e899ffc6ad0f10f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/tools/resources/builtin/knowledge/store_adapter.go: internal/tools/resources/builtin/knowledge/store_adapter.go changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in StoreAdapter.UpdateKnowledge at line 80. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/tools/resources/builtin/knowledge/store_adapter.go\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":"internal/tools/resources/builtin/knowledge/store_adapter.go"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd669b58db21c35b59692402bdc4295493434dc2d1e9229fc74abfe023d39008"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/llm/resilience.go: internal/llm/resilience.go changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in llm.withRetry at line 257. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/llm/resilience.go\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":"internal/llm/resilience.go"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f553894cb017a1a3fcfd6c6b2f2435d9c68178a9770fec7495d2ddcf46b417"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/runtime/evolution/diff/workflow_differ.go: internal/runtime/evolution/diff/workflow_differ.go changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in WorkflowDiffer.Diff at line 25. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/runtime/evolution/diff/workflow_differ.go\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":"internal/runtime/evolution/diff/workflow_differ.go"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"622e1beb581e280eecf2ba80b0d07ebcfbbb06687d6c87102ab4eab0b8694a06"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/runtime/protocol/mcp/factory.go: internal/runtime/protocol/mcp/factory.go changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in MCPToolFactory.Create at line 38. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/runtime/protocol/mcp/factory.go\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":"internal/runtime/protocol/mcp/factory.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c92b7f0a69e84b22c47ca86031a9a0a0480ed1c4fe68b413a5c87f89fab390"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/tools/resources/builtin/network/http_request.go: internal/tools/resources/builtin/network/http_request.go changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in HTTPRequest.Execute at line 70. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/tools/resources/builtin/network/http_request.go\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":"internal/tools/resources/builtin/network/http_request.go"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c37fb0ef8e15160562b05e4bace105d0facf2e256e9a9f4de1356d8d767ebc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/runtime/ares_evolution/genome/selection.go: internal/runtime/ares_evolution/genome/selection.go changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in NondominatedSortingSelection.Select at line 831. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/runtime/ares_evolution/genome/selection.go\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":"internal/runtime/ares_evolution/genome/selection.go"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4e4f857cb6be4a4afe6e2635b15e0beb919dd73263e88c90217c4aa130cfc7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: cmd/ares/db.go: cmd/ares/db.go changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in main.runDbMigrate at line 56. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- cmd/ares/db.go\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":"cmd/ares/db.go"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2fdb3ae157023d99ba7d7710d926886af6280e6ec91a577279e4e44d299b01"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/runtime/observability/flight/timeline.go: internal/runtime/observability/flight/timeline.go changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in Timeline.Add at line 90. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/runtime/observability/flight/timeline.go\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":"internal/runtime/observability/flight/timeline.go"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8f0cc5f3494e427e8b74f8f6cef331866060984f9f0b09bd936048237521c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/tools/resources/builtin/knowledge/knowledge_base.go: internal/tools/resources/builtin/knowledge/knowledge_base.go changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in KnowledgeUpdate.Execute at line 233. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/tools/resources/builtin/knowledge/knowledge_base.go\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":"internal/tools/resources/builtin/knowledge/knowledge_base.go"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca6a8169d51e9436f3a0407c8fafb64fe869245b814840a00f85d6fc8de5e92"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/runtime/ares_evolution/feedback_recorder.go: internal/runtime/ares_evolution/feedback_recorder.go changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in FeedbackRecorder.Register at line 136. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/runtime/ares_evolution/feedback_recorder.go\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":"internal/runtime/ares_evolution/feedback_recorder.go"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d3bb4d608933212eb7bf0f25826d943d433962c7cc98786429d7b34df92af8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/tools/resources/builtin/pdf/pdf.go: internal/tools/resources/builtin/pdf/pdf.go changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in PDFTool.extractText at line 100. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/tools/resources/builtin/pdf/pdf.go\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":"internal/tools/resources/builtin/pdf/pdf.go"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"af479fb1c9f17465b65edf19208e3995081650ca2948a0719097434a32ad3914"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/ares_bootstrap/regression_gate_wiring.go: internal/ares_bootstrap/regression_gate_wiring.go changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in ares_bootstrap.buildRegressionGate at line 75. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/ares_bootstrap/regression_gate_wiring.go\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":"internal/ares_bootstrap/regression_gate_wiring.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"906af8435a2e48219646b5b4ec8234bada465cd8f0b94e9d461bbc453d6b23ea"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/introspect/sink.go: internal/introspect/sink.go changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in introspect.MapTimelineEvent at line 103. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/introspect/sink.go\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":"internal/introspect/sink.go"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d75cb01097155db2fea5f69b4dc9a45bc3d7efed52d185c093068661e70b72"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: cmd/ares/serve_chaos_domain.go: cmd/ares/serve_chaos_domain.go changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in main.liveChaosLoop at line 341. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- cmd/ares/serve_chaos_domain.go\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":"cmd/ares/serve_chaos_domain.go"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d2f865e18952bbf048770c51e8ca210937949eb2097691e7de8fa359c6e29ce"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/runtime/memory/distillation/scorer.go: internal/runtime/memory/distillation/scorer.go changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ImportanceScorer.ScoreMemory at line 86. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/runtime/memory/distillation/scorer.go\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":"internal/runtime/memory/distillation/scorer.go"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a9ee298e87a73fb8a22331a4504e7ed72ea1a0cddfea9f25fef3d8dee00fed"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/runtime/protocol/skills/indexer.go: internal/runtime/protocol/skills/indexer.go changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Indexer.indexOne at line 69. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/runtime/protocol/skills/indexer.go\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":"internal/runtime/protocol/skills/indexer.go"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeff30153aa031fdb5f387160f7ee3ba3118baf6866ddeb4cf71276359302915"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/runtime/ares_evolution/mutation/adaptive_distribution.go: internal/runtime/ares_evolution/mutation/adaptive_distribution.go changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in mutation.NewAdaptiveDistribution at line 129. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/runtime/ares_evolution/mutation/adaptive_distribution.go\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":"internal/runtime/ares_evolution/mutation/adaptive_distribution.go"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"1876a97adc5e6346a1e9bf9df3fd7bb41a67d89c743b124dbec749870165549f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: cmd/ares/agent_routes_interrupts.go: cmd/ares/agent_routes_interrupts.go changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in actionHandler.routeResolveInterrupt at line 54. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- cmd/ares/agent_routes_interrupts.go\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":"cmd/ares/agent_routes_interrupts.go"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"454ec013298ba77c215f6f54c3407c987aef3919942bab3e90faaedad1b2f242"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/storage/postgres/vector.go: internal/storage/postgres/vector.go changed 11 times in last 90 days and 7 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 VectorSearcher.AddEmbedding at line 164), 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(storage): Implement tenant-isolated cleanup and correct embedded queue identifiers.\u201D; \u201Cfix(storage,serve,sdk,knowledge): close review defect batch, tenant-backfill core tables, drop inert RLS\u201D; \u201Cfix(knowledge,mcp,storage,control): tenant-isolate distillation, bound transports, extend write deadlines\u201D; \u201Cfix(security,durability): close proxy auth bypass, tombstone deletes, refuse unsupported human-input\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-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/storage/postgres/vector.go\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":"internal/storage/postgres/vector.go"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"803c00ffaf2906b0e14a0012fc85f4ef55f0938e0a04c487e9bf67554f85fc12"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/storage/postgres/pool.go: internal/storage/postgres/pool.go changed 10 times in last 90 days and 7 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 Pool.Query at line 275), 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(startup): bound the three waits that could hold serve open indefinitely\u201D; \u201Cfix(storage,serve,sdk,knowledge): close review defect batch, tenant-backfill core tables, drop inert RLS\u201D; \u201Cfix(tenancy): thread a request-scoped tenant through the execution path\u201D; \u201Cfix(review-hardening): deep-review defect batch \u002B 2 critical P1 fixes\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-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/storage/postgres/pool.go\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":"internal/storage/postgres/pool.go"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"06444c6ccd4dd1f199fbb30b89b22f1679ea04511d35592e46347f7d82833a88"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/runtime/memory/distillation/distiller_admin.go: internal/runtime/memory/distillation/distiller_admin.go changed 9 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 14 (its worst body is distillation.extractEvidenceFromMessages at line 239), 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-runtime,events): fix  deadlock and implement the  write-back path (0.3.2)\u201D; \u201Cfix(agent-runtime): close trust-root, stall-wait and retrieval gaps (0.3.2)\u201D; \u201C fix(runtime,evolution,memory,mcp,knowledge): close 0.3.1 release-blocking defects\u201D; \u201Cfix(knowledge): enforce tenant ownership at the store layer\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-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/runtime/memory/distillation/distiller_admin.go\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":"internal/runtime/memory/distillation/distiller_admin.go"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59e0b561be737926a0fa95b1aee6b50cba2f0ad7edf6dd3589ed396a8fe87fd"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/knowledge/provider/vector/provider.go: internal/knowledge/provider/vector/provider.go changed 9 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 10 (its worst body is VectorProvider.Stream at line 156), 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: \u201C fix(runtime,evolution,memory,mcp,knowledge): close 0.3.1 release-blocking defects\u201D; \u201Cfix(events\u002Bcleanup): composite (created_at,id) cursor; evoapi surface mirrors; retire review doc\u201D; \u201Crefactor(cleanup): consolidate ares_ctxutil/runtime, move ares_integration, fix token/load-key/l2graph\u201D; \u201Cfix(review-hardening): deep-review defect batch \u002B 2 critical P1 fixes\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-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/knowledge/provider/vector/provider.go\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":"internal/knowledge/provider/vector/provider.go"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"02bd9ec4f8cb3d9e01fb6894af4d4b3abbf70e851ef07f6ec33464c40e4aea92"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/knowledge/relation_extract.go: internal/knowledge/relation_extract.go 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 8 (its worst body is knowledge.FindRelationConflicts at line 275), 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(hardening): signal restart race, ask_agent detach, review P2 batch, SSE Host gate\u201D; \u201Cfix(review-followup): deep-review defect batch \u2014 provenance, races, data loss, MCP\u201D; \u201Cfix(hardening): correctness, concurrency and resource-leak batch\u201D; \u201Cfix(events\u002Bcleanup): composite (created_at,id) cursor; evoapi surface mirrors; retire review doc\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-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/knowledge/relation_extract.go\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":"internal/knowledge/relation_extract.go"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"946dcf5c254629fe9aa5042b215bb5ef6607935f112252791a0668df5e83e995"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/fabric/task/quantum.go: internal/fabric/task/quantum.go 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 12 (its worst body is Fabric.RunQuantumResult at line 142), 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(fabric): a result the task did not take is not a verdict\u201D; \u201Cfix(scheduler): report the execution verdict separately from the storage outcome\u201D; \u201Cfix(scheduler): admit without blocking, and give the three metrics distinct meanings\u201D; \u201Cfix(api): Task retrieval endpoint now returns session answers and failure reasons.\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-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/fabric/task/quantum.go\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":"internal/fabric/task/quantum.go"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0f0ff6ec760a3e98a363d8c34d546dc2eda3935b671d96f5aa7deed9b8d1d0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/storage/postgres/repositories/experience_repository.go: internal/storage/postgres/repositories/experience_repository.go changed 9 times in last 90 days and 5 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 ExperienceRepository.GetByID at line 139), 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(storage): Implement tenant-isolated cleanup and correct embedded queue identifiers.\u201D; \u201Cfix(storage,serve,sdk,knowledge): close review defect batch, tenant-backfill core tables, drop inert RLS\u201D; \u201Cfix(security,durability): close proxy auth bypass, tombstone deletes, refuse unsupported human-input\u201D; \u201CFix: Resolved orphan plugin leaks and the loss of XP metadata constraints during batch startup.\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-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/storage/postgres/repositories/experience_repository.go\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":"internal/storage/postgres/repositories/experience_repository.go"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd6fe90b6df8f37a47648e9095c5e02cedea8527f5981e4254b161306ea7eb0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/tools/discovery/discover.go: internal/tools/discovery/discover.go changed 8 times in last 90 days and 5 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 discovery.NewDiscoverer at line 114), 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(startup): bound the three waits that could hold serve open indefinitely\u201D; \u201Cfix(hardening): signal restart race, ask_agent detach, review P2 batch, SSE Host gate\u201D; \u201Cfix(review-hardening): deep-review defect batch \u002B 2 critical P1 fixes\u201D; \u201Cfix(critical): resolve 9 CRITICAL defects from deep code review \u002B MEDIUM batch\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-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/tools/discovery/discover.go\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":"internal/tools/discovery/discover.go"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"689ea3db9c52bceefd1c53d5e3f54275fa986519dd6b2ffe6e26a147700ae8c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/tools/resources/builtin/execution/code_runner.go: internal/tools/resources/builtin/execution/code_runner.go changed 8 times in last 90 days and 5 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 CodeRunner.Execute at line 172), 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(hardening): signal restart race, ask_agent detach, review P2 batch, SSE Host gate\u201D; \u201Cfix(review-hardening): deep-review defect batch \u002B 2 critical P1 fixes\u201D; \u201Cfix(critical): resolve 9 CRITICAL defects from deep code review \u002B MEDIUM batch\u201D; \u201Cfix(kernel/fabric): M2 hardening batch \u2014 retry, admission, drain limit, security\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-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/tools/resources/builtin/execution/code_runner.go\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":"internal/tools/resources/builtin/execution/code_runner.go"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"777efd487ccbacfbcc33fd2b1cf33b6e410120994d3dc11e1f5784495cfbcdca"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/mcpclient/stdio.go: internal/mcpclient/stdio.go changed 7 times in last 90 days and 5 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 mcpclient.ResolveStdioCommand at line 331), 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(mcp): resolve a bare command through PATH instead of refusing it\u201D; \u201Cfix(mcp): a timed-out call no longer retires the server, and its stderr is attributed\u201D; \u201Cfix(kernel,knowledge,mcp): close 0.3.1 deep-review defects\u201D; \u201Cfix(knowledge,mcp,storage,control): tenant-isolate distillation, bound transports, extend write deadlines\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-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/mcpclient/stdio.go\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":"internal/mcpclient/stdio.go"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c3a1c1d5d1d0198b2425bd9c465a1f50d95ceb60d70cd951e8c4630ab99983"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: cmd/ares/agent_routes_task_read.go: cmd/ares/agent_routes_task_read.go changed 6 times in last 90 days and 5 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 main.waitForTaskResult at line 153), 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(runtime): a pending projection is work, not a stall\u201D; \u201Cfix(agent-runtime,events): fix  deadlock and implement the  write-back path (0.3.2)\u201D; \u201Cfix(evolution,agent-runtime): revert ask_agent to fire-and-forget, add E5 diagnostics (0.3.2)\u201D; \u201Cfix(agent-runtime): close trust-root, stall-wait and retrieval gaps (0.3.2)\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-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- cmd/ares/agent_routes_task_read.go\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":"cmd/ares/agent_routes_task_read.go"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9ac28cab00d6b8a9051dd9aa185b23461c2e9f7f6457d213389634325a4963"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/mcpclient/sse.go: internal/mcpclient/sse.go changed 6 times in last 90 days and 5 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 mcpclient.ConnectSSE at line 34), 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(knowledge): enforce tenant ownership at the store layer\u201D; \u201Cfix(knowledge,mcp,storage,control): tenant-isolate distillation, bound transports, extend write deadlines\u201D; \u201Cfix(review-followup): deep-review defect batch \u2014 provenance, races, data loss, MCP\u201D; \u201Cfix(hardening): correctness, concurrency and resource-leak batch\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-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/mcpclient/sse.go\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":"internal/mcpclient/sse.go"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd6e06a5f532a30c8918a975e7c1bf4fcff07e7b647d5e4583fb22e520ad5b66"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: cmd/ares/agent_routes_tools.go: cmd/ares/agent_routes_tools.go changed 7 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 6 (its worst body is actionHandler.handleCallTool at line 74), 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: \u201C fix(runtime,evolution,memory,mcp,knowledge): close 0.3.1 release-blocking defects\u201D; \u201Cfix(storage,serve,sdk,knowledge): close review defect batch, tenant-backfill core tables, drop inert RLS\u201D; \u201Cfix(knowledge,mcp,storage,control): tenant-isolate distillation, bound transports, extend write deadlines\u201D; \u201Cfix(planprojection,security,sdk): close F-21 drop-compensation stalls and review defect batch :\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-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- cmd/ares/agent_routes_tools.go\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":"cmd/ares/agent_routes_tools.go"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"590f64a2837c114cb76087931b921989da13f590ea370f1b38b575cac396afdb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/storage/postgres/repositories/repository_test_helper.go: internal/storage/postgres/repositories/repository_test_helper.go changed 7 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 10 (its worst body is repositories.createTestTables at line 62), 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(storage): Implement tenant-isolated cleanup and correct embedded queue identifiers.\u201D; \u201Cfix(storage,serve,sdk,knowledge): close review defect batch, tenant-backfill core tables, drop inert RLS\u201D; \u201CFix: Resolved orphan plugin leaks and the loss of XP metadata constraints during batch startup.\u201D; \u201Cfix(tooling): Replace goimports with gci\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-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/storage/postgres/repositories/repository_test_helper.go\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":"internal/storage/postgres/repositories/repository_test_helper.go"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"de922f33746b2656a6ca89ba082594224d581216b04cc168fd65c3915a65039f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/fabric/task/commit.go: internal/fabric/task/commit.go 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 10 (its worst body is taskfabric.classifyBatch at line 147), 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(fabric): keep a task\u0027s own partial commit, and stop a second refusal from reopening a deletion\u201D; \u201Cfix(fabric): one gate for every scheduling entry, and a verdict per task\u201D; \u201Cfix(fabric): a batch reports which of its members landed, not just whether it failed\u201D; \u201Cfix(fabric): a tombstone that might exist must not re-open the task\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-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/fabric/task/commit.go\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":"internal/fabric/task/commit.go"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a7b5b933a522ba94806366b63d868741cbb5146662cf6a3bccb1d5efa53922"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/runtime/memory/context/task.go: internal/runtime/memory/context/task.go 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 TaskMemory.cleanupLoop at line 105), 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(kernel,runtime,memory,mcp,postgres): close phase-2 deep-review defects\u201D; \u201Cfix(hardening): signal restart race, ask_agent detach, review P2 batch, SSE Host gate\u201D; \u201Cfix(review-hardening): deep-review defect batch \u002B 2 critical P1 fixes\u201D; \u201Cfix(critical): resolve 9 CRITICAL defects from deep code review \u002B MEDIUM batch\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-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/runtime/memory/context/task.go\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":"internal/runtime/memory/context/task.go"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee1707acf0ed8b8b12f14c6fcc7ac43cbdae5589eadaf24338197a66a6a1499"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/agentruntime/await.go: internal/agentruntime/await.go changed 5 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 14 (its worst body is agentruntime.AwaitSessionResult at line 407), 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(runtime): a pending projection is work, not a stall\u201D; \u201Cfix(agent-runtime,events): fix  deadlock and implement the  write-back path (0.3.2)\u201D; \u201Cfix(evolution,agent-runtime): revert ask_agent to fire-and-forget, add E5 diagnostics (0.3.2)\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-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/agentruntime/await.go\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":"internal/agentruntime/await.go"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a80ec768b24f4efd4f22bdf41a078a15d1a70d20a638a1cf5d82a4eac959cd"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/fabric/task/fabric_schedule.go: internal/fabric/task/fabric_schedule.go changed 4 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 Fabric.Schedule at line 24), 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(observability): sample dispatch after the claim, and keep queue age visible when nothing runs\u201D; \u201Cfix(scheduler): admit without blocking, and give the three metrics distinct meanings\u201D; \u201Cfix(planprojection,security,sdk): close F-21 drop-compensation stalls and review defect batch :\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-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/fabric/task/fabric_schedule.go\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":"internal/fabric/task/fabric_schedule.go"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e9fabe8462597e1e4ddeeae72db2062a29b54e4d4575cf917a070444e42555"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/agentruntime/submit.go: internal/agentruntime/submit.go changed 4 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 14 (its worst body is Submitter.Submit at line 151), 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(agentruntime): a refused submission leaves nothing behind, and cannot delete someone else\u0027s work\u201D; \u201Cfix(tenancy): thread a request-scoped tenant through the execution path\u201D; \u201Cfix(planprojection,security,sdk): close F-21 drop-compensation stalls and review defect batch :\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-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/agentruntime/submit.go\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":"internal/agentruntime/submit.go"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9fede236bafc39e95328062600dd14bda710d46e26de0b436ecfa4e79dc9b0e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/logger/logger.go: internal/logger/logger.go changed 4 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 2 (its worst body is Logger.slog at line 80), 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(events\u002Bcleanup): composite (created_at,id) cursor; evoapi surface mirrors; retire review doc\u201D; \u201Crefactor(cleanup): consolidate ares_ctxutil/runtime, move ares_integration, fix token/load-key/l2graph\u201D; \u201Cfix(review-hardening): deep-review defect batch \u002B 2 critical P1 fixes\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-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/logger/logger.go\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":"internal/logger/logger.go"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73beec6eceea0fb3b15c0d87849c50150b14e080e9d4005c0a3cea09adbaf12"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/runtime/memory/push/service.go: internal/runtime/memory/push/service.go changed 4 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 push.matchesCriteria at line 248), 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(bootstrap,runtime,serving): self-healing background workers and write-deadline propagation\u201D; \u201Cfix(hardening): correctness, concurrency and resource-leak batch\u201D; \u201Cfix(review-hardening): deep-review defect batch \u002B 2 critical P1 fixes\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-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/runtime/memory/push/service.go\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":"internal/runtime/memory/push/service.go"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48b3d1c1ad6ab0df553697ff2229ce4ffd6a5e930284e33894f5fd367c685fc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/storage/postgres/repositories/experience_repository_memory.go: internal/storage/postgres/repositories/experience_repository_memory.go changed 4 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 memoryExperienceRepository.SearchByKeyword at line 248), 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(review-hardening): deep-review defect batch \u002B 2 critical P1 fixes\u201D; \u201Cfix(critical): resolve 9 CRITICAL defects from deep code review \u002B MEDIUM batch\u201D; \u201Cfix(fabric/agentipc): M2-b review follow-up batch \u2014 assertions, nilnil contracts, dead dispatch\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-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/storage/postgres/repositories/experience_repository_memory.go\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":"internal/storage/postgres/repositories/experience_repository_memory.go"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"449aa9ea53fa65559ed5f8e1d09dda73fc6c4c2bb0b74768274d3cd9f16e0370"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/storage/postgres/session.go: internal/storage/postgres/session.go changed 4 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 SessionRepository.ListByUserID at line 192), 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(storage,serve,sdk,knowledge): close review defect batch, tenant-backfill core tables, drop inert RLS\u201D; \u201Cfix(review-hardening): deep-review defect batch \u002B 2 critical P1 fixes\u201D; \u201Cfix(critical): resolve 9 CRITICAL defects from deep code review \u002B MEDIUM batch\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-08..2026-11-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-08 09:10:14 \u002B08:00\u0027 --until=\u00272026-11-06 09:10:14 \u002B08:00\u0027 --full-history --no-merges -- internal/storage/postgres/session.go\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":"internal/storage/postgres/session.go"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62be7b5e0be034b0d8dd219a17fd050bf2fbc1ab4808cf34a7b5089e353d271"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(tech-debt): plumb token-level streaming through the L2 answer \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/agent.go"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"d751d595fdb0fdc2c6ee7185bd7dd81550ce25908e6d3eafccc25a6cd1d9478d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(tech-debt): four hand-written runtime.NumGoroutine() comparisons predate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/goleak_test.go"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb83f823fde887c40c2641bb21dff489ed5b2d51c699a13bfb01bd989f81096"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(tech-debt): wire an approval hook into fabric/agent tool cognition and \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/options.go"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5937a0708d6284ecf53c7b027ca7ed8456fecfe254350fb1ea8e0f8b45a198"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(tech-debt): thread the caller\u0027s tenant/user identity through the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tools/resources/builtin/memory/memory_tools.go"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02317b5ea9b4c4a4c95e9544763df65858417e60320efdd1e1f13af3fd1671c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: introduce a schema_migrations version table to enable real rollback \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/storage/postgres/migrate.go"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11840478035c1537d9722d177129dfd6cd0db591122baaf57f81f0889309157"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(tech-debt): this test is not re-runnable under -count\u003E1 (pre-existing, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/storage/postgres/pool_tenant_finalizer_test.go"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae16dd0dd675155b9d473a42067b9e6a3f77eccf250ba3ecc39b5d72652cd6e9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: the returned tool owns the client (and its stdio subprocess); \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/protocol/mcp/factory.go"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"73781a67ac3d4c26491b7f4a58ebd414b060092231615330efe8827995656ddf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // goroutine. TODO(tech-debt) trace left behind: if a context cache is ever needed, add it \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/memory/context/task.go"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01843520f1554a9da1538a926357b565b8532bbbbf49ee42ea0882f7109d761"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(tech-debt): this is where a candidate\u0027s fate is decided, and it is the natural \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/evolution/candidate_pipeline.go"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"7322f9b68623ffaa8352abc844d33e85b35db3a183ce423e26e84272a148adea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(tech-debt): PatchChangeScheduler has no live producer. The LLM \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/evolution/patch/patch.go"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6590f92092235846dc8e3d74e11da6a981a7d88f02d13c37e3a604300fff39"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(tech-debt): decision records share KindFitness with runtime fitness \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/lifecycle_evidence.go"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"931bc2db995d914178802a65eb8a58ed268ba5de91905f084ae48008a621a545"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(tech-debt): EvalHarness is unwired \u2014 no production caller. The raw \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/knowledge/retriever/eval.go"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ac56c44c92d24aace212a0020ddad9180e1774f4f31cc0a9c65d34714bcc35"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(tech-debt): the caller merges on this at Confidence 1.0, which is \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/knowledge/pipeline/normalizer.go"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"462a0b2d4c8c74580464aae179c88734d0d3c9345f63e4ac45634c45d65b6398"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(tech-debt): the per-agent local ready-queue design \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/kernel/scheduler_dispatch.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3974f538f7cbc36bebb5975170adbeeda1aa2af01ca792450e6b4866b6ca77"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // {\u0022count\u0022:0}. The endpoint now reports 501 not-implemented. TODO(tech-debt): \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/introspect/intel.go"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"0855290ba354ee446cae7b66822e00854c5b800ba2a3e6747061002e72ad739f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(tech-debt): a task that is deleted and then reinstalled via \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/task/events.go"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"a225c3bd73ea78c67d732d4cbaa45f9a8e6742c8612f8f8b464b741c360a61d8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(persistence) \u2014 the ledger is IN MEMORY ONLY. An unknown outcome is therefore \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/task/fabric.go"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad121a66c67807f2ba73bbf6b6ceac24bcdb7c64d3890582c1ac55e2c1f02828"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(persistence): this ledger is in memory only, so an unknown outcome is unrecoverable across a \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/task/reconcile.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"efeecd6d194da5a210b0e403822c4c4973262a26745e3dafd7770da6fb9b1b7d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(tech-debt): the priority / short-job / round-robin / weighted-fair \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/task/workflow/graph/scheduler.go"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb52f2ec70a104609565f06603da12ea40c38f520b69c32c8fc8066e3cf26078"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // the L2 router; TODO(tech-debt) trace left in sub_cognition.go\u0027s removal). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/agent/executor_test.go"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"16df332f7925d5ddb16d97c40b69239fed7e0f8a471421907626893ad1868427"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(tech-debt): unify the serialization name across the schema, the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/core/models/recommend.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d4427535b1c2c72dbac1896dca24936a6fc67d8ddbaedb45bd9ed538c556d3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(tech-debt): collapse to one field with both JSON keys served at \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/core/models/task.go"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"22bb084cdb7b406ec79e67316b94e29ff76e21279de118d6e5b8255c8e6b8c47"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(tech-debt): the compat.RegisterLLM block was removed (M5 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/ares_bootstrap/provide_llm.go"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce0430036b48e1ad8741ad809e5ab00e80ba5e481eb480b25040c57d339da6f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(tech-debt): the scheduler genome dimension was retired \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/ares_bootstrap/provide_new_evolution.go"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac606b2c553caf281c9f4ffce035246b0d418be593260b4f6a5ffa612833a7b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(evolution-dim): candidate successor dimension \u2014 a concurrency \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/ares_bootstrap/provide_new_evolution.go"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"4228d5286597f5c3929cffc868994d374edaccbd20ed74f084b9e6126e6b8cd7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // with the repository (TODO(tech-debt) trace left in RUNTIME.md #9)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/ares_bootstrap/tool_deps.go"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb656ff08d83d20c17c206a7d8a6970dd160e63607b2ce83169e865ea5cd8937"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(tech-debt): the msgQueue parameter (and the SendMessage/ \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agents/sub/agent.go"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"285fa5ea8e48310239a9958323cd40479b75fd4bdb9ceb3d38d7abcacda22661"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(tech-debt): authenticate \u0060from\u0060 (capability token per agent or a \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agentipc/primitives.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"5150e427a2e638ff198847cdb0100a8c4eb89005f7f972243d18efcdf7fa9406"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(evolution-dim): the scheduler dimension was retired \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/_internal/runtime_evolution/basic/main.go"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc47f144d7ae252bdbf65b93e5f0938f818b7ca99b45166c2ab80ed9472d3e02"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(tech-debt): peer direct messaging (the sub.Agent message queue / \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/ares/agent_kernel.go"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"417c87f14c438e0594a6033d8796c85162d1a07bbcb89f0ab15e5ca3da790f61"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(tech-debt): the DDL itself stays in migrate_storage.go for existing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/ares/db.go"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"0896be02037dfadda4d8f57994dc4ba5acc33a6e9e60e840e1ecbe27006d4671"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(tech-debt): agentipc records undeliverable/timed-out requests in a \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/ares/kernel.go"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"929d1f4d588beec99abc29157f2ff68cc173d8c62d30c4710825d441459b3c45"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(plan/runtime-stability, round 2): this sweep has no caller to return to \u2014 the recovery \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/ares/kernel_loop.go"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fcd112617ae303c680a5c2ff06c379c00ee08f695e833a219cc06950022143a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(tech-debt): the separate output.LLMAdapter assembly \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/ares/serve.go"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"295293ef9aee641a0370e0cbcc603cd8fc815b95eeff9b89ad6dd2d46c52dea6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(tech-debt): no production agent exposes the SendMessage surface any \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/ares/serve_peer.go"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd50e815e17cf2f9ba923a421639d4c565fd6eedffe6cc2a05ac7870ecaf4c6b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(tech-debt) partially resolved: PG mode consciously keeps dropping the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/ares/serve_wiring.go"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c29021182086a7760b54807bb256391efef25de118483b258272271c2f1f3bc"}},{"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."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2bea044ff79d7d275f5a91a6e2f548586178eaf480274c33960ad020c854631"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 2 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is \u0060(repository root)\u0060 (188741 LoC, 1621 module-visible types across 132 directories). 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":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D27","level":"note","message":{"text":"Scattered collaborators: 58 % of calls cross a namespace and only 44 % 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":"D28","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":"f64bebfb873afc0f3e67e2264d4c2104a97adee1653509d09e6db5e8d402f5be"},"properties":{"commitSha":"07bf15369e732f5220cd54e0a593e4ae875710d7"}},{"ruleId":"D28","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":"c6c7434381cfd74e71b7bc4e41c2ba4df11717c9264c9a85e6260b656a22d74f"},"properties":{"commitSha":"2cb4ae2b2820e2fd2e5d49efe6202c9987722318"}},{"ruleId":"D28","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":"7a4292bb2803bec885e1cd23d000af8911c20a7df873a32c5dba9b7c321c36ed"},"properties":{"commitSha":"2cb4ae2b2820e2fd2e5d49efe6202c9987722318"}},{"ruleId":"D28","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":"afc3c2c635c19a77e6dcc2d6c43c9b1b9279dccf02d948dc2aed39c1de0c008f"},"properties":{"commitSha":"43ad2a6a4117ced9d0202d23d0d8c3b82be93c13"}},{"ruleId":"D28","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":"f927fef3196b3bb189de3f50379069f3590430fcb81ca682c8613e15339dcdf3"},"properties":{"commitSha":"691e2b8a15d28ca222d104eee8b62b1ce0a1cbf1"}},{"ruleId":"D28","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":"1eefe6e287b374615269162d6879297b237dde2fdc400f508abe9fc55111c55a"},"properties":{"commitSha":"3f305ea5334cfcde3137ae89c230d9bf994a040a"}},{"ruleId":"D28","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":"05df483675e97d7ee5b0f919a1033a97cd4ac191db0458222b6594019dcb0edf"},"properties":{"commitSha":"a2777cefc3f516b34f9437489e7913e87a9efeaf"}},{"ruleId":"D28","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":"8caffa65d9d635966a5c11d33ea180b818e2ea61fa0d0efece361efaa83ad5ea"},"properties":{"commitSha":"f60e2eb20edd5ae1c3aaada720d8b85f0ab02c7f"}},{"ruleId":"D28","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":"a336e3a1de70a2ca88f3a4a16e2d7bbfbbbfac830a9735206d77c6f7cc81598f"},"properties":{"commitSha":"8dd806356846c3a805091c710309c4311fbcb3cc"}},{"ruleId":"D28","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":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","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":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"b932dd9f60810216e743e2cca9e69ca0e486184a1dcaff99c8a3d18510d7fa64"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"f43dff51546d1ed5f49c2306e89e9c1cf4ea59a3e571f8cbc703eff56e0ddb94"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"8f3fd0ba47be05a9f4a1461c25b7e1c938701a8d51e2d9fa984ac40973ab921b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"dee49343bf7aad88486132569ab0cb7f6fbc5f827fe4d1edd23ec71703e432d9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"5a5b784e8622653f6cd86fee6eb9a1263511207158e26812ea72909576c5433b"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","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":"703b990f6d9a60db46de372b4bc3713bc769740b61be7dfed2b23b523664ac12"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"228717293663adf6814e4ed3902d35ae57e0fb1ae37165ea4de4f676848a2612"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"bc26593caf509b487cb3dff9d1a587737a02c72fc5e13e59c1a151f7d6412ad4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"f922c7255994f5959364b9c3250dce73177cf5bdea64983fea86dca2fed1d22b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"bc17439367157c6f6ff8590f4dfe29bc3a0ce4e328d99df310f8a49a2877af10"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"6bc3b539f953f180f304780b633bbb65e6d2911ce57503f2f0e4a05dfd504060"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"d4a59e5ebdd54602107746841fd10b7252c68b34b02e02c73ed80377e8c2ca39"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"31e15292ee7781495cff3025f3779e23aded0d07be93120b45c65e1d6518c389"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"ed6f7f9c7c66487bff3c29d3a006cbac6d0bba1975272d4d518a58edd59d7a41"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"957b150e90b8de065e3fab913d6db8aa84cc38085b4826b482eaabde0c4cf347"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"69b9e576a6780cbce36c054358ab6f9045c15948dafe82b57a70651a9a98b375"},"taxa":[{"id":"CWE-89","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":"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":"95b310231db651a5245c37cbd450f8dc77b4c781a3699ee29946ba4770cd7798"},"taxa":[{"id":"CWE-89","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":"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":"030a5d4c5c1841903785fd6f49438c28ebb8111c8e4c9152693a8ba3abf7d51a"},"taxa":[{"id":"CWE-89","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":"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":"2b0ede2e2f331a8c2e581b992d16ef2cb3239de4c7f09e07ce1461e550fe1921"},"taxa":[{"id":"CWE-89","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":"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":"2681b35b69f451c503859a030e37c470e42b2dddb09749aa5da127b10ce9fd47"},"taxa":[{"id":"CWE-89","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":"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":"e586a7b255e559911a1388e804cbf749335bf97cfa66015990ca615d856bdbc6"},"taxa":[{"id":"CWE-89","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":"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":"0812686a5443a3cbcd9d24cad87bfa608c01c840012a1099caa478051ec01538"},"taxa":[{"id":"CWE-89","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":"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":"64c8fdf30be4f728975428fe502d9610c2d562a6ef002fb523904cefe8bff41a"},"taxa":[{"id":"CWE-89","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":"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":"5c4bad399ade01f01c6b2e666fa7d68f606e13970db5ed28e6c7d325f89c5707"},"taxa":[{"id":"CWE-89","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":"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":"091da735c70079b068c2da16f061a4015a4a2e1baeaa6b2c0f8c7901120ee2c6"},"taxa":[{"id":"CWE-89","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":"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":"eb7d05ddde902fe70d05bff51870dc1b533935595e8568fddf42028e5f041ae9"},"taxa":[{"id":"CWE-89","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":"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":"01d5e1fac27971609d176134d5bbfe8435d81404b457b1a087aa1def1a5e474c"},"taxa":[{"id":"CWE-89","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":"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":"82c26878f3d6d6d741271a2bd3e3e02251359eec8fdc2cc90196fd08be14b4cb"},"taxa":[{"id":"CWE-89","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":"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":"087c806b9b558cb6629e04042aa1d760648e996239b015104613ac2806880f12"},"taxa":[{"id":"CWE-89","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":"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":"571a7f7dd321661e9ef8d7d686047b64a867114eec8d59cd63b2688f0e8b919d"},"taxa":[{"id":"CWE-89","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":"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":"d7c1a1dc0129fbddf7a59a368d7081a00e6a2924098d11336e432b7e99a1951d"},"taxa":[{"id":"CWE-89","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":"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":"faca0434f9bb1f16439b1283887468e03e5542c94f8856f2f0d4a02f338bb7db"},"taxa":[{"id":"CWE-89","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":"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":"048ff513eb593c351cbeb92bd1ae8941e87ea4721c03f6505eb286ef07137d4d"},"taxa":[{"id":"CWE-89","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":"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":"916797b8154ce5965ac154f40352f025a548a8c6919a1b8098ed2abab0e19680"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"12fe7975265bdd25031de5c8974f450929642aa2e408ea55779f4090096f756c"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"028361ee59c16ba0aa5f1da5fcf6e20013a9c226ea45df7f191c410ca2812b8c"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"b9d45200abd430a8461e73d5fa1b1e3454fe99db8d02929d8e3d93c395f8ff5c"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"74d43666797601997c58d7c587cf3a4246bd4ff1ec9564859ab8267c9b0a64ad"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"3ab058aa4ffca22c448fba2373323379518d7333774ab9cf8797b24f2e35090d"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"ecfe56d79d24171788596e6e7299bc0dab4d591c6e86aab15ac8199c287d0270"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"7e67fdab537f76b2741bf186f450671f4a5fd84f80cf4dab758ca0fbad2154b2"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"c74973cc2b0b401ce460def88929d6218f591affce1cec2e8eda7deba7818b96"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"71375feafc1e14ae05f81678c2b08da0a60cd949f730864c4ae0ff8d98a804d6"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"d408a7200bdd9ba93759311f49dda63d9c9949555258b07a4c0fcca357b5b964"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"c4cba0e57cbd6d22aed199263e82bbf8a4e6dae4b133d31ee515ac122882a26e"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"8d4a0f1929f34b20b8bc2f8f7e48197ce3f563d331ee6b6e6fd51b8cfc75a0db"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"257f948db1f04e1cd6e75bfc5946e557ea94fc75832c87ffe213c73e4a398931"},"taxa":[{"id":"CWE-338","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"cdccd7c707342e2a04bc3314538042485fa86aaec8bcad402202b130190994db"},"taxa":[{"id":"CWE-400","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"f85cf3e4bde92867d599c84f4bd8bd99ce5a8c2fdd150ed720ebd645f07e6e44"},"taxa":[{"id":"CWE-665","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-908","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"ef0f176c2b34583b52fec816991eae428d2c8c73ee51b8fa2f15f9ea2570e437"},"taxa":[{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"c523e56bf01709eaad9cd694b361ce6123e90ab7f5ca0dff61d2091b16055ed7"},"taxa":[{"id":"CWE-338","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"ff2cdf040611b130b49efcd417b313c952ca21c98410978890013986107e107a"},"taxa":[{"id":"CWE-338","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"cf470749c783fc0e498356c3d399f1d3b37727af2ab3257a9cd0b96ad20540a5"},"taxa":[{"id":"CWE-338","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"f25635583b35d14cb51321fd5aad1193dddc707ec489945fd522eb63ab6b4c81"},"taxa":[{"id":"CWE-338","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"30e28fe3bacdc764ffa70fdce7424fea9c88774eb5d2dc3fdd7d60e4a97efb1f"},"taxa":[{"id":"CWE-328","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"974bc6895f4abe2f6124827bcd7db04a6612ecc4615f8576bb8b0c8cac233d98"},"taxa":[{"id":"CWE-328","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"59807e79c2697e6cd3faafb0036e3456569b62a3551b05aa4c7fad7d75cab48e"},"taxa":[{"id":"CWE-942","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"ed08cdf0b59e11105914b441e9cff286a4771d04a8e018efbca5e6f41ef25389"},"properties":{"dependency":{"package":"anyio","version":"4.12.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]","PYSEC-2026-4024","PYSEC-2026-4025"],"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":"4585dcfc30faa305b64dbf14829d1c8aca562fd9a72c192a09af24ebd040dd7a"},"properties":{"dependency":{"package":"sentence-transformers","version":"5.3.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-4164"],"reachability":{"kind":"production","file":"services/embedding/app.py","line":160}}}},{"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":"b2eeba203da1b16c23ad6ebf632ee4cf4b1f37c066f1ea8fa0aab19cb9ee1136"},"properties":{"dependency":{"package":"certifi","version":"2026.2.25","advisory":"[GHSA redacted]","aliases":["PYSEC-2026-4320"],"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":"db9a7c123703da1f12d875a843f2eac0d41445d9e6bcd868b2ca6d3eea4fd49e"},"properties":{"dependency":{"package":"fsspec","version":"2026.2.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-4217"],"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":"2bea8ebb332791753e363b55de0022a41e4ec966ab7366c4be90562d5dc64352"},"properties":{"dependency":{"package":"starlette","version":"0.52.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-161","PYSEC-2026-2280","PYSEC-2026-2281","PYSEC-2026-248","PYSEC-2026-249","X41-2026-002"],"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":"1675f30a451ccdc626f2fc23af613128b955cf5bf4e856918a60209c1725ae8b"},"properties":{"dependency":{"package":"urllib3","version":"2.6.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-141","PYSEC-2026-142","PYSEC-2026-4175","PYSEC-2026-4176","PYSEC-2026-4177"],"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":"46c1d5f0647d9ea346a415b80f347d72fe4f312a5956f725d3e0dbe3ba83a609"},"properties":{"dependency":{"package":"black","version":"26.3.1","advisory":"[GHSA redacted]","aliases":["[CVE 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":"188dbd2aa07bb421d0ef7d0e1e3e477b19f1c8962d55c48f7f979fe2935ec685"},"properties":{"dependency":{"package":"transformers","version":"5.3.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-2290","PYSEC-2026-3929","PYSEC-2026-4174"],"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":"6e2d7a30411758f9ee79a6b104e4b543acfc7d07424578893fef9da2a619d026"},"properties":{"dependency":{"package":"filelock","version":"3.25.2","advisory":"[GHSA redacted]","aliases":["[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]"],"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":"bf88133f66117438064071f8509b0c6e192dca2eab9616c1e75751c9c4a36529"},"properties":{"dependency":{"package":"aiohttp","version":"3.13.3","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]","[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]","PYSEC-2026-2094","PYSEC-2026-2095","PYSEC-2026-2096","PYSEC-2026-2097","PYSEC-2026-2098","PYSEC-2026-2099","PYSEC-2026-2100","PYSEC-2026-2101","PYSEC-2026-2102","PYSEC-2026-2103","PYSEC-2026-2104","PYSEC-2026-2105","PYSEC-2026-2106","PYSEC-2026-2107","PYSEC-2026-2108","PYSEC-2026-2109","PYSEC-2026-2110","PYSEC-2026-2111","PYSEC-2026-2112","PYSEC-2026-2113","PYSEC-2026-237","PYSEC-2026-3545","PYSEC-2026-3546","PYSEC-2026-3547"],"reachability":{"kind":"unknown"}}}},{"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":"baeb3589a7c937ab19fb479775b501d1d8101674b19f505b32ac4a4ea3a16d53"},"properties":{"dependency":{"package":"stdlib","version":"1.26.1","advisory":"GO-2026-4864","aliases":["BIT-golang-2026-111943","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33810","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-46600","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[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]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","GO-2026-4865","GO-2026-4866","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5942","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"production","file":"cmd/ares/agent.go","line":721,"symbol":"http.Redirect"}}}},{"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":"1c9c7154a9d80981a2f1da0fd0aa2e12a4e104a4411624a7aabc5ce2dd45d848"},"properties":{"dependency":{"package":"golang.org/x/crypto","version":"0.55.0","advisory":"GO-2026-5932","aliases":["[CVE redacted]","[CVE redacted]","GO-2026-6354","GO-2026-6355"],"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":"8a01c3be0299d44aa84dea1819b3342ace1fb3b96d2b76b05ea972e4fe7bbb2d"},"properties":{"dependency":{"package":"multidict","version":"6.7.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-4244"],"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":"e6914f63baad0820066b8abe84e552b184e36db67658488c75f6a92d5ffccab3"},"properties":{"dependency":{"package":"idna","version":"3.11","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-215"],"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":"c611d530fbcd6199b10e1cf19aadcf194671bbc739945c6f7f3c39a6050cdd3e"},"properties":{"dependency":{"package":"pytest","version":"9.0.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-1845"],"reachability":{"kind":"unknown"}}}},{"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":"ab91ca968e0bd1071df5629842c2b77b580670fcd3a4bd8484dca31a2c06c99d"},"properties":{"dependency":{"package":"requests","version":"2.32.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-2275"],"reachability":{"kind":"production","file":"services/embedding/app.py","line":12}}}},{"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":"2d1467c43e103fa3c9ae7527b19b1df45133515f3b5340665dd94a76c0b9415d"},"properties":{"dependency":{"package":"setuptools","version":"82.0.1","advisory":"[GHSA redacted]","aliases":["BIT-setuptools-2026-59890","[CVE redacted]","[GHSA redacted]","PYSEC-2026-3447"],"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":"a9fd0ac59a5916681c59c8700a168cc8fed0833c5d0f2515b7fa3f3d505bb53e"},"properties":{"dependency":{"package":"torch","version":"2.10.0","advisory":"PYSEC-2026-139","aliases":["BIT-pytorch-2025-3000","BIT-pytorch-2026-4538","[CVE redacted]","[CVE redacted]","[GHSA redacted]","PYSEC-2025-194"],"reachability":{"kind":"unknown"}}}},{"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":"626a247e91d8889b10ea7d47ed2809f2bf492ae45c9a3b5822141e56eb3aabb3"},"properties":{"dependency":{"package":"pygments","version":"2.19.2","advisory":"PYSEC-2026-2987","aliases":["[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D31","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":"bb755a888c2a4bee0cd5bb501f727769defc649356c71eadd00aa70db5e59e43"}},{"ruleId":"D31","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":"b10a77d05a4cb256300151bde0145e0d49e8cdc0fb48e63929bccf8b14bcf557"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","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":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","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":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","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":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.0:1): \u0060.b-ok\u0060 sets color: #2F9E63 on background-color: #E8F5EE \u2014 3.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/introspect/web/panel.html"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2da58fbfd4080e6628f83a864c4370b517f3612727b3e3a8d166d231adae39f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (4.4:1): \u0060.b-warn\u0060 sets color: #B45309 on background-color: #FBF1E3 \u2014 4.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/introspect/web/panel.html"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb7983ff7e29f7e7ec5d87f65dbcf507e644e47e5fd1e156f24571fe85cb770"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.2:1): \u0060.b-info\u0060 sets color: #3B82F6 on background-color: #EAF1FD \u2014 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/introspect/web/panel.html"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"1224c8485608752513b5dc37e0588fcec366497c31ec619792703674844eb862"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (2.2:1): \u0060.b-off\u0060 sets color: #A8B0AB on background-color: #FBFCFA \u2014 2.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/introspect/web/panel.html"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd03feb84a5d8f4a8607352b23e056f6b45caa73d315f634ed9ad0f9534a243"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.2:1): \u0060.st-READY\u0060 sets color: #3B82F6 on background-color: #EAF1FD \u2014 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/introspect/web/panel.html"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e86df4e6024ecd9dc026d1111d402a076780ef8ebab061c43a389e5a97082b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.0:1): \u0060.st-LEASED,.st-RUNNING\u0060 sets color: #2F9E63 on background-color: #E8F5EE \u2014 3.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/introspect/web/panel.html"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c0145d0331d454a6816af96b852bfc55e960b4ae9c15cd853c9920df3ad224"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (4.4:1): \u0060.st-SUSPENDED\u0060 sets color: #B45309 on background-color: #FBF1E3 \u2014 4.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/introspect/web/panel.html"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"619b77bf003fcf173f29f058f76132059a49d21de5fb55edf41836b22f0e8e58"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (1.9:1): \u0060.st-COMPLETED\u0060 sets color: #A8B0AB on background-color: #EEF0F2 \u2014 1.9:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/introspect/web/panel.html"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc188d60975c8ca24a5da5708a48923b39dfba486a428f9e50d0dd1dbcafc40"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (4.4:1): \u0060.st-PREEMPTED,.st-EXPIRED\u0060 sets color: #B45309 on background-color: #FBF1E3 \u2014 4.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/introspect/web/panel.html"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc732d186af266c23882ce975bdc1c75972e57d21cbf562324e4379f565c0b4"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.7:1): \u0060.co-tag\u0060 sets color: #7A857F on background-color: #FBFCFA \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":"internal/introspect/web/panel.html"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"614494083349dfdb236c5305651f4e04a662268037b3519810473097530022a0"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.8:1): \u0060.tbtn\u0060 sets color: #7A857F on background-color: #FFFFFF \u2014 3.8:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/introspect/web/panel.html"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b5d175c368f1fc351e60bf96d01f95f777eff2987a3b4e36929609ff9ecc8a"}},{"ruleId":"AC7","level":"warning","message":{"text":"Accessibility enforcement below the top rung: No accessibility enforcement found \u2014 no automated accessibility check runs over the HTML your app renders. Assert the accessibility invariants over that HTML in the test suite you already have (parse the output and assert, or drive a browser), and gate that test in CI so a regression blocks the merge. What was searched, so you can tell an absence from a miss: the 1 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository\u0027s test and CI files \u2014 matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d46019b86eff5ddad9db289e6802ac158899e980df54c34f67722442787ead62"}},{"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":"M4","level":"note","message":{"text":"README/code drift: README.md links to \u0060ARCHITECTURE.md\u0060, but \u0060ARCHITECTURE.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85864071a30ab325207b0475304e4f6aa1b79c8e2996b50e4173a6d35a328ea"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: README_CN.md links to \u0060ARCHITECTURE.md\u0060, but \u0060ARCHITECTURE.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README_CN.md"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64c811dd0976221b1ed21be4ed33720e87898f52ee0e87b96dcedb643fce368"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/README.md links to \u0060../ARCHITECTURE.md\u0060, but \u0060ARCHITECTURE.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/README.md"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c98e8bf9a8f4695e4460b390f16c89272f48da11491df290efba816c2fd62f1"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/README.md links to \u0060./reference/framework-comparison-langchain-crewai-agentscope-goagent-zh.md\u0060, but \u0060docs/reference/framework-comparison-langchain-crewai-agentscope-goagent-zh.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/README.md"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"684b108744b18444fb1de40777e459431f32e4017a332b5e4f3b1b011559734c"}},{"ruleId":"P1","level":"warning","message":{"text":"CI formatting step cannot fail: \u0060echo \u0022Code not formatted. Run \u0027goimports -w .\u0027\u0022\u0060 invokes goimports in the mode that REWRITES the files it reformats and exits 0 whatever it changed. The rewrite happens inside the runner\u0027s throwaway checkout and is then discarded, so the step passes on a badly-formatted change exactly as it passes on a clean one \u2014 it enforces nothing, and no other step in this file reads the result. \u0060-l\u0060 is the flag that turns the same invocation into a gate: it leaves the files alone and exits non-zero when anything would have been reformatted."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/ci.yml"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4570533cbe68dfce0ebea0973bfdd9706782e6b4690add71e8f675754a3f92"}},{"ruleId":"P3","level":"note","message":{"text":"Dependabot does not watch github-actions/pip: \u0060.github/dependabot.yml\u0060 schedules updates, but no \u0060package-ecosystem\u0060 entry covers \u0060github-actions\u0060, \u0060pip\u0060, which this tree depends on \u2014 so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entries to the \u0060updates:\u0060 list."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/dependabot.yml"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"9543c45344490268a908fcdf5b07b99fa178c0fb540259785ff4e506b7cdddc9"}},{"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":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!unicode.IsLetter(r) \u0026\u0026 !unicode.IsDigit(r)\u0060 appears character-identically in 2 files \u2014 internal/knowledge/linker/similarity.go, internal/knowledge/pipeline/normalizer.go. 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":"internal/knowledge/linker/similarity.go"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c3bd4b28f35976e79300bf743a2784e054446dafe847dd49e6af2109cdd4cc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cfg.Security.AuthEnabled \u0026\u0026 cfg.Security.JWTSecret != \u0022\u0022\u0060 appears character-identically in 2 files \u2014 cmd/ares/serve.go, cmd/ares/serve_wiring.go. 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":"cmd/ares/serve.go"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"1664e94bad6d4ed23edcb4f795ea3d7565a1f556bcf760542f6a84893f412663"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cfg.Storage.Enabled \u0026\u0026 cfg.Storage.Host != \u0022\u0022\u0060 appears character-identically in 2 files \u2014 cmd/ares/serve_wiring.go, internal/ares_bootstrap/bootstrap_builder.go. 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":"cmd/ares/serve_wiring.go"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"84eeee5c9f5e10e73eae4081ffc04339eea516f7baf40d4dc7ea48a28d1fcce7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cfg.Storage.Enabled \u0026\u0026 cfg.Storage.Type == storageTypePostgres \u0026\u0026 cfg.Storage.Host != \u0022\u0022\u0060 appears character-identically in 2 files \u2014 internal/ares_bootstrap/bootstrap_evolution.go, internal/ares_bootstrap/knowledge_akg.go. 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":"internal/ares_bootstrap/bootstrap_evolution.go"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0dd846c4273a84b1f37420278676f8d304de6df946a10824715469b6f6f392b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.MinScore \u003C 0 || config.MinScore \u003E 1\u0060 appears character-identically in 2 files \u2014 internal/runtime/memory/push/service.go, internal/runtime/memory/report/generator.go. 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":"internal/runtime/memory/push/service.go"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd30e655ceeebf8e7094ceb3b52b00fa49609f88b0cdc909aef24ec876d05467"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060embeddingStr.Valid \u0026\u0026 embeddingStr.String != \u0022\u0022\u0060 appears character-identically in 3 files \u2014 internal/storage/postgres/repositories/experience_repository.go, internal/storage/postgres/repositories/knowledge_repository.go, internal/storage/postgres/repositories/task_result_repository.go. 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":"internal/storage/postgres/repositories/experience_repository.go"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"7309b9a08eb343fbc94ebeaa3322793c51fe2b711a52abb7c204be3eebbfa95a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ev.Type == EventTaskCompleted || ev.Type == EventTaskFailed\u0060 appears character-identically in 2 files \u2014 internal/ares_events/archive_hook.go, internal/ares_events/compactable_store.go. 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":"internal/ares_events/archive_hook.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"29466518e046c2a04f74374da83a5ea570f383c15085400ce502ad67b1a003a7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.Has(fsnotify.Rename) || event.Has(fsnotify.Create)\u0060 appears character-identically in 2 files \u2014 internal/ares_config/store.go, internal/runtime/protocol/mcp/config_watcher.go. 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":"internal/ares_config/store.go"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87a975b3d100eb45644f79de01da9d164988459b741aaaf4f248db72c77fec3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.Has(fsnotify.Write) || event.Has(fsnotify.Create)\u0060 appears character-identically in 2 files \u2014 internal/ares_config/store.go, internal/runtime/protocol/mcp/config_watcher.go. 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":"internal/ares_config/store.go"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"255c15db713e07fb72c4176883f77e7117c001455648fb5ae6e557530528bf1e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060expectedVersion \u003E 0 \u0026\u0026 currentVersion != expectedVersion\u0060 appears character-identically in 2 files \u2014 internal/ares_events/memory_store.go, internal/ares_events/pg_store.go. 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":"internal/ares_events/memory_store.go"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0327e72996d999a0c1b03fd6b79ef44ca224acf72d0045255cafaf2a1436a83"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ext != \u0022.json\u0022 \u0026\u0026 ext != \u0022.yaml\u0022 \u0026\u0026 ext != \u0022.yml\u0022\u0060 appears character-identically in 2 files \u2014 internal/fabric/task/workflow/engine/loader.go, internal/fabric/task/workflow/engine/reloader.go. 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":"internal/fabric/task/workflow/engine/loader.go"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"3928b61dbbb437ee1b55da8bcaf017ed1f4c1c3f8d21354171c54beb170e6dbc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060h.kernel == nil || h.kernel.fabric == nil\u0060 appears character-identically in 2 files \u2014 cmd/ares/agent_routes_interrupts.go, cmd/ares/agent_routes_task_read.go. 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":"cmd/ares/agent_routes_interrupts.go"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e6d77ca1097b678db57015eb9c59bd29c5d723a9e62228544abfa7bd80b8f67"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(p.config.IntentTags) == 0 || intent.Goal == \u0022\u0022\u0060 appears character-identically in 2 files \u2014 internal/knowledge/provider/postgres/provider.go, internal/knowledge/provider/vector/provider.go. 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":"internal/knowledge/provider/postgres/provider.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"f074140b1fd11c8b5d5df2ce9d8e7e4c1b197a71739c69fb31c529fbf7e89622"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(refused) == 0 \u0026\u0026 len(partial) == 0 \u0026\u0026 len(unknown) == 0\u0060 appears character-identically in 2 files \u2014 internal/fabric/task/fabric_lifecycle.go, internal/fabric/task/workflow_plan.go. 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":"internal/fabric/task/fabric_lifecycle.go"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"5edf3eb10fc4457987d31964229d506a415d279572977a78796923165135aec3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060metadataStr.Valid \u0026\u0026 metadataStr.String != \u0022\u0022\u0060 appears character-identically in 2 files \u2014 internal/storage/postgres/repositories/experience_repository.go, internal/storage/postgres/repositories/knowledge_repository.go. 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":"internal/storage/postgres/repositories/experience_repository.go"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e93b3888c65a82760069bdad312aecf0e2c33bfe3abd68287abed845616f21"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060msg.Role == RoleAssistant \u0026\u0026 len(msg.ToolCalls) \u003E 0\u0060 appears character-identically in 2 files \u2014 internal/runtime/memory/context/cleaner.go, internal/runtime/memory/token_budget.go. 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":"internal/runtime/memory/context/cleaner.go"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88ec3665f278f3f0a3ace2bd43f7fc56241b199dbbaf71bc09bd82e267f41cb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060opts.Limit \u003E 0 \u0026\u0026 len(filtered) \u003E opts.Limit\u0060 appears character-identically in 2 files \u2014 internal/ares_events/compactable_store.go, internal/ares_events/memory_store.go. 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":"internal/ares_events/compactable_store.go"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b05c9c7c780edfa4aac7628d367720476f7841e3605346803eeb87a3f32076b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060qualityJSON != \u0022\u0022 \u0026\u0026 qualityJSON != \u0022{}\u0022\u0060 appears character-identically in 2 files \u2014 internal/knowledge/store/postgres/store.go, internal/knowledge/store/sqlite/store.go. 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":"internal/knowledge/store/postgres/store.go"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab64e430990806c63018d63285f0940c79127d0c1deb631d4dc2e6f8e1913fc5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rel == \u0022..\u0022 || strings.HasPrefix(rel, \u0022..\u0022\u002Bstring(filepath.Separator))\u0060 appears character-identically in 4 files \u2014 internal/ares_config/config.go, internal/fabric/task/workflow/engine/loader.go, internal/tools/resources/builtin/file/file_tools.go, internal/tools/resources/builtin/pdf/pdf.go. 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":"internal/ares_config/config.go"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc87fc8cbca0bd2ac8f2f7543b8ca322f5bbac65c1aa877a244915c3a40ef9af"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060resp.StatusCode \u003C 200 || resp.StatusCode \u003E= 300\u0060 appears character-identically in 2 files \u2014 internal/runtime/protocol/mcp/transport_sse.go, internal/tools/resources/builtin/embedding/embedding.go. 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":"internal/runtime/protocol/mcp/transport_sse.go"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5558864dbe5ca3134db2913d772fed0a1eac0ddab72e08fbadf916c510e33d7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.Confident \u0026\u0026 result.NewAvg \u003C result.OldAvg\u0060 appears character-identically in 2 files \u2014 internal/runtime/ares_evolution/regression_gate.go, internal/runtime/evolution/candidate_regression.go. 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":"internal/runtime/ares_evolution/regression_gate.go"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"97390e04641feb07a7362fbd336b0e42775f475eaf7240bf402198c244f23e19"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060strings.HasPrefix(entry.Path, \u0022http://\u0022) || strings.HasPrefix(entry.Path, \u0022https://\u0022)\u0060 appears character-identically in 2 files \u2014 internal/runtime/protocol/skills/catalog.go, internal/runtime/protocol/skills/loader.go. 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":"internal/runtime/protocol/skills/catalog.go"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d55f5b35d18dd6f43f4a3527e578e69a7ee1faabb76443d48ec9c875237201"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060t.State == StateCompleted || t.State == StateFailed\u0060 appears character-identically in 2 files \u2014 internal/fabric/task/fabric.go, internal/fabric/task/restore.go. 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":"internal/fabric/task/fabric.go"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1d689b9262527ce3c881b8caa4c202edc05edef151fa27c1b7b659e7659b25"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tenantID == \u0022\u0022 || len(taskText) \u003C 10 || len(resultText) \u003C 20\u0060 appears character-identically in 3 files \u2014 internal/ares_bootstrap/knowledge_akg.go, internal/ares_bootstrap/provide_distillation.go, sdk/distill_events.go. 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":"internal/ares_bootstrap/knowledge_akg.go"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"8308e690c60657b963ecc3168a522812377bd725ac5cdd81f9969dc181fef1a9"}},{"ruleId":"X2","level":"note","message":{"text":"Not all functions that make a request accept a context.Context: Only 29/30 functions that make a cancellable request (net/http, net.Dial) accept a context.Context or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a cancelled request, a shutdown, an expired deadline. Take \u0060ctx context.Context\u0060 as the first parameter and build the request with it (\u0060http.NewRequestWithContext\u0060, \u0060DialContext\u0060); where nothing could ever cancel the call, omitting it is a deliberate choice \u2014 judge against how the function is used."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"faab330444baf00d50193f250b5c9b514f84cdca16c24014ef3776329847910c"}},{"ruleId":"X2","level":"warning","message":{"text":"Function without context.Context: validateRemote: \u0060validateRemote\u0060 calls \u0060http.NewRequestWithContext(\u2026)\u0060 but takes no context.Context and reaches none its caller controls, so its caller cannot cancel the request once it has started. Take \u0060ctx context.Context\u0060 as the first parameter and build the request with it: \u0060http.NewRequestWithContext(ctx, \u2026)\u0060, \u0060(\u0026net.Dialer{}).DialContext(ctx, \u2026)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/ares/serve_arena.go"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd2424492815b935f730afc8e1d9441ae1237f9655c2daa133bb11772f05818"}},{"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":"services/embedding/app.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3ec0c9dd11e82ea0291ceba181a1db079305fd487cecb591fcec71ab2c5544"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/tools/resources/builtin/text/log_analyzer.go"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"997c60e2dc53db5bdeb1efebaa89ae605b7ddfbdcb52aa7e0501c1787543725b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/tools/resources/builtin/memory/memory_tools.go"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"232fab99ed29fc2b3e6d12badcdb14df7a71bb9c22c9cf8e776147dc15fd92f6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/tools/resources/builtin/file/file_tools.go"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"24da14a9e9a750488abd00fc94fbacd5e4918d7a4caf96036103cef40dbedeb1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/tools/planner/resolver.go"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"57fa0d5dcb3564b5690fbadb4693939b2f49a83d6d897317b061635468763ee0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := rows.Scan(\u0026sessionID); err != nil\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":"internal/storage/postgres/repositories/conversation_repository.go"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb6a79f7d01de4e3e517eaa1eaa7a4ca26bb820e707c3bcd0158fbfad6071d9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := rows.Scan(\u0026expType, \u0026count); err != nil\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":"internal/storage/postgres/repositories/experience_repository.go"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ac5b5978d9b676410a75cf8a0dce6ee1492b7671fc7986bc5ba4074c2913f9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := rows.Scan(\u0026e.ID, \u0026e.TenantID, \u0026e.Key, \u0026encrypted, \u0026e.KeyVersion, \u0026e.Algorithm, \u0026expiresAt, \u0026metadataStr, \u0026e.CreatedAt); err != nil\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":"internal/storage/postgres/repositories/secret_repository.go"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c304f5849efd575d4f27f40fba1b42f2f2fee82a1bf446a96da3350bafd994e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/storage/postgres/repositories/secret_repository.go"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa96024fea97feb5232a9d7afc06be4f804c35475f44e35e7301b78ba6691bf9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(outputJSON, \u0026result.Output); err != nil\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":"internal/storage/postgres/repositories/task_result_repository.go"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"79bca7b242fb7eff13d64d03ceb2ed9311accc6b4a3df646501a46ccd83acf10"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := rows.Scan(\u0026taskType, \u0026status, \u0026count); err != nil\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":"internal/storage/postgres/repositories/task_result_repository.go"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ec368f85931e1b64a0baedb702fbcd897b3a45d1c692ee61d644e774ffc00f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal([]byte(cached), \u0026embedding); err != nil\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":"internal/storage/postgres/embedding/fallback.go"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ef3956ae33e2ea5adec151629fa6a0299f7f1f04b8973025435feb6deb0250"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/runtime/protocol/skills/catalog.go"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"733f21de5742d772a11b97d976223a537006b7c318ed774b5a97f29d2408c656"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/runtime/protocol/skills/config.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"268439b1cfab8a520cd812ac4b6c3dc171891180e62e19d8e954c13cf9f73f7f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/runtime/protocol/skills/config.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd6468a61f434d16a0fb61ce827a938028a9f514fb143b755fe46648541fd11"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if refsErr != nil\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":"internal/runtime/protocol/skills/tools.go"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b816367c40c906db86b0d7f72d9bf73ba640971eba541c3f3139df829cc8dd2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/runtime/protocol/skills/tools.go"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"404622303e20a228096f0f26f97b16c8f614fc1825faecc6f485f92a6c045896"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/runtime/protocol/skills/tools.go"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"29bfedb05de6b6bda04f45a44b31d993fdf9d0a435d52a14b9545f552b1d7c39"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/runtime/protocol/mcp/transport_server.go"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"017a0431f103b4b972772ce612cfe02208947c4d7399206839c87cfb3797dee1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal([]byte(data), \u0026msg); err != nil\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":"internal/runtime/protocol/mcp/transport_sse.go"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bfbb34a2fd281f83c01470f42ea005b8bfd27c4d6f6aee66e3609cdc58e7a99"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal([]byte(data), \u0026msg); err != nil\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":"internal/runtime/protocol/mcp/transport_sse.go"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3af75687d021973cfe7567dfb0549aff337b7cf0bb97c4ad4b86119e97ce7a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/runtime/protocol/mcp/transport_sse.go"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"757dab92615552cba1c38a588a3de9cc9ed45bd2dced80548a5437ff5bf20461"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/runtime/protocol/mcp/transport_sse.go"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9381f76ef3d864032fc086a562b4d0859b4e78e87662e3c436ba4263e82efe"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/runtime/protocol/ahp/message.go"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"07010d820ed17bc52efd793348236e50198961b0ec9226ec5e343b435042d255"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/runtime/observability/flight/collector.go"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d2e6b766df43ac292b59f5537af2247c8090eee0ec86e2251dbf68dbcba240"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := ctx.Err(); err != nil\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":"internal/runtime/memory/pipeline.go"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad28c171738af0df4210a72ddd432380dfbf01f518a5da72ee3ddb3eab0ddc6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := ctx.Err(); err != nil\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":"internal/runtime/memory/push/service.go"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc85b1320cbcd3718fa6b57a547e9f52e337d50ec6626b2b5d9ef9f0a634c86"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := ctx.Err(); err != nil\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":"internal/runtime/memory/push/service.go"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"87460992910033a2ca7883eab2c51621028b6fca215adb17b3efe26c97469bfa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := strconv.ParseUint(rest[i\u002B1:], 10, 64); err != nil\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":"internal/runtime/memory/context/artifact.go"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b19ee5925587f8ba2b2c730cc4cc01ff79f32f2d4cdb10d2d66b7f633f87f0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal([]byte(argsJSON), \u0026args); err != nil\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":"internal/runtime/memory/context/cleaner.go"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"485b49a49376b912203ca670761a83773b83abb036d3eac212c5069c015f378e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(ev.Payload, \u0026fe); err != nil\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":"internal/runtime/evolution/genome/fitness.go"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"531099324e7fd870008f3a24eda723c76cc64b4f2f3b1067d96ed61d1c1673f7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/runtime/evolution/genome/knowledge_genome.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc56cb6f6ca055377bbee841257e250b487084d00e0bd8e752c45ffd8a0e139"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/runtime/evolution/genome/memory_genome.go"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"be47bda3f331b898080dbb9fd770a43d71bcda81353a0db440c6a533d75b0bab"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/runtime/evolution/genome/recovery_genome.go"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c61b3812939136c9b294665247871b55a95d60b5a48840737459822df1dafa8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/runtime/evolution/genome/workflow_genome.go"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5afa3e5b35640a75ee3a86c89bb4cda3148d9fde0a95d3eaf5c294ec4b568e6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := g.dag.RemoveEdge(context.Background(), target.ID, s.ID); err != nil\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":"internal/runtime/evolution/genome/workflow_genome.go"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"2023474d4e9d6b76ac1a95b62d70011946baa3b57cf72e0ae6ac9956a973ac48"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/runtime/eval/ground_truth.go"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb02140ee7a40a4abd70d2f4e2c55b1da26b4ec44417b99268e071b8d917e0f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(ev.Payload, \u0026fe); err != nil\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":"internal/runtime/ares_evolution/fitness_aggregator.go"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ebfc2c82909b88af4340011067f3910f32ab0878627a64a3ef446ca0122607"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/runtime/ares_evolution/gate_eval.go"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c22a746d0286a64c42292bdf8da688e83383ff70d89b43e56c9a3736141bb8e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/runtime/ares_evolution/genome_wiring_idle.go"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba600c9b0f07954e9818a41a16415606303a9cc0fc22bf45254f25086e8c428"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/runtime/ares_evolution/genome_wiring_idle.go"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd5ed734e627050020bb18ba9c91e4ac40d9047163f685f6ef120fbdffeab6f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/runtime/ares_evolution/genome_wiring_run.go"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"28673ca4053a984cfe0b4a8baf493d37a2982dc4bbd4bb2900de7fcd6d71fdb8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/runtime/ares_evolution/lifecycle_evidence.go"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc9ff0b2f55b1e2500eb890f410f8b01116a7fa78a671f045110395d324ec8a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/runtime/ares_evolution/observer.go"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"76725aa55ca42b600cce3aeb2b8004d158ce5a6b4f2b5863f834dc125adef457"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/runtime/ares_evolution/observer.go"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf0a8186b6379fd408a5aceb08926187dc9bca3b5c9f9a5c55432a8f7715b06"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/runtime/ares_evolution/observer.go"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b70824fb142a4fed9cb7e5a05e08852d87b13ac1395ebb93358e2d6e0d78cf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/runtime/ares_evolution/replay_scorer.go"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2e65137d464253e9be78d0ab7570f7eda4462b0486ff3236f0dc9e6be96196"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(ev.Payload, \u0026fe); err != nil\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":"internal/runtime/ares_evolution/replay_scorer.go"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"e222419766ffea8f97f5155aea8e7f80dfcc92b953ac66d0441ae4fcec4a63ae"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/runtime/ares_evolution/service/llm_scorer.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"995ca7de4d46405688079586e482246e5fce874b663706a51c8fb9840d18045f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/runtime/ares_evolution/experience/normalizer.go"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"578ed9fa916dd5b161511409ed483180a38c1845746e206e3050e598a07ad4f3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/runtime/ares_evolution/experience/normalizer.go"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf760846949e372f6c4e951f5abf13da32cc59d45d81d9d2314e1bfb4122f7a9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/runtime/ares_evolution/experience/normalizer.go"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"4154bcd5f2d88da35edf940f7ef2f2c0fcedf8cac78805efd75064b072d47502"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := runCtx.Err(); err != nil\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":"internal/runtime/arena/regression.go"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"302a8156c8f92299c2bffec13a1773bf2f1666e3e8234f602d2c71c672195696"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(data, \u0026cfg); err != nil\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":"internal/mcpclient/mcp.go"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c866d49775a24c0698316dc6260a0648145b489fe249f466cb79535f41cb48e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(raw, \u0026env); err != nil\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":"internal/mcpclient/stdio.go"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c529a80bb0cc51b95a0dce508eb6f40a22b10e7ac3bdd8617bc21db8452c8db"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(id, \u0026requestedID); err != nil\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":"internal/mcpclient/stdio.go"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f57374e596fc36d7b0f10d4b27664585f9da68b2538d77ddc436a85975824b7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := rand.Read(buf[:]); err != nil\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":"internal/llm/resilience.go"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"64aace6ece8358a70702ffbe866dd922680a1f1941976c777b0b68a8db434909"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if pErr != nil\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":"internal/knowledge/runtime/runtime.go"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a587fa4aa76ea300651f91af15b0e8bc7e3208f17ea262ad8473ad36a041e5e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/knowledge/retriever/eval.go"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"59aec29fc2169f8286f60021b36f188135f119ddabc2f9d9d5a277e82e9b6f35"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/knowledge/retriever/tiers.go"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"6075318840e653d420486e952e0aa16d548271044fa4f3efb1a9c0bfc0b4588a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if rErr != nil\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":"internal/knowledge/provider/code/provider.go"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c6d349db69eb6893974ff2c332ad5b998e6f206ac762ffe9d1ed3858a80271"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/knowledge/planner/default.go"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1bf440e828dd8fc9f50dfca3ee304fbd466842381b0a68bdfdd9399fd247e4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(ev.Payload, \u0026payload); err != nil\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":"internal/knowledge/adapter/evolution.go"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea081472000d1a69070753b5d7a0358d715e50483856b6dc0627e2a1a53758da"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/kernel/executor_registry.go"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f3433ab2bfbccc8e1582ac702570d3b8cc13b5f530466bc49b52e1dacbcb11"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/kernel/executor_registry.go"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"002baf00932be2e45b3602bdd29faf136de7bef752fdef5a762c2d30d5335fc8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/kernel/executor_registry.go"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"656de680a849b50e9a8f9133eee81059b21b45ab528cf32dd34316fb42461d0b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/kernel/fabric_executor.go"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ba054d2cb91e9360e218a6d1917b201db77c54d856dde47aa0b95c88426ae4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/kernel/scheduler_dispatch.go"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d5736bb4595e3f33a12615926d15c4ed5482b5f70a374a80214878a02940b5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/kernel/scheduler_dispatch.go"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"d198fa9782ce35754d00e995193b60da916c6f9bc9d6d40ae29a92f7f2f11a87"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if tkErr != nil\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":"internal/kernel/scheduler_recovery.go"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"5910e79b0fe300e6880db9e850e195ddde01299e41bde30c383533ec72907b81"}},{"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":"internal/fabric/task/checkpoint_observer.go"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53b383e706f5403de30e3d9e4483032240e21102a4e8f6ba6de533a99ff0a5c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/fabric/task/checkpoint_schema.go"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b30feb098b8574d0c319a6625d14dbd122e2b4507811529ded27161c08ed0d7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/fabric/task/checkpoint_schema.go"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6210575315d9211a509dcb29db5dc7e1a9c1c150f8063c29480b4d61a588b05"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/fabric/task/checkpoint_schema.go"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc1d08bdf2b52531aa6406bccee7fc6240a08749f3ed643ae8237323774c173"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/fabric/task/checkpoint_schema.go"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ccffb755068a7b8d510c49e61ed5fc77523d6f7ba27020342317e924c3a5b1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := t.transition(StateFailed); err != nil\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":"internal/fabric/task/dag.go"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0ac2b99733ae25943f671fe0412d0e59e8b14b2c1faa26a53dcbc9dfbcd96b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := t.transition(StateReady); err != nil\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":"internal/fabric/task/fabric_lifecycle.go"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"6935749a71e1ff253382b73b76f300bded1ee35e3ffa86c704481b904d44efcc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/fabric/task/plan_loop.go"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14f182b2bcda91118ad8e7fc2cd96f0febde9ffdf9cfd377fc39e7abddf8ac0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/fabric/task/reaper.go"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"7035236c73187ceb73117aec7b3b0851937e8f7137cfbe878fdc4712e8e76a68"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/fabric/task/workflow/engine/reloader.go"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89a825c42f7b49e39a2d931a436c84bec1524330e2ca4008641ca7a200b190f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := w.watcher.Add(path); err != nil\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":"internal/fabric/task/workflow/engine/reloader.go"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3043010bdde4ff2c64d3858e546fde2735be1e266af36e8e71dc36145819a6f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := w.scanAndLoad(w.stopCtx, dir); err != nil\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":"internal/fabric/task/workflow/engine/reloader.go"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"1814e7ace82047c72654e2b6041eb79d0db2dc6565e585987536d40a0fbe9c87"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/fabric/planprojection/projection.go"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc31f26cc9f80d672ff698981155aff4b66bae1a883157c1e227021e8d52c924"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/fabric/agent/planner_context.go"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"2222521e2fd55e1a5fb948c88fd33936901a92ac2c6b609c41d38b23af022caa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal([]byte(call.Function.Arguments), \u0026args); err != nil\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":"internal/fabric/agent/planner_need_tools.go"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2e4490d49d9e72001abaf820ce903760bdef99a3d74f52dc07eca1a8a482e1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal([]byte(tc.Function.Arguments), \u0026args); err != nil\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":"internal/fabric/agent/planner_rationale.go"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5328151e24e59f7771b868998fe08b7219054bdf08e8bc926622f0222c55f8d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal([]byte(s), \u0026names); err != nil\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":"internal/fabric/agent/planner_tagger.go"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"28083fdfb7ecf80b03e88dd089f9439ad7abb22f5663b17a8d2ab8a6ef14bb83"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/discovery/health.go"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f4d20c6faaeae8cd99a85f5a2acbc0b576b7b1f7f241b692d3a142e0ccd099"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/discovery/health.go"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d24d526073434798fbba07967cb089a2212750e3697baa458006a8f387e9f7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/discovery/health.go"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0a37d624c454ba82bf6dcd48d333a91087e8f8eccbb10c011a2787edd1fdbb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/discovery/providers/binary.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba86c0a4c32d8af8083ff6b247d9ab63e937dee59ff886a95f36801c5f1e541"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := cmd.Run(); err != nil\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":"internal/discovery/providers/binary.go"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7b977204890aab44fac278103413cdcece2bec4a21b9303dcd05800514399e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/aresrecovery/recovery.go"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2536d252b7fe559e08e7c93da22c3dc9f29d793274bfa10c0dd699d95396bfd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/aresrecovery/sandbox.go"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ba04d54564a1a04eec8d01a4c136aa2b0d2e4ffe8ebb89c4f91d69b5d71877"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/ares_security/audit.go"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"873a62606850ff73706233759b92090f4f1f7baed10866c0fe0b3627704a3589"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal([]byte(argsJSON), \u0026m); err != nil\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":"internal/ares_events/tool_events.go"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"11fe036d5420820806bb90bab2953181d2f1634e35b5aafe3c18321b76d851f1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/ares_bootstrap/bootstrap_fitness.go"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2f0c8d5f91e29d7e0d506e8cb5212b9c38f75ee1cbf8e7c38ea74c8261495a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal(ev.Payload, \u0026fe); err != nil\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":"internal/ares_bootstrap/bootstrap_fitness.go"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"128e413de70cea18fab5ac12349a23f24088f8c0cad91dabfa0be09267c31040"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal([]byte(raw), \u0026env); err != nil\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":"internal/ares_bootstrap/observation_recorder.go"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"1415ebd14f3dacec10fbcb207debd51d47a4403834671fdb9222881aaa64663c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/ares_bootstrap/observation_recorder.go"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"79cb9d7075f2b35b1351d1e251936fbed93a1b53845cb84f8f559653f49e3c56"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/agentruntime/await.go"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"41837627aa77e624b69d459e3609f18fa7e94b8b85859d987f897694a76b007e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/agentruntime/session.go"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4b19d5009eefdf03371a52aec6bf7bfc9bb6736ca602467f80d500b41b29e0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, taskErr := s.Fabric.Task(step.ID); taskErr != nil\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":"internal/agentruntime/session.go"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"348a239dc812fd89eec4e6fd7ed2bc3063e15ff5d45c949b909b7e500e8f2b0b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"internal/agentruntime/session.go"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"3adb28ae6f3ef41d9941b4ec2df443350df3a3f7956d95481cfa71db15300104"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"cmd/ares/agent.go"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"77cb31cc573ec0f5917a326591d0d9bff978f770885a5dbda01340d5ceafaf3d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"cmd/ares/agent_routes_task_read.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7cfe77aa94eda498b557e6b9e5dcc06ef7e4904d1d176d2601a2f100fb1566f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"cmd/ares/agent_routes_tasks.go"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"82cf999b33e137fbd72d8470069742af05056a1e677a9c23a5408d3f11b311e4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"cmd/ares/agent_routes_tasks.go"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80780f82696f8b9b295fb081d9d1f44c9dd032ac503b3055680e856b7c7d4d1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"cmd/ares/db.go"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"33adb96cd0ef05bdda638850ae973f53df2dc348bfe0e8cf8ba7554509cb81cd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"cmd/ares/evolution.go"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b9bf51de44d3d6c5bd244ffc41ed75f528c8606451446ef89034a557858ff59"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if fErr != nil\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":"cmd/ares/evolution.go"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd43800f793a080033309f9b58f5e46c8f37e2a75c099f938a7486c17f44b478"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if sErr != nil\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":"cmd/ares/evolution.go"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c47d06b84991f0135b1843103c96531a8b40d57f622985ede8489e53f76ae81"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if dErr != nil\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":"cmd/ares/evolution.go"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b97f34274c819cd54a585eb50e911b54c3e8ccac4de0a462b45f544fbd0be91"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"cmd/ares/evolution_experiments.go"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9932c6aac1fd6155cea2a12de306ac2a0c1e019b5f12525166d4060aa2abc1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"cmd/ares/flight.go"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"3802ff1bde838e9ba999e9d8d03fb56e2cb5d7a5505fd9f4be68a8bbc035c230"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"cmd/ares/main.go"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d5590af68454a1780312fdef5b9fd107153568b079fcf97c5abfe4d2184ab0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"cmd/ares/serve.go"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5c11a3a856b189e8ba9a519f4fbe2ee1cd790889de7726a2034c257e02c714"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"cmd/ares/serve.go"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa1021e27fac9225419e794cef69688878bd7be9f9e0c818c326bdd05bb9ac1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"cmd/ares/serve_arena.go"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ea590e1f681cb338730a9e029e7d1883de7d6012ae08ac3cc2c07cc1f127f4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"cmd/ares/serve_arena.go"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"caeab0d40c760ed89a18235a1d5c6f4b25c959e2737f7479efe784a99e4309ff"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"cmd/ares/serve_arena.go"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e65cb2b9256827271d272dc8cefb1b42e3f3fc5e7649dc05170c02f9746224d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.NewDecoder(resp.Body).Decode(\u0026result); err != nil\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":"cmd/ares/serve_arena.go"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"0adef08b9ac38f8259fe42c0885f87966b8ada249f1c47ec1e4298955c3f4d9d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"cmd/ares/serve_chaos_domain.go"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c4d9f9ae99e8857e8405d08695c1647402559e7e0f34403010abcc7a3e8bc0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := os.Stat(candidate); err != nil\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":"cmd/ares/status.go"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d58e33ad9e6c1d6570c09ee2d4bead96a9e914f83960b1aca65ffa5ae3efd18"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 155 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"services/embedding/app.py"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca444008c78ad070d1a76a9d2ae46b01657a3e9c6acc0824c53de775ef518899"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 163 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"services/embedding/app.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d43f8e532d2cb6756dc1369eb94afbf9547b672c11b3c4af61044a999ba09f3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 172 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"services/embedding/app.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2465eee0c17c140ecbea2f36bdce67cd016758b74923362304098a4bb857a8c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error\u0060 at line 177 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.error(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.error(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"services/embedding/app.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9f0cb13ffd311792b851fb0d94155002504063306f6693b1d2b928d0126a83"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 235 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"services/embedding/app.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"74954b01fb1b9da82286af718e3cf52d7a48586f4180f1db8a0dcd4bf11af8c4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 263 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"services/embedding/app.py"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cfec4828137784f0a56a6e05b2432e201c3610be1914a5a32908635bacdd34f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 314 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"services/embedding/app.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"54cda2a58c68d163cc5d2c69b92c66edfc161a1541576d70fd0bb5da7f8a469a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 343 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"services/embedding/app.py"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"31468fbb4d8cfc60e73e2343f405dd41dfe828143d24e266760455aabbe11b5a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 429 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"services/embedding/app.py"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d34131d9cb5d8657b1ea0705de3a3981d4f28d38cbf32189f8ed8320afa9734"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060collabNodeOutput\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/ares/agent_routes_tasks.go"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"73757a2f9bea9f7078d24dcaaaf6e008517e3103013216f16061d2dfa97324ab"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060findAresRoot\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/ares/main.go"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c3f64f4b85147e8bda68e3c680be5d842fdbee542530b340745a6367790f2c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060portOf\u0060 turns a non-nil \u0060err\u0060 into \u0060return 0\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/ares/serve.go"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91470de138e68df4b51a16dab452b9572f1ca6167aa0191860a9b0e3474cbb7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060PendingProjections\u0060 turns a non-nil \u0060err\u0060 into \u0060return 0\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agentruntime/session.go"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d21f831702161a18eccc8e41017a777d7312fa4513735bfebb383d8d80d456"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060ToolArgShape\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/ares_events/tool_events.go"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"691dd61476702dada5fb6b950fb092b7293bfef98028788f27937fcfb46fe8a6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060taskState\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/aresrecovery/sandbox.go"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"09eaed53e9cdfcec903410274faadfc8bd89fd165d026b45ccff238760dc1244"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060renderExperiencePrior\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/agent/planner_context.go"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f19322cc85c5c8729b077bdc7006ce1c113e3b87541f56118a1cc20970742b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060rationaleFromToolCalls\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/agent/planner_rationale.go"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"84aae53ca76035e22a5c8bbfab99f5b18e5f9b4c7d255dbf8e7a255ddc052263"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060parsePriority\u0060 turns a non-nil \u0060err\u0060 into \u0060return 0\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/planprojection/projection.go"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d4b0807aa86e1f9c380700439b145586f92050e09f65e2a2bc265a1d85c4f8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060tokenUsageFromCheckpoint\u0060 turns a non-nil \u0060err\u0060 into \u0060return 0, 0\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/task/checkpoint_schema.go"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec3f21d684e24acbc7c3184ad6f7c585f862cb25d1cb857f8b184c363fc930e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060stepCheckpointMetadata\u0060 turns a non-nil \u0060err\u0060 into \u0060return 0, 0, nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fabric/task/checkpoint_schema.go"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87b47a2eb6a5e2bf5e824d484d3d1aa846542bda94460fd2adc5090835ad023"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060rawBaseline\u0060 turns a non-nil \u0060err\u0060 into \u0060return 0, 0, 0\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/knowledge/retriever/eval.go"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"428eaf7341eed20b2c2a76a86d120cf399fc0ecd5ab92e689c61eee8ca0623ce"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060secureRandomFloat\u0060 turns a non-nil \u0060err\u0060 into \u0060return 0.5\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/llm/resilience.go"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c7e33d9b77d5cab9f4df21eb12c06bdccf9edd5706badb51a7c9c66111ec9f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060querySourceMeanScopedAt\u0060 turns a non-nil \u0060err\u0060 into \u0060return 0, 0, time.Time{}, 0\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/fitness_aggregator.go"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2d79faff151770e4abe4cb23b065e2c5ec9e4de676d30aa0548959f5484863"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060Fitness\u0060 turns a non-nil \u0060err\u0060 into \u0060return 0.5, nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/evolution/genome/knowledge_genome.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a576828f5f51e5eddac9d16d94326886b33575ff5a1c997a9a584901115a70"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060Fitness\u0060 turns a non-nil \u0060err\u0060 into \u0060return 0.5, nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/evolution/genome/memory_genome.go"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f16f29cafb795bcd13a93cb08671f62f41e7d7c7164f467f6412d16a5f3ea7c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060Fitness\u0060 turns a non-nil \u0060err\u0060 into \u0060return 0.5, nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/evolution/genome/recovery_genome.go"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92d680fd3b8ba0b7e4e48c160b5318dc9ae94a0dfc2b4f56f029d1ab465623a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060Fitness\u0060 turns a non-nil \u0060err\u0060 into \u0060return 0.5, nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/evolution/genome/workflow_genome.go"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f48646d8be3bf6c9d6614acba3aef2541a8d1727e6e2a8f8eb1241f561c35db"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060DefaultConfigPath\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/protocol/skills/config.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b72ca715b95f57ed986d087299a8be6a00787d7581ca8cbf41ee6631a04f68c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060l2PlanTokenUsage\u0060 turns a non-nil \u0060err\u0060 into \u0060return TokenUsage{}\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/l2_submit.go"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"155dbf0d13dc7bb776ddc02be4f94898c77bf53306645fa964437ef61366b4c7"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060strings.Contains(prompt, \u0022EACH numbered task\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060strings.Contains(prompt, \u0022EACH numbered task\u0022)\u0060 also satisfies \u0060strings.Contains(prompt, \u0022numbered task\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/runtime/ares_evolution/service/llm_arena_scorer_test.go"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32b020672ff8a1eff6458720c816ba43182a23fbabf0a45611600df2052f04a"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060strings.Contains(lower, \u0022function\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060strings.Contains(lower, \u0022function\u0022)\u0060 also satisfies \u0060strings.Contains(lower, \u0022func\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/_fixtures/eval/main.go"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a779618a66d389eff9db24d2364dd10226ad2a50560dad79e1cb318257507a"}}],"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-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.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-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.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-328","guid":"f0ffc869-97c3-dc5c-8825-be1159f1fc5f","name":"Reversible One-Way Hash","shortDescription":{"text":"Reversible One-Way Hash"},"helpUri":"https://cwe.mitre.org/data/definitions/328.html"},{"id":"CWE-338","guid":"e89b7604-c3f7-8b53-bc8c-4d4718c28617","name":"Use of Cryptographically Weak Pseudo-Random Number Generator(PRNG)","shortDescription":{"text":"Use of Cryptographically Weak Pseudo-Random Number Generator(PRNG)"},"helpUri":"https://cwe.mitre.org/data/definitions/338.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-391","guid":"d9ef5687-8d79-9b51-b509-b83411fbcdc3","name":"Unchecked Error Condition","shortDescription":{"text":"Unchecked Error Condition"},"helpUri":"https://cwe.mitre.org/data/definitions/391.html"},{"id":"CWE-400","guid":"ca529a89-676d-8857-aac1-84359c77bb6c","name":"CWE-400","shortDescription":{"text":"CWE-400"},"helpUri":"https://cwe.mitre.org/data/definitions/400.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-502","guid":"f7d3b296-aac0-5c5a-b706-e07faba26c36","name":"Deserialization of Untrusted Data","shortDescription":{"text":"Deserialization of Untrusted Data"},"helpUri":"https://cwe.mitre.org/data/definitions/502.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-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-665","guid":"fe279ff9-a979-f952-9df9-3f7d05af85d8","name":"CWE-665","shortDescription":{"text":"CWE-665"},"helpUri":"https://cwe.mitre.org/data/definitions/665.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.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-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.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-908","guid":"ca1da1d1-5eaf-e95b-adbb-4eb2bc10b9fc","name":"CWE-908","shortDescription":{"text":"CWE-908"},"helpUri":"https://cwe.mitre.org/data/definitions/908.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"},{"id":"CWE-942","guid":"a5e9f9ae-e5c1-215b-b5ef-9b85aa6b4828","name":"Permissive Cross-domain Policy with Untrusted Domains","shortDescription":{"text":"Permissive Cross-domain Policy with Untrusted Domains"},"helpUri":"https://cwe.mitre.org/data/definitions/942.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":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"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":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_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":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"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/"},{"id":"A10:2025","guid":"9ca3ab55-ca61-fd5e-b9ab-3dad2efa59d0","name":"Mishandling of Exceptional Conditions","shortDescription":{"text":"Mishandling of Exceptional Conditions"},"helpUri":"https://top10.owasp.org/2025/A10_2025-Mishandling_of_Exceptional_Conditions/"}]},{"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-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"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":93,"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."]}]}