{"$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":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"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":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"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":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"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":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"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":"P8","name":"Schema migrations","shortDescription":{"text":"Schema migrations"},"helpUri":"https://codehealth.canine.dev/dimensions/P8"},{"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":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"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":"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":"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":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"engine.lintSection (cyclomatic 98): engine.lintSection has cyclomatic complexity 98 (threshold 15). Of this number, 81 points are the body\u0027s own statements and 17 belong to 5 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/engine/lint.go"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"844a7f9f5067edbc6dd50192530440ed57829c530fff87e3f91c551e59388613"}},{"ruleId":"D1","level":"warning","message":{"text":"analysis.Calc (cyclomatic 73): analysis.Calc has cyclomatic complexity 73 (threshold 15). Of this number, 72 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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/analysis/numbers.go"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"d810a8e291c41faa1ae7720dfd6b57bd0289c976631f518e6bea13784cd24486"}},{"ruleId":"D1","level":"warning","message":{"text":"Runtime.Run (cyclomatic 69): Runtime.Run has cyclomatic complexity 69 (threshold 15). Of this number, 65 points are the body\u0027s own statements and 4 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/agent/loop.go"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"afebf4b6d8a2705981b3de832fc436276a4d530ca2477e8f200b1ec122c3d07f"}},{"ruleId":"D1","level":"warning","message":{"text":"figtest.oracleLabel (cyclomatic 65): figtest.oracleLabel has cyclomatic complexity 65 (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/engine/figtest/reader.go"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc88d69901e460f01f0b1b3e19c67302dda88e13a3eb3607fdb576c6387e7fa1"}},{"ruleId":"D1","level":"warning","message":{"text":"analysis.check (cyclomatic 63): analysis.check has cyclomatic complexity 63 (threshold 15). Of this number, 62 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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/analysis/figread.go"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"36fc5a69d551589ba7e81c8406e87149bfed8eaa36c5629c6d14e473c42aee6a"}},{"ruleId":"D1","level":"warning","message":{"text":"finish.check (cyclomatic 63): finish.check has cyclomatic complexity 63 (threshold 15). Of this number, 62 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/engine/finish.go"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"4972fa0637af01003fb27ba88db8e863f580de412cefb82ea026278e150148e9"}},{"ruleId":"D1","level":"warning","message":{"text":"score.score_run (cyclomatic 56): score.score_run has cyclomatic complexity 56 (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":"eval/proofrun/score.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5940172981af221ebb7f67da5b33c199098f2bbd6e3ab7327996394c570dd4f"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine.validate (cyclomatic 55): Engine.validate has cyclomatic complexity 55 (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/engine/manage_validate.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd91c33b05e6128da504de653ce8b275b7bb0a63a05329a17fe0275e2f39e4e3"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine.admit (cyclomatic 49): Engine.admit has cyclomatic complexity 49 (threshold 15). Of this number, 45 points are the body\u0027s own statements and 4 belong to 3 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/engine/register.go"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf1ccc966099ae78ebbdfb01e5fe3554291f5a71df9193bcd32ebb32f911ccb"}},{"ruleId":"D1","level":"warning","message":{"text":"main.run (cyclomatic 46): main.run has cyclomatic complexity 46 (threshold 15). Of this number, 45 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/biglaw/main.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b26b0d2999679dd90feb6507717a315f5f6c677fe4ebbee350f8ec924025651"}},{"ruleId":"D1","level":"warning","message":{"text":"Service.readScans (cyclomatic 46): Service.readScans has cyclomatic complexity 46 (threshold 15). Of this number, 45 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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/docs/vision.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24af8f79a9aacdc83470ee00ae1c31f1f6c1d27069289a48b8a57b54110a36c"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine.coverTool (cyclomatic 46): Engine.coverTool has cyclomatic complexity 46 (threshold 15). Most of this is not in the body itself: 1 of the 46 points is its own statement and the rest belongs to one function literal inside it that branches (line 125). 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/engine/cover.go"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"fabedfa6f0821f49c7e3584183b7a3378a190fc5c0abfff80e004f275e6470fc"}},{"ruleId":"D1","level":"warning","message":{"text":"hooked.Call (cyclomatic 45): hooked.Call has cyclomatic complexity 45 (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/engine/register.go"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9852cc63604e1039a32b1c00c07ddc14a44e7bfa7eb7de82786c78c62f4321"}},{"ruleId":"D1","level":"warning","message":{"text":"engine.g8In (cyclomatic 44): engine.g8In has cyclomatic complexity 44 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 9 belong to 4 function literals inside it that branch. 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/engine/lint.go"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"505e1dcc6f605eb2b3228f7654a08c86c23e70ed7b365f63831019d1e4615dcd"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine.sweepTool (cyclomatic 44): Engine.sweepTool has cyclomatic complexity 44 (threshold 15). Most of this is not in the body itself: 1 of the 44 points is its own statement and the rest belongs to one function literal inside it that branches (line 378). 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/engine/sweep.go"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a4e4683f112dbaf80b7f465a4de625fe4df1b43226862c05c7030554755ae1"}},{"ruleId":"D1","level":"warning","message":{"text":"Task.TaskScreen (cyclomatic 44): Task.TaskScreen has cyclomatic complexity 44 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 19 belong to 9 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":"ui/src/screens/Task.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"230e1c8998fc63a79b35da85746c7fc9ae0264eb9fa73de63d5d92cf4db9c5c3"}},{"ruleId":"D1","level":"warning","message":{"text":"engine.valueStated (cyclomatic 43): engine.valueStated has cyclomatic complexity 43 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. 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/engine/figures.go"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab37395cfe2d40dbb7b414585a746f0e834a54e6c7f9db8624ce4edc8e01f6e1"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine.ledgerTool (cyclomatic 42): Engine.ledgerTool has cyclomatic complexity 42 (threshold 15). Most of this is not in the body itself: 1 of the 42 points is its own statement and the rest belongs to one function literal inside it that branches (line 298). 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/engine/ledger.go"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b16993013f5561eecf6b0454bf45fa31d3e11e8cdfdf23392f37d1fdf82e1b5"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine.deviations (cyclomatic 41): Engine.deviations has cyclomatic complexity 41 (threshold 15). Of this number, 40 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/engine/deviation.go"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3ea881590973d9d92e22754adf9fc89c7e0edb5a28e63767365c0542e9b609"}},{"ruleId":"D1","level":"warning","message":{"text":"ooxml.text (cyclomatic 40): ooxml.text has cyclomatic complexity 40 (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/docs/ooxml/ooxml.go"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"75670fde408507f54df8eb1c686ab765554b8fa58355678aeb3140d8f33aa852"}},{"ruleId":"D1","level":"warning","message":{"text":"engine.strictify (cyclomatic 40): engine.strictify has cyclomatic complexity 40 (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/engine/remote.go"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"733aff4c63771127d5d3aa7918d49ff78a5688ccba88629e5031cf54ce27c016"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine.execute (cyclomatic 40): Engine.execute has cyclomatic complexity 40 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 9 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/engine/run.go"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"722a382566abb277dfdb31fc21d473bb7062f54dc32ff2c0899d60eb35df30e4"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine.sweepVisits (cyclomatic 40): Engine.sweepVisits has cyclomatic complexity 40 (threshold 15). Most of this is not in the body itself: 10 of the 40 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 268, 253). 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/engine/sweep.go"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95e1418d1f01819f5fcd71804f84050c00c2ab6c6a7461889d77c0e13c82d46"}},{"ruleId":"D1","level":"warning","message":{"text":"Runtime.Invoke (cyclomatic 38): Runtime.Invoke has cyclomatic complexity 38 (threshold 15). Of this number, 27 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/agent/loop.go"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb95fd512343cb7f6a72018bda35634ca40fff0e2119978c4a8aec5d40dc058"}},{"ruleId":"D1","level":"warning","message":{"text":"analysis.rankPairs (cyclomatic 36): analysis.rankPairs has cyclomatic complexity 36 (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/analysis/join.go"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f18e62bae3203b5c5f8ba0f0a821e016d2e33035d0bfd105195c0c5ba552ad"}},{"ruleId":"D1","level":"warning","message":{"text":"engine.passageQuery (cyclomatic 36): engine.passageQuery has cyclomatic complexity 36 (threshold 15). Of this number, 35 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/engine/deviation.go"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ba478b166c5eff396db394cb350f867dc33e005730c793264fa16c18c6e00e"}},{"ruleId":"D1","level":"warning","message":{"text":"Manage.History (cyclomatic 36): Manage.History has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 12 of the 36 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 555, filesOf, revert). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/screens/Manage.tsx"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"82320204913631c9e9c11275fc5d9d9b0ca8b36cb9d4f156eb82ee88cfc496f4"}},{"ruleId":"D1","level":"warning","message":{"text":"finish.Call (cyclomatic 35): finish.Call has cyclomatic complexity 35 (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/engine/finish.go"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d658a91c082eedc6423370f3e89a2a9afa033601476c420f31fc62fa7cf2ec"}},{"ruleId":"D1","level":"warning","message":{"text":"engine.validateHookRefs (cyclomatic 33): engine.validateHookRefs has cyclomatic complexity 33 (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/engine/hookrules.go"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d046961f191a0eec250179cbf22624d9044dc6ac124a9edc2a32feb214e18c6"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine.validateHookRule (cyclomatic 32): Engine.validateHookRule has cyclomatic complexity 32 (threshold 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, 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/engine/hookrules.go"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ff9f9184bd57bc60235acb948aaa966ea2c93ff66067898f627d4e66629394"}},{"ruleId":"D1","level":"warning","message":{"text":"main.Load (cyclomatic 31): main.Load has cyclomatic complexity 31 (threshold 15). 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, 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":"cmd/biglaw/config.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"a457c44c54a437b37c17c9a0d75da28c76b95735ad3430aa300c085a8ac96dd0"}},{"ruleId":"D1","level":"warning","message":{"text":"provider.verify (cyclomatic 30): provider.verify has cyclomatic complexity 30 (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/auth/oidc.go"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"06465bb6ed20f87ff1aab93dce0d85e77a63d9aa9fd0e9aee9394b42c6b146ec"}},{"ruleId":"D1","level":"warning","message":{"text":"docs.classify (cyclomatic 30): docs.classify has cyclomatic complexity 30 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 11 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/docs/pageindex.go"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e6dc1ae724ecd1953c49144547ca93520942a783531c278b2066f436883578"}},{"ruleId":"D1","level":"warning","message":{"text":"engine.literalOrigin (cyclomatic 30): engine.literalOrigin has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 12 of the 30 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 146, 136, 171). 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/engine/lintground.go"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb0d65297d0952b60c4b169b18bd015609eb41363c6200dd7e2e9cf5c1d8f98"}},{"ruleId":"D1","level":"warning","message":{"text":"engine.describeItem (cyclomatic 30): engine.describeItem has cyclomatic complexity 30 (threshold 15). Of this number, 27 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/engine/manage.go"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"5565eb007203768889e22e16c5b6504d1aeb53ba16c3db2c51bc013c010074ea"}},{"ruleId":"D1","level":"warning","message":{"text":"main.signIn (cyclomatic 29): main.signIn has cyclomatic complexity 29 (threshold 15). Of this number, 27 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":"cmd/biglaw/config.go"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4da7ec79aca1b0e30793ffb3ca2795586637e519f1f442c7c87d2c4442340a"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine.committeeTool (cyclomatic 29): Engine.committeeTool has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 1 of the 29 points is its own statement and the rest belongs to one function literal inside it that branches (line 48). 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/engine/committee.go"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b98c3abd68ccd7042c68191ccd08b3c45db3f38ba0409b925693123ddc43e6"}},{"ruleId":"D1","level":"warning","message":{"text":"Schema.validate (cyclomatic 28): Schema.validate has cyclomatic complexity 28 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 4 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/agent/schema.go"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33c9fd5d1cf56c2a5ec284f31867f9d58de46a2546639389dad30d1c3028ec6"}},{"ruleId":"D1","level":"warning","message":{"text":"computeSet.refOperand (cyclomatic 28): computeSet.refOperand has cyclomatic complexity 28 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/computed.go"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"4663ce0c3d9116556857db5e3445e665d341dabfbb8ac3409f717daaa881596c"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine.readChunk (cyclomatic 28): Engine.readChunk 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/engine/figures.go"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"073681a5eaee1786df8a55a895e48ebb3cce48b9e53b617b7fafefd64d5bd221"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine.save (cyclomatic 28): Engine.save has cyclomatic complexity 28 (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/engine/manage.go"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b4b1ba0f6e4d21ec7d50d82ce6a65d83916edbe1b472bd9d5aafc13f6231a2"}},{"ruleId":"D1","level":"warning","message":{"text":"Documents.Reader (cyclomatic 28): Documents.Reader has cyclomatic complexity 28 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 4 belong to 3 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":"ui/src/screens/Documents.tsx"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"186307bfeb6f7b20fe61cdb8618a588aff7566ce0177856d2f4a11fad93faf86"}},{"ruleId":"D1","level":"warning","message":{"text":"engine.snippet (cyclomatic 27): engine.snippet has cyclomatic complexity 27 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 6 belong to 3 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/engine/computed.go"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ef804aaa0d4683dc73a0f652b135f30d1dd4cedbc4cebe922a386d2cc79e73"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine.TestCall (cyclomatic 27): Engine.TestCall 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/engine/custom.go"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"45cfe56fa64eccd5f7df95e8a553463a5c58430185b7c818da1bfd340952b363"}},{"ruleId":"D1","level":"warning","message":{"text":"Request.check (cyclomatic 27): Request.check has cyclomatic complexity 27 (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/model/client.go"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"55aab699d76c588e626ada9cd975b622d7f7a5d6e9de66348407b8772efbc070"}},{"ruleId":"D1","level":"warning","message":{"text":"analysis.CheckCoverage (cyclomatic 26): analysis.CheckCoverage has cyclomatic complexity 26 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, 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/analysis/coverage.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1a5c82f48fff9d29ab1d5a3781d42154f40e38c5ec8bae072f052223c819e9"}},{"ruleId":"D1","level":"warning","message":{"text":"analysis.statesScale (cyclomatic 26): analysis.statesScale 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, 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/analysis/figread.go"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd68162e252c9ced6d75b2e7e1fa2c201b016af76bac71aa41e85bf22d3efe8"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine.render (cyclomatic 26): Engine.render 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/engine/render.go"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20de7577f12a547aa01b6b299d7d578c24cc3bf97ab206b972bfdcb71a870d6"}},{"ruleId":"D1","level":"warning","message":{"text":"mock.build (cyclomatic 26): mock.build 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":"eval/proofrun/mock.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ac9492902e1a3724e3d980cffb1e33938200bf86997b5228526fa595d869f6"}},{"ruleId":"D1","level":"warning","message":{"text":"validate.validate_matter (cyclomatic 26): validate.validate_matter 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":"eval/proofrun/validate.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d218747b5ac72f7c7e7ec8f19d501b4b435e2b87bd9a0181f35f115fbc3361"}},{"ruleId":"D1","level":"warning","message":{"text":"Manage.Detail (cyclomatic 26): Manage.Detail 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, 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":"ui/src/screens/Manage.tsx"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05bf7b59fcf47689e676bffb8ab3593d0008a3e78d6cf7e04c794eac647a8ca"}},{"ruleId":"D1","level":"warning","message":{"text":"Manage.Manage (cyclomatic 25): Manage.Manage has cyclomatic complexity 25 (threshold 15). Of this number, 21 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":"ui/src/screens/Manage.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d119362be639758fd0c930668c4a8202f4097647de617cfe47a926bf21de31"}},{"ruleId":"D1","level":"warning","message":{"text":"Registry.Register (cyclomatic 24): Registry.Register 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/agent/registry.go"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e425e26b3fa2d32c03f7d2ec6cf6520ec6a7618f04ca11a3d3dc8431b55022"}},{"ruleId":"D1","level":"warning","message":{"text":"analysis.Spans (cyclomatic 24): analysis.Spans 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/analysis/figures.go"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"4adec2145e57129e5bb6e000d83fb13f52c4fbd18d0fa189f84420a376932c44"}},{"ruleId":"D1","level":"warning","message":{"text":"analysis.namesValues (cyclomatic 24): analysis.namesValues has cyclomatic complexity 24 (threshold 15). 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, 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/analysis/join.go"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"79773fba6b7202a4b4e38a87538a4b2d0b7d9f88b4355e725ac24de8abab0fe9"}},{"ruleId":"D1","level":"warning","message":{"text":"analysis.resolve (cyclomatic 24): analysis.resolve has cyclomatic complexity 24 (threshold 15). 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: 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/analysis/numbers.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"676888aee382320acb46168867aea8ae1d53c67f1ae76c3ac2073df1f3068ddc"}},{"ruleId":"D1","level":"warning","message":{"text":"auth.decodeClaims (cyclomatic 24): auth.decodeClaims 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/auth/oidc.go"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f24d453f30a2e03ebdfe2835d24b6aa21b046f5b7cd6215d5bfe5744ec8b071"}},{"ruleId":"D1","level":"warning","message":{"text":"computeSet.operand (cyclomatic 24): computeSet.operand 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/engine/computed.go"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb24fb9708c768bb6471e43e924dafdd7d4440d349c28651dbcd0b1ee76e828"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine.validateCustomTool (cyclomatic 24): Engine.validateCustomTool 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/engine/custom.go"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"168813ec46743635dbfe329042595e01ed7dac7c0db781a957e2016c5bf9f8d8"}},{"ruleId":"D1","level":"warning","message":{"text":"Service.Tools (cyclomatic 23): Service.Tools has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 1 of the 23 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 91, 148). 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/docs/register.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd50aca5424a8fe8adf106f656c20d00491651d941af3d74c708d3d7ed79f59"}},{"ruleId":"D1","level":"warning","message":{"text":"Service.Section (cyclomatic 23): Service.Section has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/docs/search.go"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f969cd5e9d7db3dae3d1a85dacaa1ee22592e15e8c7a263f611f85c4fd4457"}},{"ruleId":"D1","level":"warning","message":{"text":"Service.readPage (cyclomatic 23): Service.readPage has cyclomatic complexity 23 (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/docs/vision.go"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"25cb40b31bc12e49df3101d889697581292db1e9318b80e86a3727fe8caabe0f"}},{"ruleId":"D1","level":"warning","message":{"text":"engine.renderContext (cyclomatic 23): engine.renderContext has cyclomatic complexity 23 (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/engine/requirement.go"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd142bea0dee2faa3beb88ca0b915ded3553e74cfd011f4233327233126482b"}},{"ruleId":"D1","level":"warning","message":{"text":"engine.newSpecs (cyclomatic 23): engine.newSpecs 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/engine/specset.go"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf91d9647d8f30dc8aa7f7f605ed1fd0c20445fbac70584358aee7b20011069"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine.placements (cyclomatic 23): Engine.placements has cyclomatic complexity 23 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 4 belong to 3 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/engine/cover.go"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bcc032a0c0338af08442ab358ae8fafeab6239a2f9b3a6e05e31d301ffc0c70"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine.readFigures (cyclomatic 23): Engine.readFigures 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/engine/figures.go"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"007c3ad876fe0b6e77c53ccdca43f58870977a770167fdb4f7705a3b1184b652"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine.draftRequest (cyclomatic 23): Engine.draftRequest 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/engine/render.go"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d89ce1c1524d418284e5de3e9425ba2b3cf89bfaf9cfede1cd114439d666aff"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine.Decide (cyclomatic 23): Engine.Decide has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 5 of the 23 points are its own statements and the rest belongs to one function literal inside it that branches (line 356). 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/engine/views.go"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"e05752ad2b50433293aa184f7cf7a3d54b75b135daa6b00304beff1a96cccb76"}},{"ruleId":"D1","level":"warning","message":{"text":"store.ValidName (cyclomatic 23): store.ValidName 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, 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/store/files.go"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d6c037d8e35f82ee122ddc313ad8821bdbbb55d71ddb694fc03d9efa533a87"}},{"ruleId":"D1","level":"warning","message":{"text":"analysis.Tools (cyclomatic 22): analysis.Tools has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 126, 93). 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/analysis/register.go"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0fa9dce6154fab3b869f26b9059be716ba7b2adf1aa52e0e1ef280d4ab4098a"}},{"ruleId":"D1","level":"warning","message":{"text":"engine.validateSpec (cyclomatic 22): engine.validateSpec has cyclomatic complexity 22 (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/engine/manage_validate.go"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"da52431b9b60c7f133d47744817053e54f399ac1f97347b9122ef8ba1ac9d62d"}},{"ruleId":"D1","level":"warning","message":{"text":"run.Record (cyclomatic 22): run.Record has cyclomatic complexity 22 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 9 belong 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/engine/steps.go"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"534217fe2a946f8057e26b8506fdbac1e65f58580d8f653dd04b3d482206818c"}},{"ruleId":"D1","level":"warning","message":{"text":"store.MigrateFS (cyclomatic 22): store.MigrateFS 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, 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/store/migrate.go"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a86942e3f02137a5b9f4dd3a295cb443ac05192db48bce55fba0dae6a572ab"}},{"ruleId":"D1","level":"warning","message":{"text":"Store.PutFile (cyclomatic 22): Store.PutFile has cyclomatic complexity 22 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 10 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/store/files.go"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd785c982cd96d1c009d457bb2359bf868f66e92016bc4de13e51cf1875df3d"}},{"ruleId":"D1","level":"warning","message":{"text":"driver.run_task (cyclomatic 22): driver.run_task has cyclomatic complexity 22 (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":"eval/lab/labdriver/driver.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c6324957d0559ea9f204045f558db615f25c537ab77d8d8cbb376c6be14b3f"}},{"ruleId":"D1","level":"warning","message":{"text":"analysis.SameFigure (cyclomatic 21): analysis.SameFigure has cyclomatic complexity 21 (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/analysis/figread.go"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"324300390b73aea186f53b1e5fa0eca19706a009c5a03b7277bc88274df065c5"}},{"ruleId":"D1","level":"warning","message":{"text":"docs.extractPDF (cyclomatic 21): docs.extractPDF 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/docs/ingest.go"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"390d4b6a32c07f78636c86da3b26364a57606498cf26d75dc680050381039376"}},{"ruleId":"D1","level":"warning","message":{"text":"engine.checkAnswer (cyclomatic 21): engine.checkAnswer has cyclomatic complexity 21 (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/engine/deviation.go"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4aac2749578c942c64c24df64921392fbb416332e8cd2a22f1c4aace53494bb"}},{"ruleId":"D1","level":"warning","message":{"text":"remoteClient.checkURL (cyclomatic 21): remoteClient.checkURL has cyclomatic complexity 21 (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/engine/remote.go"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63776c3da2dedfa87412442c68f7f424ab321ec314e473ddf8525800336516f"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine.Import (cyclomatic 21): Engine.Import 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/engine/custom.go"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"431e2a6bf3547259b92a6f31a91a8d695158f508a07066baaa06144f4b1fe3de"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine.judge (cyclomatic 21): Engine.judge 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/engine/judge.go"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61abb14511c2ba1c985c04e20e736cc876a4fd8ef86fff9b9f0b93438b24d86"}},{"ruleId":"D1","level":"warning","message":{"text":"Manage.Editor (cyclomatic 21): Manage.Editor has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 8 of the 21 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 173, 163, 167). 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":"ui/src/screens/Manage.tsx"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dfeba20922b3667937c39976ac0b9016624686826671720e05911cf4e853edf"}},{"ruleId":"D1","level":"warning","message":{"text":"analysis.Salience (cyclomatic 20): analysis.Salience has cyclomatic complexity 20 (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/analysis/numbers.go"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b71c7ea4ea36fd3d9f5ac4bf846ab6b82354924af31884411fa14b2b025f897"}},{"ruleId":"D1","level":"warning","message":{"text":"computeSet.sheet (cyclomatic 20): computeSet.sheet has cyclomatic complexity 20 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 5 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/engine/computed.go"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f935bf9d0cdfed2775756acc0211b31d208f082857ae6d1baeaba48eff2a441"}},{"ruleId":"D1","level":"warning","message":{"text":"policy.Allow (cyclomatic 20): policy.Allow 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/engine/policy.go"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c74eb69f7316cbde9707bfb328d40997cc3d69a6c9184f4d59c3c4f3dd0750e"}},{"ruleId":"D1","level":"warning","message":{"text":"main.serve (cyclomatic 19): main.serve has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 9 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 252). 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":"cmd/biglaw/main.go"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"960a22dc018df05292b028ea247824e3cf069ca34fadd00fce3be94803b1109d"}},{"ruleId":"D1","level":"warning","message":{"text":"api.handler (cyclomatic 19): api.handler has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 2 of the 19 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 78, 105, 149, \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/api/api.go"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef48f636dffff51ccb1a54719b85eb92051479e133833276cd3e69009180081"}},{"ruleId":"D1","level":"warning","message":{"text":"provider.fetchKeys (cyclomatic 19): provider.fetchKeys 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/auth/oidc.go"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"1131f25e4c74ca856222f1538218228bd002867e52dd01b851443be612b05875"}},{"ruleId":"D1","level":"warning","message":{"text":"Service.callback (cyclomatic 19): Service.callback has cyclomatic complexity 19 (threshold 15). 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: 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/auth/session.go"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"4efe15ff14f8c1162b84888eeb6d66f9f46c62bdc4e5ba6e53b91d58cf98ddd0"}},{"ruleId":"D1","level":"warning","message":{"text":"docs.tableRows (cyclomatic 19): docs.tableRows has cyclomatic complexity 19 (threshold 15). Of this number, 18 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/docs/chunk.go"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"194445eab7e2b51dab9c5395ac5266ae1890238607bc66833c73dea3ba3dcb47"}},{"ruleId":"D1","level":"warning","message":{"text":"docs.Verify (cyclomatic 19): docs.Verify has cyclomatic complexity 19 (threshold 15). Of this number, 18 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/docs/verify.go"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"c619077efb52c2999d820709c75930d2cddfb2903e1279b700b66b3a8ca6e736"}},{"ruleId":"D1","level":"warning","message":{"text":"engine.deepCopy (cyclomatic 19): engine.deepCopy 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/engine/ledgercache.go"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d03d3b49495627ae5d584829ad65296567f42ec8f345b625c0d093982f22d0"}},{"ruleId":"D1","level":"warning","message":{"text":"engine.validateSkillFile (cyclomatic 19): engine.validateSkillFile has cyclomatic complexity 19 (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/engine/manage_validate.go"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51739cafbd5fd625a8e86383cd660a1d38fe770fd07938f904cc0ed09603174"}},{"ruleId":"D1","level":"warning","message":{"text":"hookRunner.run (cyclomatic 19): hookRunner.run 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/engine/hookrules.go"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"4add88d4b8d0bc57136412df0a333cb4a2d00b9d82751d8e6def90a7f53e08ca"}},{"ruleId":"D1","level":"warning","message":{"text":"Store.ReadFile (cyclomatic 19): Store.ReadFile 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/store/files.go"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"1309331e062626f68f1074135c016aae973297eef1154e584b5e18ef7e65e42d"}},{"ruleId":"D1","level":"warning","message":{"text":"analysis.Handles (cyclomatic 18): analysis.Handles has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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/analysis/numbers.go"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f76454a328bbf5c656fdbcdeee14f3a809d6b2e9c61be5c18ead426af54cb89"}},{"ruleId":"D1","level":"warning","message":{"text":"docs.align (cyclomatic 18): docs.align has cyclomatic complexity 18 (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/docs/vision.go"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"617e46f64403edef841981102d3821c4fbc5f30934912bd5a0771d431134f936"}},{"ruleId":"D1","level":"warning","message":{"text":"Service.TranscribePending (cyclomatic 18): Service.TranscribePending 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/docs/jobs.go"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfeccae2bb61fac28d2a7232c2fdcb476c5c9b22de030b7a3fcac9871803abaa"}},{"ruleId":"D1","level":"warning","message":{"text":"Service.Search (cyclomatic 18): Service.Search 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/docs/search.go"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f53f67a82851a905a03687f36b8f96cda03c4d3566cd6d37d0c34b03607d6f"}},{"ruleId":"D1","level":"warning","message":{"text":"engine.toc (cyclomatic 18): engine.toc has cyclomatic complexity 18 (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/engine/sweeporder.go"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"b605f56b623b230f9c37ad255e5cb54b2c2ead048824e66a5fc62a21b12806f7"}},{"ruleId":"D1","level":"warning","message":{"text":"mcpSession.call (cyclomatic 18): mcpSession.call 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/engine/remote.go"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2b0767778c15004b0d31dcc73249e81b08310f3aa6b0b8b7b21d0bb5fa4650"}},{"ruleId":"D1","level":"warning","message":{"text":"BigLawClient.wait_for_task (cyclomatic 18): BigLawClient.wait_for_task 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":"eval/lab/labdriver/biglaw.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cab2964a4ef296d3ec4569c1dba3ded9798d2905ef743c7ec803485180d9a97"}},{"ruleId":"D1","level":"warning","message":{"text":"App.App (cyclomatic 18): App.App has cyclomatic complexity 18 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. 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":"ui/src/App.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ca5589d47fbafe222b49fdb6fe11a34b7fe01216d54ce9a598b7fb5c28fe98"}},{"ruleId":"D1","level":"warning","message":{"text":"analysis.statesUnit (cyclomatic 17): analysis.statesUnit has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/analysis/figread.go"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8473f875a6019bef7c845152cad27a23021501c8505c30ca6f3e6d3a6a591e"}},{"ruleId":"D1","level":"warning","message":{"text":"api.events (cyclomatic 17): api.events 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/api/api.go"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6de0e1844bd9e50a58f70a8ee845df7678f1024bce92f47ef7d92aba6462e69"}},{"ruleId":"D1","level":"warning","message":{"text":"authtest.New (cyclomatic 17): authtest.New has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 95, 108). 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/auth/authtest/idp.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"248e7a42ebb9dd6de9e03f696d10f4971a1d0201bd3e48f0f3a38aa8543d3f91"}},{"ruleId":"D1","level":"warning","message":{"text":"docs.ContentDisposition (cyclomatic 17): docs.ContentDisposition has cyclomatic complexity 17 (threshold 15). 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, 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/docs/http.go"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53adc832b0cb7625e1d89626f466b76dd0e25b26df74298b07b678d7e430baa"}},{"ruleId":"D1","level":"warning","message":{"text":"docs.parseTree (cyclomatic 17): docs.parseTree 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/docs/pageindex.go"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2014941dbca766496bdde7396b2290fa98fb6cb7ce59b04b9611f6794c53880"}},{"ruleId":"D1","level":"warning","message":{"text":"engine.reviewRule (cyclomatic 17): engine.reviewRule has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong 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/engine/manage.go"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42c28e9f8356867c4565df5f1da627e4fa898f6489dd5d90d80c84582f22c49"}},{"ruleId":"D1","level":"warning","message":{"text":"computeSet.expr (cyclomatic 17): computeSet.expr 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 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/engine/computed.go"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5dd8d6c2cf837ad7337e032bfec8a622caa572b9cfecb454410fa8ea40f6fc"}},{"ruleId":"D1","level":"warning","message":{"text":"remoteClient.do (cyclomatic 17): remoteClient.do 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/engine/remote.go"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb288536aa6efbd3f9bc921a463e0b1483f7378585e75ad2e18c02e6d8d81f8"}},{"ruleId":"D1","level":"warning","message":{"text":"Client.Embed (cyclomatic 17): Client.Embed 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/model/embed.go"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"737b724f0af651a41f371e8d27a5363c355246db2182bc855837a1ee5c198116"}},{"ruleId":"D1","level":"warning","message":{"text":"Manage.RuleFields (cyclomatic 17): Manage.RuleFields has cyclomatic complexity 17 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 4 belong to 3 function items 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":"ui/src/screens/Manage.tsx"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d2155d84a3bf3b32e932f466c98619da189434623cd429a8a96f954b451a88"}},{"ruleId":"D1","level":"warning","message":{"text":"main.roles (cyclomatic 16): main.roles 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":"cmd/biglaw/config.go"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad5fe630fa6eb9cf78fa23ff7ebecdcd3cedcbe5d8286e28643dd509ba3b184"}},{"ruleId":"D1","level":"warning","message":{"text":"docs.Chunkify (cyclomatic 16): docs.Chunkify has cyclomatic complexity 16 (threshold 15). Of this number, 10 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/docs/chunk.go"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b6bd8710eac5fd941061f23dc11e15a25f7488047ca6241509181e58d72c59"}},{"ruleId":"D1","level":"warning","message":{"text":"engine.lineDiff (cyclomatic 16): engine.lineDiff has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/diff.go"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec45b0eb58d905df33be99509f81388d9c975b733975419440e1f6ec47de840"}},{"ruleId":"D1","level":"warning","message":{"text":"engine.durationStated (cyclomatic 16): engine.durationStated has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/lint.go"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d47c3608f7fe602de246faf98004ac7573a30376ca8e90f56344f5c1060d1a5"}},{"ruleId":"D1","level":"warning","message":{"text":"engine.polishSection (cyclomatic 16): engine.polishSection 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/engine/quality.go"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcdc3baa0fead3d67aff93a37db4949c8f7a0beccaf3bd98537fbe8bdb6a3cfc"}},{"ruleId":"D1","level":"warning","message":{"text":"engine.exampleFor (cyclomatic 16): engine.exampleFor has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/remote.go"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c7694cdeaa53c3aaedde00b42e3b842f7df2c9c6224d9596e422280cf0d175"}},{"ruleId":"D1","level":"warning","message":{"text":"engine.placeRequirement (cyclomatic 16): engine.placeRequirement 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/engine/requirement.go"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e25efbc537913fdcb4990d2078ec5e3af942c2d38888016fd429260d524e058"}},{"ruleId":"D1","level":"warning","message":{"text":"engine.itemOf (cyclomatic 16): engine.itemOf has cyclomatic complexity 16 (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/engine/specset.go"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"b368c44176e22b165bbadfc42de4308b677a7affc5079c9ce3eb2cb994de1e33"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine.Discover (cyclomatic 16): Engine.Discover 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/engine/custom.go"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22d21cd1b0cac1e95ca19f316e54b6bbbcc30760d75f7892440c669497179a1"}},{"ruleId":"D1","level":"warning","message":{"text":"Manage.Import (cyclomatic 16): Manage.Import has cyclomatic complexity 16 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 4 belong to 3 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":"ui/src/screens/Manage.tsx"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee2e0a8c93212fb52f2d378d2c63e2283172e89517d7e3abab8f3450d1746ab"}},{"ruleId":"D2","level":"warning","message":{"text":"engine.lintSection (cognitive 214): engine.lintSection has cognitive complexity 214 (threshold 15). Drivers by points: if/else 37 (113 pts), loops 34 (79 pts), boolean chains 18, match/switch 2 (4 pts) (nesting depth added 123). Of this number, 198 points are the body\u0027s own statements and 16 belong to 5 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/engine/lint.go"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8aec02b4478f04ca3b64dd35857563347fdc082d5b94cad3a62cd1419a2cd4"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime.Run (cognitive 152): Runtime.Run has cognitive complexity 152 (threshold 15). Drivers by points: if/else 45 (126 pts), boolean chains 15, loops 6 (11 pts) (nesting depth added 86). Of this number, 148 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/agent/loop.go"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cea5f6a87246ddaae28973e0355c0d3ae2ff16e6aa226488314aa7f9e0c7a8c"}},{"ruleId":"D2","level":"warning","message":{"text":"finish.check (cognitive 90): finish.check has cognitive complexity 90 (threshold 15). Drivers by points: if/else 33 (53 pts), loops 12 (21 pts), boolean chains 13, match/switch 2 (3 pts) (nesting depth added 30). Of this number, 89 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/engine/finish.go"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04dbc5fa0cdee371dd314280bb1bac39790d5f46facf17a84b55b5c4f212e87"}},{"ruleId":"D2","level":"warning","message":{"text":"score.score_run (cognitive 84): score.score_run has cognitive complexity 84 (threshold 15). Drivers by points: if/else 16 (30 pts), ternaries 12 (23 pts), boolean chains 18, loops 8 (13 pts) (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":"eval/proofrun/score.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"43785e7aca687aa58f713d5f601ecf3cec15d304a91972a40ba37e1b32d4317d"}},{"ruleId":"D2","level":"warning","message":{"text":"analysis.Calc (cognitive 83): analysis.Calc has cognitive complexity 83 (threshold 15). Drivers by points: if/else 16 (31 pts), boolean chains 27, loops 10 (20 pts), match/switch 3 (5 pts) (nesting depth added 27). Of this number, 82 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/analysis/numbers.go"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ef584a01aed4220061f59e0cfa6858788af3e07ac1e6bf5e8f3e542d127de2"}},{"ruleId":"D2","level":"warning","message":{"text":"main.run (cognitive 81): main.run has cognitive complexity 81 (threshold 15). Drivers by points: if/else 29 (67 pts), boolean chains 9, match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 40). Of this number, 77 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/biglaw/main.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf906149191a60bfdfac9aa054add6b951fcc9be799aa8c98282cbb99441c125"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine.coverTool (cognitive 75): Engine.coverTool has cognitive complexity 75 (threshold 15). Drivers by points: if/else 37 (58 pts), loops 7 (13 pts), boolean chains 4 (nesting depth added 27). None of this is in the body itself: all 75 points belong to one function literal inside it that branches (line 125). 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/engine/cover.go"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"1373f1b3677354f09d0156fe9034c52f9347695bdc158928d62e45be15cab722"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine.admit (cognitive 75): Engine.admit has cognitive complexity 75 (threshold 15). Drivers by points: if/else 24 (47 pts), loops 8 (16 pts), boolean chains 12 (nesting depth added 31). Of this number, 72 points are the body\u0027s own statements and 3 belong to 3 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/engine/register.go"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc27434f742a2eadf60535c1179accfcd017f8deca8a5d1659e5f1a604b12b5"}},{"ruleId":"D2","level":"warning","message":{"text":"figtest.oracleLabel (cognitive 71): figtest.oracleLabel has cognitive complexity 71 (threshold 15). Drivers by points: if/else 18 (38 pts), boolean chains 19, loops 4 (10 pts), match/switch 3 (4 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/engine/figtest/reader.go"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"b489369f37434cbbfd7af69a13fdd4cfd386c2913c7f9940864672641918e328"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine.deviations (cognitive 71): Engine.deviations has cognitive complexity 71 (threshold 15). Drivers by points: if/else 32 (59 pts), loops 4 (6 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 30). Of this number, 70 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/engine/deviation.go"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"184c494b42fd743a235bf3e482f74f7804d19d0b661e254b8bd6cfd79e19555d"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine.validate (cognitive 71): Engine.validate has cognitive complexity 71 (threshold 15). Drivers by points: if/else 25 (44 pts), loops 7 (13 pts), boolean chains 12, match/switch 1 (2 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into 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/engine/manage_validate.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e658e0ac412e673a42ed4c4d4bd355cdcee9b5c934628c0021bc4b9bc602fc"}},{"ruleId":"D2","level":"warning","message":{"text":"hooked.Call (cognitive 68): hooked.Call has cognitive complexity 68 (threshold 15). Drivers by points: if/else 23 (50 pts), loops 4 (9 pts), boolean chains 7, match/switch 2 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into 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/engine/register.go"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf91c68caa0abdff9d1e05eb3573827acd0d6b815bd681825e1a25bb58ac02d7"}},{"ruleId":"D2","level":"warning","message":{"text":"engine.strictify (cognitive 62): engine.strictify has cognitive complexity 62 (threshold 15). Drivers by points: if/else 23 (45 pts), loops 6 (11 pts), boolean chains 5, match/switch 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":"internal/engine/remote.go"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd171c4dda13f548c4499d966e20632b01db7ac57fc8e175422c7cb653870ea"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine.sweepTool (cognitive 60): Engine.sweepTool has cognitive complexity 60 (threshold 15). Drivers by points: if/else 27 (43 pts), loops 8 (12 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 21). None of this is in the body itself: all 60 points belong to one function literal inside it that branches (line 378). 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/engine/sweep.go"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"811e41e2beab27672f718e7db1d69a8fdf90156773def0c0622c610609c4bd27"}},{"ruleId":"D2","level":"warning","message":{"text":"analysis.check (cognitive 56): analysis.check has cognitive complexity 56 (threshold 15). Drivers by points: if/else 20 (29 pts), boolean chains 20, match/switch 4, loops 2 (3 pts) (nesting depth added 10). Of this number, 55 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/analysis/figread.go"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a127704020f78f687781c5761c6331127a7067bf95cf3be5978e2ef99ab70f0"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine.ledgerTool (cognitive 56): Engine.ledgerTool has cognitive complexity 56 (threshold 15). Drivers by points: if/else 16 (29 pts), loops 7 (15 pts), boolean chains 9, match/switch 2 (3 pts) (nesting depth added 22). None of this is in the body itself: all 56 points belong to one function literal inside it that branches (line 298). 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/engine/ledger.go"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b090a964f285654c53b5afc3e0da61791b29b1efdb5bdcf3ec1df68497b8cd"}},{"ruleId":"D2","level":"warning","message":{"text":"analysis.rankPairs (cognitive 53): analysis.rankPairs has cognitive complexity 53 (threshold 15). Drivers by points: if/else 11 (33 pts), loops 10 (14 pts), boolean chains 6 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into 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/analysis/join.go"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8a5459c23f96c8e7b61e2a263a27aae423be7a668b12c4e291d5488c75fb1f"}},{"ruleId":"D2","level":"warning","message":{"text":"engine.g8In (cognitive 50): engine.g8In has cognitive complexity 50 (threshold 15). Drivers by points: if/else 10 (28 pts), boolean chains 15, match/switch 2 (5 pts), loops 2 (nesting depth added 21). Of this number, 46 points are the body\u0027s own statements and 4 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/engine/lint.go"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc42a1f94206f0a80b7375da8aeed58ebe00c157bda43f327b3d67fe6f592891"}},{"ruleId":"D2","level":"warning","message":{"text":"ooxml.text (cognitive 49): ooxml.text has cognitive complexity 49 (threshold 15). Drivers by points: if/else 11 (30 pts), boolean chains 10, match/switch 3 (8 pts), 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/docs/ooxml/ooxml.go"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce4d022cfb14492036737fb61b7b5a5c954eea75c3122f7ec446f5156a7b0276"}},{"ruleId":"D2","level":"warning","message":{"text":"engine.describeItem (cognitive 49): engine.describeItem has cognitive complexity 49 (threshold 15). Drivers by points: if/else 20 (38 pts), loops 3 (6 pts), boolean chains 4, match/switch 1 (nesting depth added 21). Of this number, 45 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/engine/manage.go"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e87ffaba11ef8ab322e8619b231cec734f33779958f40bdb2f7e63a962a513"}},{"ruleId":"D2","level":"warning","message":{"text":"finish.Call (cognitive 45): finish.Call has cognitive complexity 45 (threshold 15). Drivers by points: if/else 27 (37 pts), boolean chains 4, loops 1 (2 pts), match/switch 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":"internal/engine/finish.go"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b70a4108cead847b38cbb8e17ff1933cec1461e614919ef0399c784f7b2379"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine.sweepVisits (cognitive 45): Engine.sweepVisits has cognitive complexity 45 (threshold 15). Drivers by points: if/else 17 (28 pts), boolean chains 9, loops 6, match/switch 2 (nesting depth added 11). Most of this is not in the body itself: 15 of the 45 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 268, 253). 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/engine/sweep.go"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ba523306418b03472fccb58314ad1e840311fdbc024d9a97038434b4d2ba37"}},{"ruleId":"D2","level":"warning","message":{"text":"analysis.namesValues (cognitive 44): analysis.namesValues has cognitive complexity 44 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 11 (20 pts), boolean chains 4 (nesting depth added 21). Of this number, 40 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/analysis/join.go"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"b834f84887469fbe6aee8767804b49e88dfe1c55f416b59eedba180d39eeec50"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime.Invoke (cognitive 43): Runtime.Invoke has cognitive complexity 43 (threshold 15). Drivers by points: if/else 22 (32 pts), boolean chains 10, match/switch 1 (nesting depth added 10). Of this number, 30 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/agent/loop.go"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78830ec9e4aa6b0ec8a796146820796f6e7b431363bd3a8570f4a86163253ff"}},{"ruleId":"D2","level":"warning","message":{"text":"analysis.CheckCoverage (cognitive 43): analysis.CheckCoverage has cognitive complexity 43 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 9 (11 pts), boolean chains 5 (nesting depth added 19). Of this number, 40 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/analysis/coverage.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ecddae26c0d2fb8919e530b8308296d14797d55ef7ac4b3c180ef92d6f66369"}},{"ruleId":"D2","level":"warning","message":{"text":"engine.passageQuery (cognitive 43): engine.passageQuery has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 18, loops 4 (6 pts) (nesting depth added 12). Of this number, 41 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/engine/deviation.go"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ec31f05626b93bedcd548a1fd4d45c4ccc2039ff08a8d603256b337ee466bc"}},{"ruleId":"D2","level":"warning","message":{"text":"engine.valueStated (cognitive 43): engine.valueStated has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 13, loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 12). Of this number, 41 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/engine/figures.go"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"032d72ad94511608d3655492efc2130782b9936e71532a6b6441e58b557212a2"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine.readChunk (cognitive 43): Engine.readChunk has cognitive complexity 43 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 10 (17 pts), boolean chains 4 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/figures.go"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"c322b89baa150eb084acbe35bf58ead1b7b316141cc0663e487e8653df1e42ae"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine.execute (cognitive 43): Engine.execute has cognitive complexity 43 (threshold 15). Drivers by points: if/else 24 (32 pts), boolean chains 9, loops 1, match/switch 1 (nesting depth added 8). Of this number, 32 points are the body\u0027s own statements and 11 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/engine/run.go"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb7b4296bba1d15e39894c74a8671f45fe5f1e460134696ddeada29260ac28a"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine.committeeTool (cognitive 41): Engine.committeeTool has cognitive complexity 41 (threshold 15). Drivers by points: if/else 16 (28 pts), loops 10 (11 pts), boolean chains 2 (nesting depth added 13). None of this is in the body itself: all 41 points belong to one function literal inside it that branches (line 48). 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/engine/committee.go"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"79936c8fef5fe99a2576fa686dfa6d6f00ca9fb1ade9b88ced2e9ec33c6366b3"}},{"ruleId":"D2","level":"warning","message":{"text":"engine.renderContext (cognitive 40): engine.renderContext has cognitive complexity 40 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 6 (16 pts), boolean chains 5 (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/engine/requirement.go"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03915b82f4706c954635cc8d0937a38287819fa7c79cf853098c4a01278f9a4"}},{"ruleId":"D2","level":"warning","message":{"text":"mock.build (cognitive 40): mock.build has cognitive complexity 40 (threshold 15). Drivers by points: ternaries 6 (15 pts), if/else 6 (11 pts), boolean chains 8, loops 4 (6 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":"eval/proofrun/mock.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"f462150893c1e45220b3bfd35b34e7759128b73e982a274678ca1d480a85ec91"}},{"ruleId":"D2","level":"warning","message":{"text":"Task.TaskScreen (cognitive 40): Task.TaskScreen has cognitive complexity 40 (threshold 15). Drivers by points: boolean chains 19, ternaries 13 (17 pts), if/else 4 (nesting depth added 4). Of this number, 22 points are the body\u0027s own statements and 18 belong to 9 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":"ui/src/screens/Task.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e47250ae75d65d05eda93a2dec607d69b78c44559c8641d3b5e427217efa56e"}},{"ruleId":"D2","level":"warning","message":{"text":"Schema.validate (cognitive 39): Schema.validate has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 8, loops 4 (8 pts), match/switch 1 (nesting depth added 16). Of this number, 35 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/agent/schema.go"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1dd5c89321322cfac284480cd755f60ba82b785188c0571a7f0806d1d6635e8"}},{"ruleId":"D2","level":"warning","message":{"text":"engine.newSpecs (cognitive 39): engine.newSpecs has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 5 (9 pts), boolean chains 3, match/switch 1 (2 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/engine/specset.go"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"c918fba6052dd9c6448b53a7d206fc03f0383b7c01b03985927d9ecba032e5bb"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine.readFigures (cognitive 39): Engine.readFigures has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 7 (14 pts), boolean chains 4 (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/engine/figures.go"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5428588b3fa9399d06d66e8330b7dc2bf419460d8c69aa21ea6ee63b2f6f13c"}},{"ruleId":"D2","level":"warning","message":{"text":"Service.readScans (cognitive 38): Service.readScans has cognitive complexity 38 (threshold 15). Drivers by points: boolean chains 15, if/else 10 (15 pts), loops 4 (5 pts), match/switch 2 (3 pts) (nesting depth added 7). Of this number, 37 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/docs/vision.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"490d7a1cff55e6f33a36211fb44e42b2839555eb58e3e90db2314a53b9ae9a33"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine.judge (cognitive 38): Engine.judge has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 4 (6 pts), boolean chains 3 (nesting depth added 18). Of this number, 37 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/engine/judge.go"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3224e56ef8db59ea7c3cd04a1547addde37340016e9d7550671f0fbad85ec7f"}},{"ruleId":"D2","level":"warning","message":{"text":"BigLawClient.wait_for_task (cognitive 37): BigLawClient.wait_for_task has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (21 pts), boolean chains 7, ternaries 1 (5 pts), loops 2 (4 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":"eval/lab/labdriver/biglaw.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"6775517614d07880b706172f9f975c726de2c0208ddc3f3db7d50c900aacdfbe"}},{"ruleId":"D2","level":"warning","message":{"text":"validate.validate_matter (cognitive 37): validate.validate_matter has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (26 pts), boolean chains 6, loops 4 (5 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":"eval/proofrun/validate.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3816135d96a526d74ea9d6f7eb7f92c33773ba7570a525eada42d77640cb337"}},{"ruleId":"D2","level":"warning","message":{"text":"docs.tableRows (cognitive 35): docs.tableRows has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 3 (7 pts), boolean chains 4 (nesting depth added 17). Of this number, 34 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/docs/chunk.go"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ac9d3ff97d0050c75f355929d36095dc71f528307d9f256460d848edb86fcf"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine.render (cognitive 35): Engine.render has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (22 pts), loops 10 (12 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/engine/render.go"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc566b14c28c053ac3405d12a1a8126e9f5808d355eefeca566bdfa2275846e7"}},{"ruleId":"D2","level":"warning","message":{"text":"analysis.Spans (cognitive 34): analysis.Spans has cognitive complexity 34 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 5 (11 pts), boolean chains 9 (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/analysis/figures.go"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd2d0df2cfe4ca1b069e2538fbd10a22278abbda6e6d4725ef32c3779f5e092"}},{"ruleId":"D2","level":"warning","message":{"text":"run.selftest (cognitive 34): run.selftest has cognitive complexity 34 (threshold 15). Drivers by points: if/else 6 (25 pts), loops 3 (7 pts), boolean chains 2 (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":"eval/run.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"218c536636ad950489e63fc8770f365072c560505f9856677226aacb6d8f457f"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine.placements (cognitive 32): Engine.placements has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 7 (9 pts), boolean chains 4 (nesting depth added 11). Of this number, 27 points are the body\u0027s own statements and 5 belong to 3 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/engine/cover.go"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f38f2b115c59939b38004753df379e200a69dc8b062ed8201535959f33003b6"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine.plan (cognitive 32): Engine.plan has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 3 (6 pts) (nesting depth added 21). Of this number, 27 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/engine/sweep.go"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"926ba2634a7194c073e6ab9fcd46df912eb49dcb608da3ecde1d19eb94104075"}},{"ruleId":"D2","level":"warning","message":{"text":"main.signIn (cognitive 31): main.signIn has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 10, loops 1 (2 pts) (nesting depth added 9). Of this number, 29 points are the body\u0027s own statements and 2 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":"cmd/biglaw/config.go"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c7f209e3b163f30d7cc7a47587bf8d1d6a8261fb9b28dd1c9de3e0a571b75f"}},{"ruleId":"D2","level":"warning","message":{"text":"auth.decodeClaims (cognitive 31): auth.decodeClaims has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 6, loops 3 (4 pts), 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/auth/oidc.go"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"def6bea96a0bd2301a56bb1a36a04bfb305f1fb751b0ee40fbae5788da7bde95"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine.draftRequest (cognitive 31): Engine.draftRequest has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (22 pts), loops 5 (7 pts), boolean chains 2 (nesting depth added 8). 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/engine/render.go"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"8644b42f53136603175ccf72d580fb521256ee2381423974d5c9fa8f28031c42"}},{"ruleId":"D2","level":"warning","message":{"text":"Service.Tools (cognitive 30): Service.Tools has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (22 pts), loops 2 (4 pts), boolean chains 3, match/switch 1 (nesting depth added 10). None of this is in the body itself: all 30 points belong to 2 function literals inside it that branch (lines 91, 148). 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/docs/register.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ef2f799e6a0fe713379972c7d4dc80893dba3f8f0b54341856d5b68cefff32"}},{"ruleId":"D2","level":"warning","message":{"text":"hookRunner.run (cognitive 30): hookRunner.run has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 7, 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/engine/hookrules.go"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"eedc427e1ca87db5b6505e3d82330d46cab6d7066ad61db31f116c38784e765c"}},{"ruleId":"D2","level":"warning","message":{"text":"Manage.History (cognitive 30): Manage.History has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 14, ternaries 12 (14 pts), if/else 2 (nesting depth added 2). Most of this is not in the body itself: 9 of the 30 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 555, filesOf, revert). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/screens/Manage.tsx"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e003af79a1d1082681d6375029f01bcd3e0a575fe0d6eb80ddb613dfb4b4b94"}},{"ruleId":"D2","level":"warning","message":{"text":"engine.validateHookRefs (cognitive 29): engine.validateHookRefs has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 14, if/else 5 (10 pts), match/switch 2 (4 pts), loops 1 (nesting depth added 7). 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/engine/hookrules.go"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27cc7f2871256d3f99a0ca905aa93547124aa5f9eab1b50044d4a5f3c783747"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine.save (cognitive 29): Engine.save has cognitive complexity 29 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 7, match/switch 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/manage.go"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0912c7598be8fee9c982479da24a91586d6a8d89cfc2fcc378da6df22bba67"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine.Decide (cognitive 29): Engine.Decide has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 4, loops 1 (2 pts), match/switch 1 (nesting depth added 8). Most of this is not in the body itself: 4 of the 29 points are its own statements and the rest belongs to one function literal inside it that branches (line 356). 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/engine/views.go"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"183e02b0d5c3e8df34b4b08b99dab640810a34525d8b64776b2ca0338376ff7f"}},{"ruleId":"D2","level":"warning","message":{"text":"store.MigrateFS (cognitive 29): store.MigrateFS has cognitive complexity 29 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 2, loops 2 (nesting depth added 8). 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/store/migrate.go"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1b6ada9c54e868d771a72568b757669ed94d4aa68294d028c609c35e0ccb26"}},{"ruleId":"D2","level":"warning","message":{"text":"docs.extractPDF (cognitive 28): docs.extractPDF has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 6, loops 2 (nesting depth added 9). 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 into named stages: move each independent step or branch into 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/docs/ingest.go"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"decc9c15958595b108259a3a47585bf5c3fe46c13f779007df5f794483eebb1f"}},{"ruleId":"D2","level":"warning","message":{"text":"remoteTool.call (cognitive 28): remoteTool.call has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 1 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 15). 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/engine/custom.go"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada05a75911dd762591fe37e76d057250c743fae95fa1ce7d791918b9cbeca40"}},{"ruleId":"D2","level":"warning","message":{"text":"Manage.Editor (cognitive 28): Manage.Editor has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 9 (19 pts), boolean chains 9 (nesting depth added 10). Most of this is not in the body itself: 6 of the 28 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 173, 163, 167). 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":"ui/src/screens/Manage.tsx"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd1b20790af537c45d09f57dd7ceeaf1b6ff5e46c4e9f4e22555382ea12cfb2"}},{"ruleId":"D2","level":"warning","message":{"text":"main.Load (cognitive 27): main.Load has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14, boolean chains 13. 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: 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":"cmd/biglaw/config.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"315864fc2f3655cf028a574b1803086d529f89eab1de769d2b91d78d8536ec1e"}},{"ruleId":"D2","level":"warning","message":{"text":"engine.deepCopy (cognitive 27): engine.deepCopy has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 4 (9 pts), boolean chains 1, match/switch 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/engine/ledgercache.go"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"093ef28084378150af4ac532db721304cba1a2be4aa054f5aef7c24d072984e4"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine.Import (cognitive 27): Engine.Import has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 2 (5 pts), boolean chains 4, 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/engine/custom.go"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"31adbcb5ea30c1c221b600132e6703d0c4b21f4796bf9e02e49d70e34f3f38a2"}},{"ruleId":"D2","level":"warning","message":{"text":"engine.tracedSheets (cognitive 26): engine.tracedSheets has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (17 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/engine/lintground.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"1334b4db2304c3221a691949d392aabf4285aa623a2b37e6a1b066437283c7e4"}},{"ruleId":"D2","level":"warning","message":{"text":"mcpSession.call (cognitive 26): mcpSession.call has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/remote.go"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e478675941b10de412cd27e084cda0081c8e1239281f92d78fb0c16c1ce3a7"}},{"ruleId":"D2","level":"warning","message":{"text":"docs.Chunkify (cognitive 25): docs.Chunkify has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 5 (9 pts), boolean chains 4 (nesting depth added 10). Of this number, 14 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/docs/chunk.go"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"054111cc12344db5b0c80ae21bb0b6766ad28647f55e50c36ad80b72150f2259"}},{"ruleId":"D2","level":"warning","message":{"text":"docs.parseTree (cognitive 25): docs.parseTree has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 4, loops 3 (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/docs/pageindex.go"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d781cf7f1009a659724daa9d7737d2c26a197fbb257b19ef007da2aeb7ede4"}},{"ruleId":"D2","level":"warning","message":{"text":"docs.classify (cognitive 25): docs.classify has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14, boolean chains 11. Of this number, 16 points are the body\u0027s own statements and 9 belong 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/docs/pageindex.go"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ffcec4ba80c5d8c359b080dd3233738a3897487eb85a6dd3be5301b6742cd2"}},{"ruleId":"D2","level":"warning","message":{"text":"engine.unifiedHunks (cognitive 25): engine.unifiedHunks has cognitive complexity 25 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 4 (11 pts), boolean chains 2 (nesting depth added 13). 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/engine/diff.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c5ec0cd2ce69a37fa25c35498b2d67d2583059337008b24df43236ae64cb8f3"}},{"ruleId":"D2","level":"warning","message":{"text":"driver.run_task (cognitive 25): driver.run_task has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 7, error handling 3 (6 pts), if/else 3 (5 pts), loops 4, ternaries 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":"eval/lab/labdriver/driver.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e388f9989541d5ae679c4860a34ecb181fc60ce391a54d3c0700dcd474c8a0"}},{"ruleId":"D2","level":"warning","message":{"text":"analysis.Tools (cognitive 24): analysis.Tools has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 4, loops 3, match/switch 1 (nesting depth added 5). None of this is in the body itself: all 24 points belong to 2 function literals inside it that branch (lines 126, 93). 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/analysis/register.go"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"c350a5c5566ba59c4c31ec1c7238ad893d8221939e43653ed6b605220c3dfdd7"}},{"ruleId":"D2","level":"warning","message":{"text":"api.events (cognitive 24): api.events has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/api/api.go"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c20bfdc66626bf62b9d0682fe14b4fa27bfb329e2fa62e2a966c3edf7578b3"}},{"ruleId":"D2","level":"warning","message":{"text":"docs.Verify (cognitive 24): docs.Verify has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 2, loops 1 (nesting depth added 6). 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/docs/verify.go"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2f168440ee36eac7f724cf8a36114698c6ed4e97efa1562aac25eba37d907d"}},{"ruleId":"D2","level":"warning","message":{"text":"engine.placeRequirement (cognitive 24): engine.placeRequirement has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 3 (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/engine/requirement.go"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dee36096ca2ce811b0c32dd63be2d1fce01debfe14a81efe3dfbc4b61d8e395"}},{"ruleId":"D2","level":"warning","message":{"text":"run.Record (cognitive 24): run.Record has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 5, loops 1 (nesting depth added 3). Of this number, 12 points are the body\u0027s own statements and 12 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/engine/steps.go"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"2379fc4271921e0410489860edecf711b8e3ad29307a6cc54ddb83e358d15d94"}},{"ruleId":"D2","level":"warning","message":{"text":"Manage.Manage (cognitive 24): Manage.Manage has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 6 (14 pts), boolean chains 10 (nesting depth added 8). Of this number, 19 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. 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":"ui/src/screens/Manage.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"6590ecb4543387255d98356f4d0c33789dab836b6e285d40e19ecfbe4d283f85"}},{"ruleId":"D2","level":"warning","message":{"text":"analysis.Handles (cognitive 23): analysis.Handles has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 5 (8 pts), boolean chains 4 (nesting depth added 9). Of this number, 22 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/analysis/numbers.go"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"d72c0ed7287857a0d13d9538de0bfe27e2147fa99f6c9d53f62213cf0405150f"}},{"ruleId":"D2","level":"warning","message":{"text":"api.handler (cognitive 23): api.handler has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 5). Most of this is not in the body itself: 1 of the 23 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 78, 105, 67, \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/api/api.go"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88efd87ee006c02d26776e68fffe2d45fa8fac5208a89072405f393b05b7672"}},{"ruleId":"D2","level":"warning","message":{"text":"docs.align (cognitive 23): docs.align has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 5 (8 pts), boolean chains 7 (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/docs/vision.go"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"b347224dd74bd2b376b9d43ffcc9c91cacd05f4a7dd6873b8567630c57fcce13"}},{"ruleId":"D2","level":"warning","message":{"text":"engine.admissionLine (cognitive 23): engine.admissionLine has cognitive complexity 23 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 6 (10 pts), boolean chains 1 (nesting depth added 10). 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/engine/committee.go"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1dc7f23a2fe7a6a3660800cc617879fece294c2b821929c30943eafd124ff0"}},{"ruleId":"D2","level":"warning","message":{"text":"aliasJoin.Call (cognitive 23): aliasJoin.Call has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (6 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/engine/register.go"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"96deb51a51ca427b6097e2b1c9c9c62933682a9d404af4cf72a10aeb0800ce1f"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine.TestCall (cognitive 23): Engine.TestCall has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 6, match/switch 2, loops 1 (nesting depth added 1). Of this number, 22 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/engine/custom.go"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"322e7574fa2713e594d504189a3daf2af02e51def39178943e6e0e2872ab2a8f"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.PutFile (cognitive 23): Store.PutFile has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 4, loops 1, match/switch 1 (nesting depth added 5). Most of this is not in the body itself: 8 of the 23 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 85, 72). 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/store/files.go"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b866a01f5a034c25bf8ee307ebcb4dbeefe09e9d182cacff3d925e7bce1a3d3f"}},{"ruleId":"D2","level":"warning","message":{"text":"Manage.Detail (cognitive 23): Manage.Detail has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 16, ternaries 4 (5 pts), if/else 2 (nesting depth added 1). Of this number, 22 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":"ui/src/screens/Manage.tsx"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"564242a02e1831bb3a0347f3d414e8bb0ad02135719f8a2b54d08fb3d078eb3b"}},{"ruleId":"D2","level":"warning","message":{"text":"provider.fetchKeys (cognitive 22): provider.fetchKeys has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 4, match/switch 1 (2 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/auth/oidc.go"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2cb072af7255623e9289dd47f4136f4b5e66606416fe48b6524288069fb315"}},{"ruleId":"D2","level":"warning","message":{"text":"Service.TranscribePending (cognitive 22): Service.TranscribePending has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 6, 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/docs/jobs.go"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e7b0cdab5e821b62871e497b34b6320675cc1c6adf8c4dcaf1637b69f327d6"}},{"ruleId":"D2","level":"warning","message":{"text":"Service.readPage (cognitive 22): Service.readPage has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 7, 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/docs/vision.go"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d9c1b47f699a66dba1a92dfeea1cfbcb3b3e510fefa1bb2da3320fbc09b56a"}},{"ruleId":"D2","level":"warning","message":{"text":"engine.dedupeDocBlocks (cognitive 22): engine.dedupeDocBlocks has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 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":"internal/engine/quality.go"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c024cf08137110cedccfff3314aac30af6e0ae48e11950eaa839e38e7d5e375"}},{"ruleId":"D2","level":"warning","message":{"text":"engine.order (cognitive 22): engine.order has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 6 (8 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/engine/sweeporder.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a3c9a782200c0120d28c50a1d89a0d9a27cb74a7840e11b110d78bcdf11220"}},{"ruleId":"D2","level":"warning","message":{"text":"Request.check (cognitive 22): Request.check has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 10, if/else 4 (8 pts), loops 3 (4 pts) (nesting depth added 5). 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/model/client.go"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dfad767210c8eb32bedccf4318fd6c93d131ebc9b7f3fb3c60d89fdc853e8e1"}},{"ruleId":"D2","level":"warning","message":{"text":"storetest.takeSlot (cognitive 22): storetest.takeSlot has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 5 (11 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/store/storetest/slots_unix.go"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d616c9cd8c4288dc2dbcccc699892240d4ef93ef96186b61bd2d8654ae831c0"}},{"ruleId":"D2","level":"warning","message":{"text":"provider.verify (cognitive 21): provider.verify has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 10, if/else 9, match/switch 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/auth/oidc.go"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb15c82b8ad47cb1725e5b233eb052ae3cdd099ea785eb2400081b9cac11886"}},{"ruleId":"D2","level":"warning","message":{"text":"docs.bestSpan (cognitive 21): docs.bestSpan has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2, 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/docs/verify.go"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b8695f3e158e989c08256b7d77ec84cab76d6a8aab098bb14cfbfb6978e495"}},{"ruleId":"D2","level":"warning","message":{"text":"engine.literalOrigin (cognitive 21): engine.literalOrigin has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 11, if/else 7 (8 pts), match/switch 2 (nesting depth added 1). Most of this is not in the body itself: 7 of the 21 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 146, 136, 171). 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/engine/lintground.go"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"1920450626ff773075d412e94efce03ff6ec6dd5d099a4760eede4af6ae78f07"}},{"ruleId":"D2","level":"warning","message":{"text":"policy.Allow (cognitive 21): policy.Allow has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 6 (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/engine/policy.go"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b10d8996aba7cda297d6f3ed2d323eda6e58d9b1309e77285cdcac5e7d1db0"}},{"ruleId":"D2","level":"warning","message":{"text":"analysis.statesScale (cognitive 20): analysis.statesScale has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 12, if/else 4 (7 pts), loops 1 (nesting depth added 3). 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, 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/analysis/figread.go"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab178141d8fce9928cee4212ab15151581b366a21a75cd1c7368b8fc897acac"}},{"ruleId":"D2","level":"warning","message":{"text":"analysis.resolve (cognitive 20): analysis.resolve has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 6, match/switch 1 (nesting depth added 3). 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: 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/analysis/numbers.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dfa7c1ed21b2d4711b8072133763a7c78ccdbd1371e6512c1f0ac23e6cf45ea"}},{"ruleId":"D2","level":"warning","message":{"text":"docs.normalizeCells (cognitive 20): docs.normalizeCells has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (6 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/docs/verify.go"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"168151653bcaee6a2b18e11cc4ecaa6981b9674b346f496e06abc48a10883f32"}},{"ruleId":"D2","level":"warning","message":{"text":"Service.embed (cognitive 20): Service.embed has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). 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":"internal/docs/embed.go"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15a4ad888d0951d8f7420310f2d5637873723178a1e674413048994bf403788"}},{"ruleId":"D2","level":"warning","message":{"text":"engine.snippet (cognitive 20): engine.snippet has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 11, if/else 5, loops 4. Of this number, 17 points are the body\u0027s own statements and 3 belong to 3 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/engine/computed.go"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b3287e17456cc8251c30f568a33348dc42005209f4832fdb3341fd11214b77"}},{"ruleId":"D2","level":"warning","message":{"text":"engine.checkAnswer (cognitive 20): engine.checkAnswer has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, match/switch 2 (3 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/engine/deviation.go"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8db6b98d2e5b3057921a3f1ab8f5c5de4e0c147788d761cc0149127dfc22186"}},{"ruleId":"D2","level":"warning","message":{"text":"engine.lineDiff (cognitive 20): engine.lineDiff has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (9 pts), if/else 3 (5 pts), boolean chains 4, match/switch 1 (2 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":"internal/engine/diff.go"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceeeaecdb8b602c9fba8d23a03af7db14c49dc4ebeb00ef668f2c392eb88bbed"}},{"ruleId":"D2","level":"warning","message":{"text":"computeSet.operand (cognitive 20): computeSet.operand has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 8, if/else 6 (8 pts), match/switch 2 (3 pts), 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/engine/computed.go"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0fb857e98570168897263b235e2681b5ae90da0f4f220d38aefc0bf1ae3cdd"}},{"ruleId":"D2","level":"warning","message":{"text":"computeSet.refOperand (cognitive 20): computeSet.refOperand has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 10, if/else 8 (9 pts), match/switch 1 (nesting depth added 1). 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, 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/engine/computed.go"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e7a51f4538b5f1e4d54e0c632c926dfa0c426cc79d52bd6130b13535cc4aa11"}},{"ruleId":"D2","level":"warning","message":{"text":"computeSet.sheet (cognitive 20): computeSet.sheet has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 7, loops 4 (7 pts), if/else 4 (6 pts) (nesting depth added 5). 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, split the body into named stages: move each independent step or branch into 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/engine/computed.go"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"67aef6f4475c987f4046eb8c99b055eaf4ce752d8f68b90fecdcfe2439ffbf63"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine.Discover (cognitive 20): Engine.Discover has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (3 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/engine/custom.go"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"a667bb9938bc89d0ea39a6fc44d1fb6cb6c21535b4a3e270ebb438291ca5d334"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine.validateCustomTool (cognitive 20): Engine.validateCustomTool has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 7, match/switch 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/engine/custom.go"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1fd32feb4e47995179a3648e58793ab9ce9c9f7781cda2dd38495ad07988a41"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine.validateHookRule (cognitive 20): Engine.validateHookRule has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 14, if/else 4 (5 pts), match/switch 1 (nesting depth added 1). Of this number, 18 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/hookrules.go"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d7296f512a1ee660d4671aa02ab7c64b938553a6506e7b302fb9633870f3b6"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.ReadFile (cognitive 20): Store.ReadFile has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 2, loops 1, match/switch 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/store/files.go"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"4231e9d52df07e631b9a8c243ab1de74d4e3e9febda4e24e99486f90288f34be"}},{"ruleId":"D2","level":"warning","message":{"text":"deliver._write_docx (cognitive 20): deliver._write_docx has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (14 pts), if/else 2 (4 pts), boolean chains 2 (nesting depth added 11). 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":"eval/lab/labdriver/deliver.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"244da9d01c8a6c7a239c79ee809ddb1df7f881d856b6649f6d6b8b2517dd73dd"}},{"ruleId":"D2","level":"warning","message":{"text":"main.serve (cognitive 19): main.serve has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 4, match/switch 2 (3 pts), loops 1 (nesting depth added 3). Most of this is not in the body itself: 8 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 252). 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":"cmd/biglaw/main.go"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d0ea9cf5f32a8c56c23e3d686c9de2eaa87d92569ad6d35431cba743c38c34"}},{"ruleId":"D2","level":"warning","message":{"text":"engine.memoReadings (cognitive 19): engine.memoReadings has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (7 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/engine/cover.go"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b74862db556714b25f35a3d8754dd97a4101a0a411227f20496f37f74588c8"}},{"ruleId":"D2","level":"warning","message":{"text":"engine.polishSection (cognitive 19): engine.polishSection has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 5, loops 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/quality.go"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"117247a5d15a2540895fdc17ea1b7e7fc01957b6f1704a6ca8704c170df0c1bd"}},{"ruleId":"D2","level":"warning","message":{"text":"deliver._write_xlsx (cognitive 19): deliver._write_xlsx has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 4 (5 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval/lab/labdriver/deliver.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e433b0339f8cca1250fd70178d26f6597271c33021852b972f69b08492fb13"}},{"ruleId":"D2","level":"warning","message":{"text":"analysis.valueOf (cognitive 18): analysis.valueOf has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (3 pts), boolean chains 2, 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/analysis/numbers.go"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f215c9dbf023a36657eeab101a930def98fa7b10b3ce66af6a7ec72c244118"}},{"ruleId":"D2","level":"warning","message":{"text":"Service.upload (cognitive 18): Service.upload has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 1, 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/docs/http.go"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"228ef9ba83f5e4cb26c4028443b8800e613a7d6823264b8f661dc138ffea1d03"}},{"ruleId":"D2","level":"warning","message":{"text":"engine.reviewRule (cognitive 18): engine.reviewRule has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5, loops 2 (nesting depth added 2). Of this number, 15 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/manage.go"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"31da221dac39e3463a7d6ec297c68c50e10856bf3f16234dd4063b4970a07fdb"}},{"ruleId":"D2","level":"warning","message":{"text":"Client.send (cognitive 18): Client.send has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, 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/model/client.go"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"141db01c7b4c4049aa2878cb19099d3f53db21674372d48ba4d3f0a818f2cf6b"}},{"ruleId":"D2","level":"warning","message":{"text":"Prices.Lookup (cognitive 18): Prices.Lookup has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (6 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/model/pricing.go"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a4b170ca1ca04e77ccde2fda21cfa81aafd7f822ac26d83156fdc8b366f051"}},{"ruleId":"D2","level":"warning","message":{"text":"Registry.Register (cognitive 17): Registry.Register has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 7, if/else 4 (6 pts), loops 2, match/switch 2 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into 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/agent/registry.go"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb08143081c64faf57eb14c213a01d22b92144c7b9034e111c01b67dfa7d867"}},{"ruleId":"D2","level":"warning","message":{"text":"analysis.MaskLocators (cognitive 17): analysis.MaskLocators has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/analysis/locators.go"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7912c3dfcab24675aabe3e303c797eb32a1edf801c6c1748893605df6886879"}},{"ruleId":"D2","level":"warning","message":{"text":"docs.ContentDisposition (cognitive 17): docs.ContentDisposition has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 7, loops 2 (nesting depth added 2). Of this number, 15 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/docs/http.go"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"651c108468ba0515f626870abf3d4c962c4f678ac8616aa308c0eda534eec8df"}},{"ruleId":"D2","level":"warning","message":{"text":"Service.Section (cognitive 17): Service.Section has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 3 (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/docs/search.go"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"6081411fede29d9ce779faf3c0e0faf65a0b4ad1b1297e3c043f5454d43cc882"}},{"ruleId":"D2","level":"warning","message":{"text":"engine.cleanSchemaText (cognitive 17): engine.cleanSchemaText has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 5). 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 647). 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/engine/remote.go"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee0813476898d2b799ff127469dc56941f504b4d0584ab48ce24c6116d8204b"}},{"ruleId":"D2","level":"warning","message":{"text":"computeSet.dateAt (cognitive 17): computeSet.dateAt has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/computed.go"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85a76c87eedabc54191550cb270c77fe7b27b6d12fc19072a4e00572ec3212b"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine.Start (cognitive 17): Engine.Start has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/runner.go"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6123a6b4c406b7cd60ba85c40e8dc628c146b375981c830435b0a7723eeb2ba"}},{"ruleId":"D2","level":"warning","message":{"text":"patterns.split_units (cognitive 17): patterns.split_units has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 1 (4 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":"eval/proofrun/patterns.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f27abaa34749912dc6ced8a22704d308847f65f878e3d90f347b7b850dda8f9"}},{"ruleId":"D2","level":"warning","message":{"text":"Documents.Reader (cognitive 17): Documents.Reader has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 14, ternaries 3. Of this number, 15 points are the body\u0027s own statements and 2 belong to 3 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":"ui/src/screens/Documents.tsx"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c88fa5e81bb42b4ee14484e11eb1456c1cbfa83fa065786efd63f2df467fa46"}},{"ruleId":"D2","level":"warning","message":{"text":"Service.callback (cognitive 16): Service.callback has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 3 (nesting depth added 1). 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: 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/auth/session.go"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a157d23f249bb68825334251f4897dda71b066832ed2f141725695114cfb16d"}},{"ruleId":"D2","level":"warning","message":{"text":"engine.citedSources (cognitive 16): engine.citedSources has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (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/engine/computed.go"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"a763cb698a8a3bb76bf78e931f18d3519de1c0cd170092efd366c2b6042e38fc"}},{"ruleId":"D2","level":"warning","message":{"text":"engine.summary (cognitive 16): engine.summary has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (4 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/engine/views.go"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"310d34ac655b4961c9c8bd4ab484814b7401d3d5a81d7303ed1d35e4bc35337e"}},{"ruleId":"D2","level":"warning","message":{"text":"figureContext.Call (cognitive 16): figureContext.Call has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/engine/figtools.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e940b2ce3ae1cfffc45770a7a43be383aa791095af37b310a64fb6f2752a03a4"}},{"ruleId":"D2","level":"warning","message":{"text":"finish.gates (cognitive 16): finish.gates has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 6, loops 1 (nesting depth added 3). Of this number, 13 points are the body\u0027s own statements and 3 belong to 3 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/engine/finish.go"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f741b070e740da011607d8cb4c06df876e85625105a2b6470e77935a4c3088c"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine.Secrets (cognitive 16): Engine.Secrets has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (5 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/engine/custom.go"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"695a7a0a2efe523011837389ec0e55a7e0b0684f17f4624bc22132a3b8921e9d"}},{"ruleId":"D2","level":"warning","message":{"text":"Client.Chat (cognitive 16): Client.Chat has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 2, loops 2 (nesting depth added 2). 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: 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/model/client.go"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a1b8c8567d8bb882574a89386d8ca0178534f2c8f5868449ba963d2f78cb32"}},{"ruleId":"D2","level":"warning","message":{"text":"Client.Embed (cognitive 16): Client.Embed has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 2, loops 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/model/embed.go"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"50154088c09969e87be25be10447cf33ab961d77447a58c470848bb2c84a91e9"}},{"ruleId":"D2","level":"warning","message":{"text":"convert._pptx_to_text (cognitive 16): convert._pptx_to_text has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (8 pts), loops 3 (7 pts), error handling 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":"eval/lab/labdriver/convert.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"f618321c924dae63b1395a23159021a966a4f483db4d3e83e080c6ff9d528b2d"}},{"ruleId":"D2","level":"warning","message":{"text":"patterns._money_regex (cognitive 16): patterns._money_regex has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), loops 2 (4 pts), ternaries 1 (4 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":"eval/proofrun/patterns.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"257a8824fba3d9921d5def73924bcdd1f4f23630dd556645016dc0f57f35b2c6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Engine: TooManyMethods \u2014 124 methods, declared across 24 files: engine/manage.go (19), engine/cover.go (12), engine/custom.go (12), engine/views.go (9), \u002B20 more file(s). The bar is 30 methods; this is 94 over it, 4.13\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/engine/runner.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5b897821683d1055edea368d2cdddc6fe39cbad9b834df16955c2f1efc8688"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: finish.check: MethodTooLong \u2014 check runs 147 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/finish.go"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d86b258decea3a294f1f4a8034c0e5a799f00e61dc5c1c844d6b73f86b23bb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Runtime.Run: MethodTooLong \u2014 Run runs 138 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\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/agent/loop.go"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"150386a1f0cfca4bc7d7b2c4668c414dbee7024963fa233168e981fe943913d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/manage.go: FileTooLong \u2014 612 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 112 over it, 1.22\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/engine/manage.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"199a27d088428f0e69ba67a9287af095a80557c80b42e20ada7b6c4902c771ab"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.coverTool: MethodTooLong \u2014 coverTool 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/engine/cover.go"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"93af743ccae9d90d511f2a1e202d15d3fe15d43f865b530f14f8f94cd014c93b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.sweepTool: MethodTooLong \u2014 sweepTool 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/engine/sweep.go"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"a903fe4b456d5551e763de230f355ef53f50b5ff8fa3f2b426d27c5267be2f07"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: analysis.Calc: FunctionTooLong \u2014 Calc runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\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/analysis/numbers.go"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1152393c8422f9bb7c104a66d6027d40c4612501e18cdf915015f6221b58ea"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Service: TooManyMethods \u2014 35 methods, declared across 8 files: docs/ingest.go (12), docs/embed.go (6), docs/search.go (5), docs/http.go (3), \u002B4 more file(s). The bar is 30 methods; this is 5 over it, 1.17\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/docs/ingest.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6e38c226f41b30a1ab996f2aec94dd3c2e9829d49cf65bf360c3f4fd6e08ba"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.deviations: MethodTooLong \u2014 deviations 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/engine/deviation.go"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"438fe5db8e3e23c372c60e0b768460c088821c9d57f5f95e779f750ad59bb88b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: hooked.Call: MethodTooLong \u2014 Call runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\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/engine/register.go"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a8787e1e3fd3629d84847bc59737abfb5d139c30c3a2031e365eb91a8401a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: main.run: FunctionTooLong \u2014 run 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":"cmd/biglaw/main.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b1af226be266fb10dd55784aa2810d47cdaaad28b4822b881138fc8d60b761"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/figures.go: FileTooLong \u2014 543 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 43 over it, 1.09\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/engine/figures.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29fdf2bc4e9d2b2692c44f75bb63c47dd588e85823ea4919f8ee869ecda2cdbc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: recorded.createTransport: FunctionTooLong \u2014 createTransport 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":"ui/src/api/recorded.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a153defe34cfa7b602ddfec22621431e5e8c16fe9048ffe079203db5d074a40"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/custom.go: FileTooLong \u2014 533 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 33 over it, 1.07\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/engine/custom.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb9fd7bed7ef6c13d1f2eb15a741feb5167467080ec9031ba1dd2a276694da9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/remote.go: FileTooLong \u2014 523 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 23 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/remote.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df98476e82b65e99be33e797571db08a6c46cac7b22db83f448a1b28c8c61548"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.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/engine/run.go"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb6c9756d2875319be1d546f583e218668f35eeafd7c6f48b50136250da110f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/Manage.tsx: FileTooLong \u2014 510 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 10 over it, 1.02\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":"ui/src/screens/Manage.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91e929a59db509f6dee9868b12c07633d42d1d2d4e2c3a73ba4e62dfc849fd2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.sweepVisits: MethodTooLong \u2014 sweepVisits 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/engine/sweep.go"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62ce8b20c9b8a6607c75e40e745db48c6ae6eb3063a295b1db15d43145bebc3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/register.go: FileTooLong \u2014 505 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 5 over it, 1.01\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/engine/register.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7baf0bbb76306c597b5d7bac9a6b9bdd1a63f7721cbae591e91ad470dc5819"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): internal/engine/finish.go:625-635 | internal/engine/finish.go:638-648 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/finish.go"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1b69c329860bcc926bfb3f2476c3b6b0a1337bf8614bb7daaffce756a332db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): internal/analysis/figread.go:515-523 | internal/engine/lint.go:667-675 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/analysis/figread.go"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bcd8b19c7ea0c1efeaa60a9663f2f85b6e7dc02f5b7d5efa7051c3cb867d2c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): internal/analysis/register.go:78-88 | internal/docs/register.go:26-35 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/analysis/register.go"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22acd1919795b748c4e3bbddefc49b928fd7641514d316994992774f84de853"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): internal/analysis/figread.go:447-455 | internal/auth/session.go:150-158 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/analysis/figread.go"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10a7ca2b44a9f1c11f3c02ae5160e1d11ff1aad4002bc2cebfa6fdda46f1107"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): internal/engine/specset.go:370-379 | internal/engine/sweeporder.go:215-224 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/specset.go"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ebab4f7d3b1277b927c4d247db323bdf45d1c49c7b5a46c3b988786bd811678"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/engine/hookrules.go:374-381 | internal/engine/ledger.go:279-286 \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/engine/hookrules.go"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"068db387981286dbc1e6e712b7fd7f475d2b4a5bd004b7ed4315f19f1a5e23a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/analysis/figread.go:516-521 | internal/engine/lint.go:668-673 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060bool\u0060 to \u0060unclear\u0060 in one and \u0060sheets []analysis.Worksheet) (ok\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/analysis/figread.go"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca38635d8035ecebce04b04967b22b5f68ed5de25458639ce1f0ec310b96b03e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/engine/cover.go:618-626 | internal/engine/sweep.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/cover.go"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f8ad80735a53535d704aaefb3be927bfbaec5a27d19ffd14792e87ef3343aa"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Engine (LCOM4 4): Engine\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/engine/runner.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ebfb7712adac8f41edc22cc07149e6593759903f12e56265264b8fc5c92de9"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Specs (LCOM4 4): Specs\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/engine/specset.go"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b269cfb09c23f62cbba9b14add1c83b8220ab705c9009837da6d3980eef1ae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/agent/loop.go: internal/agent/loop.go changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 69 in Runtime.Run at line 143. 11 of those changes were fix/bug commits, so the churn is repair rather than feature work. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/agent/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":"internal/agent/loop.go"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"92078b809d66a7d9502fb3b003edec8f91c5b4c6496e1261991f19eb0fafb86f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/engine/finish.go: internal/engine/finish.go changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in finish.check at line 266. 11 of those changes were fix/bug commits, so the churn is repair rather than feature work. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/engine/finish.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/engine/finish.go"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71f6a1fcffee793e3d791304645787e98ec1d0f8442f12a7bde8d19f6715950"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/engine/register.go: internal/engine/register.go changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in Engine.admit at line 548. 9 of those changes were fix/bug commits, and the other 15 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/engine/register.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/engine/register.go"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62093bfc9d89c99c4e6311fe43d95a738eb2ce18581d7c0bbabeeb070e42745"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: cmd/biglaw/main.go: cmd/biglaw/main.go changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in main.run at line 60. 12 of those changes were fix/bug commits, so the churn is repair rather than feature work. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- cmd/biglaw/main.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/biglaw/main.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f7c8c6613aeb2ab01c8ce3fabef5d0db953b2a4b21bc25873f4a47d22342cd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/engine/sweep.go: internal/engine/sweep.go changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in Engine.sweepTool at line 377. 11 of those changes were fix/bug commits, so the churn is repair rather than feature work. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/engine/sweep.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/engine/sweep.go"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ed444b7824d2cf1ce28998347372c8c11c43369c2a06c322d55f1e67a3578e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/engine/deviation.go: internal/engine/deviation.go changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in Engine.deviations at line 376. 7 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/engine/deviation.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/engine/deviation.go"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e35acf26c007917b85be045626760d5dc0c4b231abadec4692cde412dab24c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/engine/ledger.go: internal/engine/ledger.go changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in Engine.ledgerTool at line 297. 7 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/engine/ledger.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/engine/ledger.go"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"911cf12650fdbd5793b7370b4c795618bc08bdea2f37bc14751ccf4f7fe4402e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/engine/run.go: internal/engine/run.go changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in Engine.execute at line 24. 7 of those changes were fix/bug commits, and the other 8 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/engine/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/engine/run.go"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb96232950ad028501d9819c86f3aeb149994e35cd03e53fc25fd2ed72baf66f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/engine/manage.go: internal/engine/manage.go changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in engine.describeItem at line 263. 9 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/engine/manage.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/engine/manage.go"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d878060016e3d52afe03323d475d627e3ecf7717ec7ae9bb880a673a4718eaf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/screens/Manage.tsx: ui/src/screens/Manage.tsx changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in Manage.History at line 534. 8 of those changes were fix/bug commits, and the other 8 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- ui/src/screens/Manage.tsx\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":"ui/src/screens/Manage.tsx"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"760e8c773c04ad098f88905ffec9854fe580d3fe2dd782f93d50453de5a9e936"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/screens/Task.tsx: ui/src/screens/Task.tsx changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in Task.TaskScreen at line 21. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- ui/src/screens/Task.tsx\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":"ui/src/screens/Task.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21bc46c5baf3b23cfce951ee07deaced3240cfda3561133488d9037c53b004a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/analysis/numbers.go: internal/analysis/numbers.go changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 73 in analysis.Calc at line 199. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/analysis/numbers.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/analysis/numbers.go"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c310d423835affd27e0d86272a6d1afc36792c79a1e53d10f09004da44d0442"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: cmd/biglaw/config.go: cmd/biglaw/config.go changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in main.Load at line 77. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- cmd/biglaw/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":"cmd/biglaw/config.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"5292d347239971580120b55667bdde256515c50fc3adc87b7b1b89461e4bb634"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/docs/vision.go: internal/docs/vision.go changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in Service.readScans at line 106. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/docs/vision.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/docs/vision.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d091c43d604b9ef85bcb4c7d6a286179662898a1d0da6292194fc7d87476d68"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/engine/render.go: internal/engine/render.go changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in Engine.render at line 259. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/engine/render.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/engine/render.go"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8a1c2b5a61431862105e71f367a999d0dac1766de67a78241954ce26b0f320"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/engine/hookrules.go: internal/engine/hookrules.go changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in engine.validateHookRefs at line 673. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/engine/hookrules.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/engine/hookrules.go"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5804cbde21473cf6beb12b738b3e762236300928f9305d9fc6d8735df8206a8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/analysis/join.go: internal/analysis/join.go changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in analysis.rankPairs at line 166. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/analysis/join.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/analysis/join.go"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"25bbe1c9fce2ad0eaa5d3cdef216688ae135d9c0045cd5f8823b722b17187081"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/engine/custom.go: internal/engine/custom.go changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in Engine.TestCall at line 635. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/engine/custom.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/engine/custom.go"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"666425cb71dc5ada37759e3087f6cd0c813e170b9fccd6521f23c0bb5d33454b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/engine/figures.go: internal/engine/figures.go changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in engine.valueStated at line 588. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/engine/figures.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/engine/figures.go"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"e300b825dc22d53d88b4ce7e8540336ab6d87fa51feaa2f77558e52cde560376"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/loc.py: scripts/loc.py changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in loc.measure at line 159. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- scripts/loc.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/loc.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8e02f558f1a79aa467fdccef68c3da71e01b3983d2683cdad7245136c45476"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/engine/cover.go: internal/engine/cover.go changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in Engine.coverTool at line 121. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/engine/cover.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/engine/cover.go"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"894bc4089448a75144a427eecdc08887c698e57a0f8adc493b5d74d08dfc81f8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/docs/verify.go: internal/docs/verify.go changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in docs.Verify at line 52. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/docs/verify.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/docs/verify.go"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"43102b2edfe5aeb11a4b24d1fa5abde5d91d8784a5386e11926b1991d50518af"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/docs/ingest.go: internal/docs/ingest.go changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in docs.extractPDF at line 222. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/docs/ingest.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/docs/ingest.go"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"644fc7ee2f2921f57a917986c0a658299a72b1fd9285d3e07d534f53c81fa8c7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/engine/remote.go: internal/engine/remote.go changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in engine.strictify at line 676. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/engine/remote.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/engine/remote.go"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ac366af1792f7922ccf972154eb507d82042135aa7cb8f735fb7af6a3d104b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/engine/committee.go: internal/engine/committee.go changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in Engine.committeeTool at line 47. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/engine/committee.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/engine/committee.go"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"55dd54bdfd052b15bebe326d90e7d44379b0bb67f16e34d521b221753a5f15a5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/api/api.go: internal/api/api.go changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in api.handler at line 64. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/api/api.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/api/api.go"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"90847e133bd7e851ddceaa1a7faa0e6a6adcf406fc55652db37ceac3daa8a2b9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/engine/manage_validate.go: internal/engine/manage_validate.go changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in Engine.validate 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/engine/manage_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/engine/manage_validate.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c63ae365ee86da12ad1cbd5c74ed9268656bc0ed1fa06e67d3d5ba6d71cb159"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/model/client.go: internal/model/client.go changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in Request.check at line 145. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/model/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/model/client.go"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"b886f5134293694b52ab2a73964fdab56f65d9bf212621f21e09636feb35fad4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/engine/views.go: internal/engine/views.go changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in Engine.Decide at line 348. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/engine/views.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/engine/views.go"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21987844f13d21c7361d711b0dc6237babac89124702ef737ea0ec031d43502"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/docs/search.go: internal/docs/search.go changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in Service.Section at line 243. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/docs/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/docs/search.go"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa54d6004251e9ec3df4ed40b477f2bc5a33fcafea5b07ea6d82d4ce71dc129"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/engine/policy.go: internal/engine/policy.go changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in policy.Allow at line 143. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/engine/policy.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/engine/policy.go"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"966e1e2997e227ea42b77cffc3fcd689a61171dc3b37cd0a9e6c3ee9f35b6da8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/engine/steps.go: internal/engine/steps.go changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in run.Record at line 83. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/engine/steps.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/engine/steps.go"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a309b78b7c8ddb89bf29ac46bd6a3e713168ff60adb96277b37ee4f83dd452"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/engine/judge.go: internal/engine/judge.go changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Engine.judge at line 225. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/engine/judge.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/engine/judge.go"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f5ccb46b43d26da8a67269b096260c89955affe6c726769f3a84adfd66e36b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/engine/requirement.go: internal/engine/requirement.go changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in engine.renderContext at line 333. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/engine/requirement.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/engine/requirement.go"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"b194c677deb97e38ab02e2b91f6d0111b1dbbee380974a241af508a435c65cb1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/engine/specset.go: internal/engine/specset.go changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in engine.newSpecs 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/engine/specset.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/engine/specset.go"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f88ed9950c6bbe070729c3a827e778c62660fb22ebc3c07dbb0fad86be6888"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/docs/register.go: internal/docs/register.go changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in Service.Tools 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/docs/register.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/docs/register.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55a5d5d7f01e60c6e69121ca806f31ff8ed6ae8635ab21c35690da66f4190dd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/store/files.go: internal/store/files.go changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in store.ValidName at line 209. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/store/files.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/store/files.go"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"779ee2db771919be24c4c289fc1ba46ea088dd4c7999390db7e968ca8207f01c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/analysis/register.go: internal/analysis/register.go changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in analysis.Tools at line 91. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/analysis/register.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/analysis/register.go"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"366ea1f0b9cf2f64a9b91bd792d4246d5fa813e93267adeb4067dcce007c8089"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/App.tsx: ui/src/App.tsx changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in App.App at line 35. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- ui/src/App.tsx\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":"ui/src/App.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb090fca1da7446090c92d610bf0ff146957d16749f15a0c0607f4d00e6b6fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/docs/ooxml/ooxml.go: internal/docs/ooxml/ooxml.go changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in ooxml.text 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/docs/ooxml/ooxml.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/docs/ooxml/ooxml.go"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce44ec8e4cac0a31725281eb142d15b5f68752a34ec7da8209742e47547604e2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/src/screens/Documents.tsx: ui/src/screens/Documents.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in Documents.Reader at line 156. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- ui/src/screens/Documents.tsx\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":"ui/src/screens/Documents.tsx"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6e3a8d1ef50c0216f7cc28f60d605dfacb8a8a355a2db32b9f32d01e9c94d1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/agent/registry.go: internal/agent/registry.go changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in Registry.Register at line 62. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/agent/registry.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/agent/registry.go"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"293f23a760441d733636772ed4e67f70798f7525c122c30526be19c864f47b51"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/docs/chunk.go: internal/docs/chunk.go changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in docs.tableRows at line 135. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/docs/chunk.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/docs/chunk.go"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7775a6147880c1113158703a7a04d810acc726766adcda954c3123a66069ce"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/engine/sweeporder.go: internal/engine/sweeporder.go changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in engine.toc at line 169. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/engine/sweeporder.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/engine/sweeporder.go"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf972cfdf433475c215db8290702ca277a6684ccd4fda12f90ad7d1965337c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/docs/pageindex.go: internal/docs/pageindex.go changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in docs.classify 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/docs/pageindex.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/docs/pageindex.go"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d91ba4b2113daf3c77d7c0d06b30b90a64df06c7d16f64119e578d470356b72"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/auth/session.go: internal/auth/session.go changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Service.callback at line 321. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/auth/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/auth/session.go"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a3e3b1abc1d87f1ef2dd88d21721310506da52ee124bf05a302043ff4395ef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/docs/jobs.go: internal/docs/jobs.go changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Service.TranscribePending at line 27. 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/docs/jobs.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/docs/jobs.go"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"8518cebccb3a49d78cc17458b8772600634195751f74feaeaab6b183c5a8faed"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/store/store.go: internal/store/store.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 9 (its worst body is store.CheckDSN at line 108), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cv2: bench7 fixes: figure reader cost, finish order, judge precision, observability (#55)\u201D; \u201Cv2 PR3b r1 fix: no mixed-model vectors, fair fusion for lexical-only docs, E4 measures what runs\u201D; \u201Cv2 PR3a r1 fix: bounded reader child, linear .docx text, streamed downloads, bounded section tree\u201D; \u201Cv2 PR1: fix r3 committee findings (URL credential leak, passwd-less uid, leaner checks)\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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/store/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/store/store.go"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f77af1387324020c1ac716d3d0f1ef38bc7a2704276645dfd9cb9e295396fe"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/docs/scanpdf.go: internal/docs/scanpdf.go changed 6 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is docs.pageScan at line 38), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cv2 PR3c r6 fix: beyond subtracts only whole layer words, quotes move only to whole-word copies\u201D; \u201Cv2 PR3c r5 fix: beyond compares letters and digits, layer quotes stay exact, cap named\u201D; \u201Cv2 PR3c r4 fix: short text over a page image is mixed (read, text layer kept, only added lines); ceiling 15,650\u201D; \u201Cv2 PR3c r3 fix: text over any image is text, ambiguous marks masked, readings stored as read, damaged stamp scans\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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/docs/scanpdf.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/docs/scanpdf.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d270400fbe05c7b2943926e01d3d6946d40a278b3cced4df1763b3fbf71a64"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/model/fake.go: internal/model/fake.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 13 (its worst body is Fake.Chat at line 65), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cv2: LAB round-4 fixes \u002B figure-reading agents (#54)\u201D; \u201Cv2 bench fixes: a subagent\u0027s cut-off empty answer fails the tool, not the run\u201D; \u201Cv2 PR3b r1 fix: no mixed-model vectors, fair fusion for lexical-only docs, E4 measures what runs\u201D; \u201Cv2 PR2 r2 fix: price every call from the table, vendor-id lookup, ceiling 14,500\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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/model/fake.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/model/fake.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"83da67f0d1b8787821f180b44b67562c6d2632b5e58bfda06ed0831d51a9e100"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/model/errors.go: internal/model/errors.go changed 4 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 7 (its worst body is model.providerError at line 49), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cv2: bench7 fixes: figure reader cost, finish order, judge precision, observability (#55)\u201D; \u201Cv2 bench fixes: a subagent\u0027s cut-off empty answer fails the tool, not the run\u201D; \u201Cv2 PR3c r1 fix: transcription disagreement rule, stamped scans, typed vision failures; ceiling 15,600\u201D; \u201Cv2 PR2 r1 fix: trims T1-T10, billed-failure usage, open-weights local pricing, fixed transport text\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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 21:26:55 -05:00\u0027 --until=\u00272026-11-12 21:26:55 -05:00\u0027 --full-history --no-merges -- internal/model/errors.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/model/errors.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f7933b025787ad65e4b092fdbae57435b01c51f87b34ebce7184b31c315208"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060render.yaml\u0060 makes this repository a deployable product (line 1)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"render.yaml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89250a84700619e0b3eff2e932806bd59d4b952cf4194d1420cac1592eb5e534"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060(repository root)\u0060 (28779 LoC, 215 module-visible types across 20 directories) overshoots its size bounds. 1 of 2 build unit(s) (Go, npm) overshoot their size bounds, lowering Project Cohesion to 0.0/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"go.mod"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39784e8a78933b908507d20b4610b78a7f819ed418525c8adae26ae57410589"}},{"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":"6c8631436060fab55a8b99e6c9686434ea5b5960d4e9d3c92bf5da0942c803d4"},"properties":{"commitSha":"2661d196474f97c95b504314ca3609cce9879c3b"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"a1f31e3fc38e806c632551480508ae27b2701acddad0a9d80c648ba1fc9463b3"},"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":"629fe3ecc66e7c92e95655cd793b1631367cc8dd27f9abcfbf0299456ba4a2a8"},"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":"594ba20856faebb900e8f635978e37e019356a968254d953432a089b831a6265"},"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":"c1bb7814097052b3b9e49cf20adb5ffa3c94da3abc00863955683dc4725b2e91"},"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":"77b5956e63f73573b32eacced3951798fa4bd06341075c7c2b23b48e8d87edc9"},"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":"ae4b19a624088a80ae967fa19fc6e2d3b4d86bf95f6afb9918729adad8224e32"},"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":"b15e7c4516957eb0ce628a71875180462280b3da835590c3e3ea26dfe36c7cc0"},"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":"82a1893f62fe8dee3fcdaad2e3da3e94b86729172346ee8d336b86cb9d8780c6"},"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":"c5ea7df2460666458550a24282e022db4156bbe33c951df2ac363b42978f5ff9"},"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":"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":"6a41cb48e9763af9101faa68c41430058955b45cca76527cdb5d4c7ecd8ae6bf"},"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":"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":"042324171866f4f528f3f88e418c5730264be3aee9ab13ed0fd1734fe2e247ad"},"taxa":[{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-703","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":"43565e308c4efb01602e64eaa6a54639aa13f3b6bafe1afbcd9c9d502c27d849"},"taxa":[{"id":"CWE-252","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-476","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":"cdc8d0bb7cdbc4d75d7067d5811cd1a1c25506e2c340efe19847e91628f407ff"},"taxa":[{"id":"CWE-252","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-476","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":"54bf131c0d1469deda47b1de99470abae8e7f74e0e90b6aeb51c2c980287ccf9"},"taxa":[{"id":"CWE-252","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-476","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":"2a50d1e3eee2a0338e0d549cc92cd7de99df619dc7dd3930719d037abf9c9932"},"taxa":[{"id":"CWE-252","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-476","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":"75bd4bc4084952c5673fdd07d0e8556bd4cd6308fa39c7604d116e3a746b9969"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","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":"8053c834c56f11d25344fac556c61df4be534edd993f027d8cab411e744387ca"},"taxa":[{"id":"CWE-252","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-476","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":"28cd7289c6a137f7ab795f3cc871757af71b7ba8880cd114a1b3539932a2620a"},"taxa":[{"id":"CWE-252","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-476","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":"af5c04f7f32b54c4dc1b399c5824c02780e595a5df3e787ceb528c79e1ee9254"},"taxa":[{"id":"CWE-252","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-476","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":"041f461a8b741ed83353cbe3d4dbe825e971c4f6913a0df3c7df43c0dada17a6"},"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":"61641002c5a7da7bb93dcf5a9cd503480774579b36ad60cb9a428bbc2fc21245"},"taxa":[{"id":"CWE-1333","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":"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":"fbb707834e0c461e78adda6b84e3c056324a7f050f4c97a0690d2fc57bfd0c58"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"1e892071c24fd7b936ac3ce1bdf939bf001d39b2849f13aa348bc805ff2c7c89"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"95d9fd7167d46b5e0a366be07490b40c552dc2ca3dd4351b1c8308c848666d4a"},"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":"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":"783faa4462809d86535dcec4e3c306bd1cea492b7ab2321a7a156ee497ccd1bc"},"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":"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":"26e13a3750f6348cf828631fabc3bc1c1be3cae4ebd0757f2b2f236ebbdde45c"},"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":"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":"476176a40f7dde5968156df41a3ad51fabec36db7b9ad2c78af7fdee298fccfb"},"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":"D31","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":"1f51a163f26d94ce6b6f473117dde579d091c8cbf9e59810475c94d9fc921120"}},{"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":"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":"ecaffd2462973ee26b152bcd663fc09f0c1530dbc87adfd50c578c612290ae87"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC2","level":"warning","message":{"text":"\u003Cfieldset\u003E without a \u003Clegend\u003E: A fieldset groups related controls but has no \u003Clegend\u003E to name the group. Add a \u003Clegend\u003E as its first child \u2014 or, if the group already has a visible caption beside it (or the fieldset is there only to disable its subtree and carries no group box), point aria-labelledby at that caption\u0027s id instead, which names the group without rendering a second one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/screens/Manage.tsx"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"3892f05103f2d338c1d45ca0cdeab685ba319e8b7a5e73441275db725ff88e72"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.7:1): \u0060button.primary, a.button.primary\u0060 sets color: #fff on background-color: #3b82f6 \u2014 3.7:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/styles.css"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c8c699e670161188cb8ddecc5ea2545a8c37e98cebf4ed199a7bde8f465dd7"}},{"ruleId":"AX2","level":"warning","message":{"text":"Stateful package: api: Package \u0060api\u0060 serves requests (request-handler function literals run on a goroutine per request, and every one sees the same package variables and captured values) but writes that shared state outside any lock (same; e.g. \u0060same\u0060 in \u0060RequireSignIn\u0060 at line 66). Unsynchronised concurrent writes are a data race in Go: an update is lost or a value tears, and a concurrent map write aborts the process."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/api/signin.go"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff80190366f488ddcc9ca14c4775c33df99b8d92e9f4e037b717f70da2e780b"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: Transport (30 required operations): \u0060Transport\u0060 declares 30 required operations: \u0060clients\u0060, \u0060documents\u0060, \u0060outline\u0060, \u0060section\u0060, \u0060fileUrl\u0060, \u0060upload\u0060, \u0060search\u0060, \u0060tasks\u0060, \u0060task\u0060, \u0060match\u0060, \u0060submit\u0060, \u0060cancel\u0060, \u0060decideGate\u0060, \u0060cost\u0060, \u0060events\u0060, \u0060me\u0060, \u0060manageItems\u0060, \u0060manageItem\u0060, \u0060manageHistory\u0060, \u0060manageChanges\u0060, \u0060manageSave\u0060, \u0060manageRevert\u0060, \u0060manageDelete\u0060, \u0060manageSecrets\u0060, \u0060manageSetSecret\u0060, \u0060manageDeleteSecret\u0060, \u0060manageDiscover\u0060, \u0060manageImport\u0060, \u0060manageTest\u0060, \u0060exportUrl\u0060. Counted over its REQUIRED operations \u2014 a method signature or a function-typed property with no \u0060?\u0060, once per signature; optional members and data properties are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/api/transport.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad0225e673d0854a825a67f625daeb0f3c32c31bce478da7afe4ed13339ba57"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 1/2 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060ui/package.json\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/package.json"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c93f3607eda9158092cf68e1fb90b876392fa2f0e39a22105bb624433757804"}},{"ruleId":"P4","level":"note","message":{"text":"No release approval gate: Deployment 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 reaches the release trigger goes to production unreviewed, so a mistaken merge or tag is live before anyone can stop it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/ci.yml"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}},{"ruleId":"P5","level":"warning","message":{"text":"No DR/backup evidence: A persistence guard (data volume / purge-protection) was found, but no backup, geo-recovery or RTO/RPO controls were evidenced \u2014 a volume that survives a container recreate is not a tested restore from catastrophic loss."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5daabb38c90b07af65b8738cf94ce884e90a7d8fef810d341de5c186188c8fe0"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060http.Client{\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/auth/authtest/idp.go"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa8375435f1b654fe55f061ce6e26e444043c3651e3fa1ec259fb13e20690ca"}},{"ruleId":"PF1","level":"note","message":{"text":"Benchmarks don\u0027t track allocations: A Go testing.B suite exists but nothing turns on its allocation measurement \u2014 allocations (the main way hot code pressures a garbage collector or allocator) aren\u0027t being measured."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/lint_g8_test.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b9fa1f7780efb40332ba0837a13502b9a632bcd23e240c369584fed875397d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function TaskScreen (cyclomatic 29, cognitive 27): TaskScreen has cyclomatic complexity 29 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/screens/Task.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"948bc832ab3225f3f9bdca60e86cde7e00f14b394d2607176187519d0cd1ec52"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Detail (cyclomatic 27, cognitive 24): Detail has cyclomatic complexity 27 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/screens/Manage.tsx"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"4155dd3b7e2f3ae641b81d05de87be1fb62f84473f5d52abb2e82796f0343b38"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Manage (cyclomatic 26, cognitive 19): Manage has cyclomatic complexity 26 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/screens/Manage.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"04241905a1eda34ca9e11dabdf6c38c095e11f79bdbf1505fed04a67d9aca9a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RuleFields (cyclomatic 24, cognitive 23): RuleFields has cyclomatic complexity 24 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/screens/Manage.tsx"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0f196f28ba9118138739b198f0cfd3c02dec7de3232b6f6377983a1ccc2b0c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 20): (anonymous) has cyclomatic complexity 24 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/screens/Manage.tsx"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49adcc58a998b4e71e85c9738487dc0a22d736790b8003119783e08302c8e1d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Reader (cyclomatic 23, cognitive 17): Reader has cyclomatic complexity 23 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/screens/Documents.tsx"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"b739ec7cdbefac7fc8ccefcbc7055a199d65c41e2d1f8d8202926010527fb2d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function App (cyclomatic 20, cognitive 17): App has cyclomatic complexity 20 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/App.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"542e39f56a4036c35a145b4cc714b4e78e82cd81e53dc80321ed9edf69e80ecd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RemoteFields (cyclomatic 18, cognitive 16): RemoteFields has cyclomatic complexity 18 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/screens/Manage.tsx"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb89a62229130ba195d2d0571534789714a272eb7151924f47c950c14a6f0d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function diffLines (cyclomatic 15, cognitive 18): diffLines has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/diff.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"0890fa623c15bf9d69da83312cade51b928f91a21db0565d8e9e11ad7faf7d55"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Documents (cyclomatic 15, cognitive 12): Documents has cyclomatic complexity 15 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/screens/Documents.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf51a32a3132df0ff871ccc96c8fe2b72c8af06fa16dc33c88add5b9433da28"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Matters (cyclomatic 14, cognitive 10): Matters has cyclomatic complexity 14 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/screens/Matters.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf69c5fe0307a6201004b4f4eecb35d8f6bac577c9c989b1f6185f1945f47ed2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function History (cyclomatic 13, cognitive 11): History has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/screens/Manage.tsx"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"611d0fe41e8afbf09aa2aaf35c8efbae746c9948b103ac24730a8c63f0e427dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function NewItem (cyclomatic 11, cognitive 10): NewItem has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/screens/Manage.tsx"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9361ab62b70da944a2e688cef39c6a64f4e4bf7fb4bcc2eb9ec787c304860d9"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/src/screens/Manage.tsx: 589 lines of code: ui/src/screens/Manage.tsx has 589 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/screens/Manage.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"046f07f3010a491ad75ebb1a0333aff74f3aeb18480455fe3712bfd8f41ef00c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/screens/Manage.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ea6c1a03ae346a2d88157f11e51812317f3d8aa186d6115f5201be57d22b62"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/screens/Task.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0498e3cf518ff068058566f11046d656c2a9949968d27a0aef2e973cb7caf836"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/screens/Documents.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"668c478b772f333498346b9dc5849da0d0eaf2a78d8ef1063a81627e2f2b256f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/screens/Matters.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ceefd110089d173e60fac51886c2a4a1346968857ee9cd4947424aecfcec32"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/App.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d75911ebf2ab738414b182304906f54f1478082b207fc6fe71ddb7012d03a2a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/lib.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c06fd028aeb61e4ceab594d0cd8db7511e1c684f183c774e05f40dbc0cd5b5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/Markdown.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d354a42ce73063738b42da89dbcb1aec35263f4b03168ce382552252ac83ce12"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/components/icons.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2060c05e729e79e192309d645ac234d07f3ed44bd6ddd71786924571ac02c51"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/main.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a2f2abd8ea9858a566ba522415ec529b96db867b1245042e367359c5499627"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!unicode.IsLetter(r) \u0026\u0026 !unicode.IsDigit(r)\u0060 appears character-identically in 3 files \u2014 internal/analysis/join.go, internal/engine/deviation.go, internal/engine/sweeporder.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/analysis/join.go"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"35283429b6e9ad2269c18a1f817749b24e52a20bfd14f68a9b931e3b11a7f26c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ctx.Err() != nil || errors.Is(err, errLease) || agent.EndsRun(err)\u0060 appears character-identically in 2 files \u2014 internal/engine/cover.go, internal/engine/run.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/engine/cover.go"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ad0364413ef65eef615b566ad7777aa6f4203d474a585235ebc0814c6149ec"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(ss) != 1 || len(ss[0].Readings()) != 1\u0060 appears character-identically in 2 files \u2014 internal/analysis/numbers.go, internal/engine/lintground.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/analysis/numbers.go"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9517e0256559b900776b59151976b0bb3371dd83a06fe806ce83031c82b8023"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060s.Read != nil \u0026\u0026 s.Read.Hash == textHash(body)\u0060 appears character-identically in 2 files \u2014 internal/engine/cover.go, internal/engine/lint.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/engine/cover.go"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c957cd9de468ade04dd63546aca724345451d8dfec0745abd31ad40e418edfe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060strings.TrimSpace(r.Text) == \u0022\u0022 \u0026\u0026 len(r.ToolCalls) == 0\u0060 appears character-identically in 2 files \u2014 internal/model/client.go, internal/model/fake.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/model/client.go"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b907f9ff7ce1cedb4f6506b0b266f7bf4d033350cbf985a94091159799547c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060unicode.IsControl(r) || unicode.Is(unicode.Cf, r)\u0060 appears character-identically in 2 files \u2014 internal/auth/session.go, internal/docs/pageindex.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/auth/session.go"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ea38a04ebf6181ff63a6bac33657d70ed47d7dbaaa693d42ef334f896bdf2c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060unicode.IsLetter(r) || unicode.IsDigit(r)\u0060 appears character-identically in 4 files \u2014 internal/analysis/figures.go, internal/docs/verify.go, internal/engine/quality.go, internal/engine/sweeporder.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/analysis/figures.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"726e8f4586c5bcf2d3f1766666eb6a6a7419baa79eb3b0e8e2db6b3980f77311"}},{"ruleId":"X2","level":"note","message":{"text":"Not all functions that make a request accept a context.Context or an AbortSignal: Only 4/5 functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http; net/http, net.Dial) accept a context.Context or an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a page navigated away from, a cancelled request, a shutdown, an expired deadline. Take a \u0060signal\u0060 (Go: \u0060ctx context.Context\u0060) and hand it to the request; 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":"577196fe89725f9b0e6c2faf89eceb8eb245919bd44e4439e0b0d649c1ee1c53"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: call: \u0060call\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/src/api/http.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"1586e20aab061dcfbda307f8b60e00512872deb01c3edc2309f75da6619fb5ea"}},{"ruleId":"X28","level":"warning","message":{"text":"Index access outside its own emptiness guard: \u0060k\u0060 is the result of a search that answers -1 when nothing is found, and \u0060secs[k]\u0060 uses it as a bound with no test of \u0060k\u0060 in between. When the search misses, the bound is -1 and the access panics with \u0060slice bounds out of range\u0060. Test \u0060k \u003C 0\u0060 (or use \u0060strings.Cut\u0060) before using it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/cover.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed1d3cbd0931a08e898949a79e6e70aa61970f4b304bf26c44fcabe563308b4"}},{"ruleId":"X28","level":"warning","message":{"text":"Index access outside its own emptiness guard: \u0060i\u0060 is the result of a search that answers -1 when nothing is found, and \u0060pt.it.ps[i]\u0060 uses it as a bound with no test of \u0060i\u0060 in between. When the search misses, the bound is -1 and the access panics with \u0060slice bounds out of range\u0060. Test \u0060i \u003C 0\u0060 (or use \u0060strings.Cut\u0060) before using it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/figures.go"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f14e65c6d003c5375da1a604515a4119dba093bda6171c359ec90e2a1a87b8"}},{"ruleId":"X28","level":"warning","message":{"text":"Index access outside its own emptiness guard: \u0060envVars[slices.IndexFunc(envVars, func(e envVar) bool { return e.name == name...\u0060 uses a search that answers -1 when nothing is found directly as a bound. When the search misses, the bound is -1 and the access panics with \u0060slice bounds out of range\u0060. Assign the result, test it for -1, then slice (or use \u0060strings.Cut\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/biglaw/config.go"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bcc506a60cba892160a430e9956a04f1ab6a87552bf3110ae86ac7f0b0d1e1b"}},{"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":"ui/src/api/http.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"170a2637d9d822032caec1bf5c6f31785f641a3d2e7fd08bf0f9a5fc082c86e5"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060v, _ := strconv.Atoi(m[1])\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060v\u0060 as if the call succeeded. When \u0060strconv.Atoi\u0060 fails, \u0060v\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060v\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/store/migrate.go"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89d61941d9c7192079f96a8a990d5d1e2fe0d3c8fca8a6e8276c84df0d70307"}},{"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/store/store.go"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f0fa5f84c383996eb5f5116121207956f7857a63ace5bf7684b0692b968de3b"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060data, _ := io.ReadAll(io.LimitReader(body, 16\u003C\u003C10))\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060data\u0060 as if the call succeeded. When \u0060io.ReadAll\u0060 fails, \u0060data\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060data\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/model/errors.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba92f68357c3c2e068020a7a5ffdcb684dce243b59fc62f6b9069309ce3cd8a"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060in, _ := json.Marshal(inputs[i])\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060in\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060in\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060in\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/committee.go"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"348974ecedbbb7522091a29f8ebc38f0e7093c6077dc9dcb295a288f5d266e41"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060spent, _ := e.classSpend(ctx, id)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060spent\u0060 as if the call succeeded. When \u0060e.classSpend\u0060 fails, \u0060spent\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060spent\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/committee.go"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab47d57cdbca06d15ab8c678d8caa2ca92df629b2d55ac68ccc5d80d520036eb"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060in, _ := json.Marshal(map[string]any{\u0022issueId\u0022: is.ID, \u0022question\u0022: is.Question, \u0022jurisdiction\u0022: r.t.Jurisdiction, \u0022packs\u0022: nil})\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060in\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060in\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060in\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/cover.go"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2623980471c6f2e50808b1cda84e87603b698cc1b78789a78b215c6da231246"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060in, _ = json.Marshal(map[string]any{\u0022issueId\u0022: is.ID, \u0022fids\u0022: fids, \u0022revise\u0022: coverRevise})\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060in\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060in\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060in\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/cover.go"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"38cd0e61ab21fd6d66df18ac9ebab56e7e2df5daf4afa8151a1f6eae9d3c07d5"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060in, _ := json.Marshal(map[string]any{\u0022issueId\u0022: id, \u0022fids\u0022: fids, \u0022revise\u0022: placeRevise(place[id])})\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060in\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060in\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060in\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/cover.go"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"9934c1904f558b02bbc9b2df0a538ed1e5ecf9510f45f7dcd901becefa2378ff"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060out, _ := json.Marshal(map[string]any{\u0022source\u0022: source, \u0022untrusted\u0022: true, \u0022text\u0022: page, \u0022truncated\u0022: pg.Truncated, \u0022isError\u0022: isErr})\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060out\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060out\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060out\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/custom.go"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"858e4b82249b769c6b2b4471ecad72f372c3564f6befb8b5acee32d937219c3b"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060u, _ := url.Parse(h.URL)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060u\u0060 as if the call succeeded. When \u0060url.Parse\u0060 fails, \u0060u\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060u\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/custom.go"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfda8f79e3daffa47135729342e0a6b120386e6a2603fdd487db4faa9956dcb"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060b, _ := json.Marshal(v)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060b\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060b\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060b\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/custom.go"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ee61c3076cca5f53d76e47ee9649b63924b39d5868a596b7a756d353cf8677"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060u, _ := url.Parse(origin)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060u\u0060 as if the call succeeded. When \u0060url.Parse\u0060 fails, \u0060u\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060u\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/custom.go"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"346cc2e3dc8513395b30de627822d0d708f80b2e85b572da6ba5f2bd62447932"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060ex, _ := json.Marshal(exampleFor(sch))\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060ex\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060ex\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060ex\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/custom.go"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f471c3693304148e840f1ddf938a349c40714397f6a933561faf735333f103"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060lead, _ := e.roles.Model(model.Lead)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060lead\u0060 as if the call succeeded. When \u0060e.roles.Model\u0060 fails, \u0060lead\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060lead\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/custom.go"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77d999997c1d2df563dc79da0029f70edb21135434c7ddbab9c5d99b551fbe3"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060v, _ := docs.Verify(context.Background(), doc, requirement, nil)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060v\u0060 as if the call succeeded. When \u0060docs.Verify\u0060 fails, \u0060v\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060v\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/deviation.go"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b38884f5a8cd1268ad64431333e2fff939ed2dda9097348949097270963fba"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060out, _ := json.Marshal(map[string]any{\u0022text\u0022: text, \u0022next\u0022: next})\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060out\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060out\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060out\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/figtools.go"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"3779e6a42a24ee6de8c6d97e2f292ddea546c14aee9407fd3a8795f2e252a0f5"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060out, _ := json.Marshal(map[string]string{\u0022result\u0022: s})\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060out\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060out\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060out\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/figtools.go"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c538d1f60ae8773bc8701d33d8a47c4d3285c859bf0ec4cc6d85d58ae58f447"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060data, _ := json.Marshal(map[string]any{\u0022spec\u0022: specHash, \u0022model\u0022: model, \u0022scope\u0022: scope, \u0022task\u0022: task, \u0022parties\u0022: parties, \u0022passages\u0022: in})\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060data\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060data\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060data\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/figures.go"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b66e91a77e6fed82a3d731d22ab477e4648aaa4e3f7fc0eb22af87fd50ca1e"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060input, _ := json.Marshal(map[string]any{\u0022findings\u0022: findings})\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060input\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060input\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060input\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/figures.go"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"165db48accd5b3c009186c4eaf3980c5f7e427c3d0c894643a5fde7f03c9c4f7"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060a, _ := strconv.Atoi(p)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060a\u0060 as if the call succeeded. When \u0060strconv.Atoi\u0060 fails, \u0060a\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060a\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/figures.go"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b28988d9d0f24545e91ddc8644750fceb505576fb3913d8570d80abfbecc4e"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060b, _ := strconv.Atoi(sp)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060b\u0060 as if the call succeeded. When \u0060strconv.Atoi\u0060 fails, \u0060b\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060b\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/figures.go"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c0e1ec4e0fce9ce43f7b8092d8dc49c1b3fe57201c33974045a224dd52cd6b"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060done, _ := e.rows(ctx, id, kEscalate)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060done\u0060 as if the call succeeded. When \u0060e.rows\u0060 fails, \u0060done\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060done\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/finish.go"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5f2f7c506d3aee403ae01ea105eb4b5c6ccc58c167673247f62471a3e48742"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060canon, _ = json.Marshal(v)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060canon\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060canon\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060canon\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/hookrules.go"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc8b4995a2e85932dea7bc1215d6c23a7db5f2e1e9e21874c804616fc18db56"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060body, _ := json.Marshal(payload)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060body\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060body\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060body\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/hookrules.go"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"318cb7c4a82aa176336612fd932ee98177977059319256c0bba649d78e534bad"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060text, _ := json.Marshal(map[string]any{\u0022claim\u0022: f.Claim, \u0022issueId\u0022: f.IssueID, \u0022quotes\u0022: f.Quotes})\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060text\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060text\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060text\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/hookrules.go"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"25dab3b84d8030b3fc8adc6a028c6cc5f3046ac4356ceef737a7aa8c9c2b420c"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060ex, _ := json.Marshal(checkIn)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060ex\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060ex\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060ex\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/hookrules.go"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"a661a869f5ab962be867fca8df85d21ab7dcadded0689645a8130d60a0276f49"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060ja, _ := json.Marshal(a)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060ja\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060ja\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060ja\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/judge.go"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae2275dc91c15f3dfee75b147928860ec08964f1223aac3fd68454f8cd06d1a"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060jb, _ := json.Marshal(b)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060jb\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060jb\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060jb\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/judge.go"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"987c599bf06c4989f3d9ad00ab5967fe23373172e0edd5b43c7cd7530b047c03"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060data, _ := json.Marshal(map[string]any{\u0022spec\u0022: specHash, \u0022model\u0022: model, \u0022scope\u0022: scope, \u0022docs\u0022: docs, \u0022aliases\u0022: pairAliases(aliases, x), \u0022kind\u0022: p.Kind, \u0022a\u0022: json.RawMessage(ja), \u0022b\u0022: json.RawMessage(jb)})\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060data\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060data\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060data\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/judge.go"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"402aba1b2200703aa2f7950135c2810e22aab14036d9e54c47190420759a2402"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060data, _ := json.Marshal(map[string]any{\u0022sides\u0022: sides, \u0022aliases\u0022: pairAliases(aliases, x)})\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060data\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060data\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060data\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/judge.go"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1ab6ad39b8891894cb22dfa2711590af1daef20514c29a70e41deb8c3510b8"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060p, _ := json.Marshal(pairIn(todo[0]))\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060p\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060p\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060p\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/judge.go"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"204d34997e15b921ea5087ee4a70e8a98a86b74d2ac2cf4464674bf0d21a5166"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060input, _ := json.Marshal(map[string]any{\u0022pairs\u0022: ps, \u0022aliases\u0022: pairAliases(aliases, chunk...)})\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060input\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060input\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060input\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/judge.go"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"132a1a342282352b53f087138003d192717ca80c0b84ec49d72104ac3cb49f29"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060b, _ := json.Marshal(files)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060b\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060b\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060b\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/manage.go"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6bd30be31dbe6c5d14e0f527fadb03cefc41c2b54bfb10efeda9c62226c6ab"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060of, _, _, _ := frontMatter(old[head])\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060of\u0060 as if the call succeeded. When \u0060frontMatter\u0060 fails, \u0060of\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060of\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/manage.go"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"416b00c85096741c92fed62a1cc48fd8c89064d343e8c32edf844152b58fc652"}},{"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/engine/manage_validate.go"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b38d6375b2b5da9ed3cc19dce68f1bbb66b94e6d63890a51d1928e14be2656"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060b, _ := json.Marshal(v)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060b\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060b\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060b\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/manage_validate.go"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e25edc120f06939218036ffe93544da4000fd89ac76f7d1dffa605e46a321ce"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060out, _ := json.Marshal(map[string]any{\u0022wid\u0022: nil, \u0022result\u0022: nil, \u0022unit\u0022: nil, \u0022worksheet\u0022: nil, \u0022literalOperands\u0022: nil, \u0022tableMarkdown\u0022: nil, \u0022handles\u0022: list, \u0022truncated\u0022: pg.Truncated})\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060out\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060out\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060out\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/register.go"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b11eff34cb7e4853f1991b4fb98f090ce8ec88aaaf21da00664cd73bcd7ba65"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060out, _ := json.Marshal(hookResult{Findings: []map[string]any{}, Notes: []string{\u0022withheld, nothing admitted: \u0022 \u002B v.blocked}})\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060out\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060out\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060out\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/register.go"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"1675f53ef08dbab582ff8ad647c4f28b6e8cd428199cc590a7073114d67dcc76"}},{"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/engine/register.go"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64b3406a540bf99109e4e30abae4af0b44ddcfea8a82eead524028bb314b166"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060in, _ := json.Marshal(map[string]any{\u0022documentId\u0022: id, \u0022quote\u0022: q.Quote, \u0022claim\u0022: nil})\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060in\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060in\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060in\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/register.go"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d1bcfd89cb0eb8650a6c9dc290b86991af1dd0af5084cc8ce4a84f615f1bbf"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060j, _ := json.Marshal(v)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060j\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060j\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060j\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/remote.go"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e88c981584748cbe202d330bcbf6d4d6126dd92e278353750df5909d9739a23"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060body, _ := json.Marshal(map[string]any{\u0022jsonrpc\u0022: \u00222.0\u0022, \u0022method\u0022: method})\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060body\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060body\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060body\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/remote.go"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"69133f3b0e02da75f88d878fd9ee53e0fd6ce1890ebb203caf3ca37c9f40f388"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060body, _ := json.Marshal(map[string]any{\u0022jsonrpc\u0022: \u00222.0\u0022, \u0022id\u0022: id, \u0022method\u0022: method, \u0022params\u0022: params})\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060body\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060body\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060body\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/remote.go"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"144e3648c6b414f6b0287e4cb2dade8d0e769fcd5ed8a90b1e3934d4d3e41796"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060b, _ := json.Marshal(out)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060b\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060b\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060b\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/remote.go"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"276865caa2a2725b581afcdf4dc1de260f197db2081fd530fad696bf01c521b7"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060data, _ := json.Marshal(l)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060data\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060data\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060data\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/run.go"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48b5b5773bfebdebe5adc9a3a1ca819b96255f6a69cd64087ddaff9e5b11788"}},{"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/engine/runner.go"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d2349298668bd19c82f8f9defb64e62287b9129c5552b9a74aecefadb725fc"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060grant, _ := json.Marshal(s.Grant)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060grant\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060grant\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060grant\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/steps.go"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11734923dbf2c5cc0362c43320ab6655449877567dfeb539c3ccb65a46a7cf8"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060usage, _ := json.Marshal(s.Usage)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060usage\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060usage\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060usage\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/steps.go"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"01db02a4f624becf89be16a8d2bf00c9bdbeb710624604edc3bc6115058d5965"}},{"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/engine/sweep.go"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"107696edc73cd03d01dff2d6cf90b5ef0baf7fcbdf2296dd4321bc7c50f96151"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060n, _ := strconv.Atoi(m[3])\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060n\u0060 as if the call succeeded. When \u0060strconv.Atoi\u0060 fails, \u0060n\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060n\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/sweeporder.go"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f29af84359249bdb3e62583224f46374841c636a49524eed95055819020c3a"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060b, _ := json.Marshal(v)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060b\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060b\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060b\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/views.go"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a56e8eb7caaa8a4920a36375a99bd878e2f4067cf2d306ff004f32d83896d9"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060data, _ := json.Marshal(out)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060data\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060data\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060data\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/figtest/reader.go"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"510d8d248d3bac34db22c68969d9126ff6f9764e50cf02fc38e8fe2040a82b3f"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060data, _ := json.Marshal(map[string]any{\u0022labels\u0022: labels})\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060data\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060data\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060data\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/figtest/reader.go"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab594801c9d89c3f8ae126c4e36cc2da506f10cf7bcdd6970219d3be53b42ca"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060data, _ := json.Marshal(map[string]any{\u0022verdicts\u0022: verdicts})\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060data\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060data\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060data\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/engine/figtest/reader.go"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00c845c788501786db0bfb7ffb69d30a9e6cdc195180f4b08c5c073734a55fc"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060iss, _ := url.Parse(p.issuer)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060iss\u0060 as if the call succeeded. When \u0060url.Parse\u0060 fails, \u0060iss\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060iss\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/auth/oidc.go"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e638d0fbba597c03b2d36172027eb9ea6ff582ea50de00c84163fe8bc498f45"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060b, _ := json.Marshal(p)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060b\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060b\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060b\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/auth/session.go"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ea61daf390cfcec359917fc217eeebb39c1049068453a30bbbe01dbe743693"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060after, _ := strconv.Atoi(r.URL.Query().Get(\u0022after\u0022))\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060after\u0060 as if the call succeeded. When \u0060strconv.Atoi\u0060 fails, \u0060after\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060after\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/api/api.go"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"8092a504fbcacda4970fa6f53eddfcaea8860953653b40527678b7bbad966e8d"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060data, _ := json.Marshal(v)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060data\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060data\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060data\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/api/api.go"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"0007bb2de0829b536ed5f5585f703a8c14f04f64f5a85ce0713f2c00af6ae04a"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060n, _ := strconv.Atoi(r.URL.Query().Get(\u0022limit\u0022))\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060n\u0060 as if the call succeeded. When \u0060strconv.Atoi\u0060 fails, \u0060n\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060n\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/api/manage.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"172368e72a40c5cab1696af96a17879a9f66dd94be29af3fcf069fed97ce8dad"}},{"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/api/manage.go"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"1526b08093f0e38ff4394fb454e22d459ab34cb2380947a176658df8b1b50369"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060d, _ := strconv.Atoi(m[1])\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060d\u0060 as if the call succeeded. When \u0060strconv.Atoi\u0060 fails, \u0060d\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060d\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/analysis/figures.go"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"f274dc2fcb0b38468d8a79e6956e06d2d62e7b6a2831c056b67971756171859e"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060mo, _ := strconv.Atoi(m[2])\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060mo\u0060 as if the call succeeded. When \u0060strconv.Atoi\u0060 fails, \u0060mo\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060mo\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/analysis/figures.go"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e3e72ac5b2de2b3278649eece35dd5604cf1c2a8e29916fdb3f115627c54fb"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060y, _ := strconv.Atoi(m[3])\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060y\u0060 as if the call succeeded. When \u0060strconv.Atoi\u0060 fails, \u0060y\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060y\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/analysis/figures.go"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ed1db67e758cfb610e5fd8af7e5feb8d4c9ac9cb5163d448484176b4fbcec6"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060fx, _ := x.Float64()\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060fx\u0060 as if the call succeeded. When \u0060x.Float64\u0060 fails, \u0060fx\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060fx\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/analysis/join.go"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe5559f6c11aa3f7b628b6b695e147bd105958a32447a487cf52cb4e77f6286"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060fy, _ := y.Float64()\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060fy\u0060 as if the call succeeded. When \u0060y.Float64\u0060 fails, \u0060fy\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060fy\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/analysis/join.go"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d32770aae2a16f7a82362dd45f5d1d61d55410d3bb9a11bd2f8d819e5b81285"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060y, _ := strconv.Atoi(m[1])\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060y\u0060 as if the call succeeded. When \u0060strconv.Atoi\u0060 fails, \u0060y\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060y\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/analysis/normalize.go"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b5f9ba13a8fdf572fb227ddff72f74c26d140bd8142a532e9598a814985d38"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060n, _ = strconv.Atoi(m[3])\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060n\u0060 as if the call succeeded. When \u0060strconv.Atoi\u0060 fails, \u0060n\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060n\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/analysis/numbers.go"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b24eccca0937df638a9e5a05f93c305de0224f0f06742dd3798f998ee516e34"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060key, _ := json.Marshal([]any{fn, w.Steps, holidays})\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060key\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060key\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060key\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/analysis/numbers.go"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62389d8db927251a97a8eb9b03502d884e8ff2d9c79699823b13239c1c57633"}},{"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/agent/bandit.go"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c5e76967e41178c2948110ef81dc56917a5736d43e49fdd792eb8f2d55e39e"}},{"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/agent/bandit.go"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6fdf72f2f29b245a1b105bb96c84ad24fc3b4f0728949bbae12db0012ffeae"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060b, _ := json.Marshal(struct { Error e \u0060json:\u0022error\u0022\u0060 }{e{\u0022result_too_large\u0022, fmt.Sprintf(\u0022result too large: %s returned %d bytes, over the %d this turn can hold\u0022, tool, n, limit), tool, n, limit, \u0022call \u0022 \u002B tool \u002B \u0022 again for less: the offset or next its last page named, an issueId, or a narrower query or one section\u0022}})\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060b\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060b\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060b\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agent/loop.go"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b43151e603708b2038143280603b0ef52244ce12dfbea7d78d5ba862ba3bfe6"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060body, _ := json.Marshal(struct { M []model.Message T []model.Tool }{req.Messages, req.Tools})\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060body\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060body\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060body\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agent/loop.go"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9dee8b7ab05369f457fec671e479cce95a05d088f17db1bca6d4d3a082cd7b"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060defs, _ = rt.Reg.Defs(s.Allowed)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060defs\u0060 as if the call succeeded. When \u0060rt.Reg.Defs\u0060 fails, \u0060defs\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060defs\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agent/loop.go"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"0edda866c14b69da11baafb5213bea3907cbdf1ee6e05d6b2dd6a58bfc7c7191"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060b, _ := json.Marshal(it)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060b\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060b\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060b\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agent/page.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"4950ef56d2533c07bbf1e0ce033e46dafa02fb2953056b331fe3af95274b29d3"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060b, _ := json.Marshal(s)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060b\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060b\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060b\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agent/page.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c36bbd8b0e0ea2e8d443035ddf7d25c34405f692d1bff099760f014464ebaa"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060b, _ := json.Marshal(string(r))\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060b\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060b\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060b\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agent/page.go"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc46656f84c2657f40218ea4226352e2f297880ac73506a153baedfa6210f7d"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060vals, _ := json.Marshal(s.Enum)\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060vals\u0060 as if the call succeeded. When \u0060json.Marshal\u0060 fails, \u0060vals\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060vals\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agent/schema.go"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25cffad42c3cb2b28acaaf6920c59fdccb9a39299f9c300fdcf182196d0d7ce"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060f, _ := x.Float64()\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060f\u0060 as if the call succeeded. When \u0060x.Float64\u0060 fails, \u0060f\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060f\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/agent/schema.go"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fe0a69dcb62f1298ce0e56ffa4a1676af1c644b713ee8fab738c67676556da"}},{"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/biglaw/config.go"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a56d2feeb574f70a28ce7682a8320dc118e0690dce5a9e1e3b19b7185f75b0a"}},{"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/biglaw/main.go"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09f2f55775d3668c832915a30843f822bcad92ac3e5519f3ef83775786b81f0"}},{"ruleId":"X5","level":"note","message":{"text":"Null assertions (\u0060!\u0060) override strict null checking: ~4.5 \u0060!\u0060 null assertions per 1k TypeScript source lines \u2014 11 assertion(s) across the 2443 source line(s) of the 21 TypeScript file(s) read, which is the only code the operator asserts anything in (a \u0060!\u0060 in a \u0060.js\u0060 file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: ui/src/screens/Manage.tsx (10), ui/src/main.tsx (1). Each one tells the compiler to trust the author about null, suppressing the very diagnostic \u0060strictNullChecks\u0060 exists to produce. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1d83a7c69636a6290f63000d5c19b2073be1fa772f51977532af9ca6f745fc2a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060Hint\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/agent/bandit.go"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ea4675d5215e03f997922a4b11a28c63fac61d9d3eb2c19de3b3dcb34e0c1c"}}],"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-1333","guid":"11a336ce-63de-c45c-845e-29ca1e8df13d","name":"CWE-1333","shortDescription":{"text":"CWE-1333"},"helpUri":"https://cwe.mitre.org/data/definitions/1333.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-248","guid":"64b58946-d244-a556-a48a-f82fcd4f4186","name":"Uncaught Exception","shortDescription":{"text":"Uncaught Exception"},"helpUri":"https://cwe.mitre.org/data/definitions/248.html"},{"id":"CWE-252","guid":"78915dc5-e486-f858-bc3c-aa570ad9010d","name":"Unchecked Return Value","shortDescription":{"text":"Unchecked Return Value"},"helpUri":"https://cwe.mitre.org/data/definitions/252.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-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-476","guid":"df404eaf-4a12-445c-9306-241412f65220","name":"NULL Pointer Dereference","shortDescription":{"text":"NULL Pointer Dereference"},"helpUri":"https://cwe.mitre.org/data/definitions/476.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-540","guid":"1a9db5db-e5bb-ae5d-935a-d1b4e9ee080b","name":"Inclusion of Sensitive Information in Source Code","shortDescription":{"text":"Inclusion of Sensitive Information in Source Code"},"helpUri":"https://cwe.mitre.org/data/definitions/540.html"},{"id":"CWE-703","guid":"fa730aa9-95e4-845e-83fa-8169f2cf339e","name":"Improper Check or Handling of Exceptional Conditions","shortDescription":{"text":"Improper Check or Handling of Exceptional Conditions"},"helpUri":"https://cwe.mitre.org/data/definitions/703.html"},{"id":"CWE-704","guid":"50bd74b4-a921-5159-8671-99fd7e78c810","name":"CWE-704","shortDescription":{"text":"CWE-704"},"helpUri":"https://cwe.mitre.org/data/definitions/704.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-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-939","guid":"12397742-f2c4-8254-8012-482c3356c551","name":"CWE-939","shortDescription":{"text":"CWE-939"},"helpUri":"https://cwe.mitre.org/data/definitions/939.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"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":"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-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":35,"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."]}]}