{"$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":"D7","name":"Architectural Integrity","shortDescription":{"text":"Architectural Integrity"},"helpUri":"https://codehealth.canine.dev/dimensions/D7"},{"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":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"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":"AC4","name":"Keyboard semantics","shortDescription":{"text":"Keyboard semantics"},"helpUri":"https://codehealth.canine.dev/dimensions/AC4"},{"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":"AXR1","name":"Runtime accessibility","shortDescription":{"text":"Runtime accessibility"},"helpUri":"https://codehealth.canine.dev/dimensions/AXR1"},{"id":"C2","name":"Access Controls","shortDescription":{"text":"Access Controls"},"helpUri":"https://codehealth.canine.dev/dimensions/C2"},{"id":"DM6","name":"Domain \u2194 infrastructure boundary","shortDescription":{"text":"Domain \u2194 infrastructure boundary"},"helpUri":"https://codehealth.canine.dev/dimensions/DM6"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"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":"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":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"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":"Review.run_review_body! (cyclomatic 190): Review.run_review_body! has cyclomatic complexity 190 (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":"lib/hive/stages/review.rb"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4c30ba35e09a95f8c0c5266051fe745319dd91576d90717be1c3b40160f03e"}},{"ruleId":"D1","level":"warning","message":{"text":"Agent.spawn_and_wait (cyclomatic 110): Agent.spawn_and_wait has cyclomatic complexity 110 (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":"lib/hive/agent.rb"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"3644f3094c670383137b7611a735c18147225207acab6bb7ef2a1f6f88d0293b"}},{"ruleId":"D1","level":"warning","message":{"text":"Supervisor.run_worker (cyclomatic 99): Supervisor.run_worker has cyclomatic complexity 99 (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":"lib/hive/attempts/supervisor.rb"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f0bccb9efa8a5f72c546c3727397dd133387f24bbd09aadba5480866add583"}},{"ruleId":"D1","level":"warning","message":{"text":"Base.spawn_agent (cyclomatic 70): Base.spawn_agent has cyclomatic complexity 70 (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":"lib/hive/stages/base.rb"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdce01736065cd650e6f319a0b848826e333a84150d4720d868379224d31bdd2"}},{"ruleId":"D1","level":"warning","message":{"text":"Dispatcher.admit (cyclomatic 55): Dispatcher.admit 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":"lib/hive/attempts/dispatcher.rb"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"41153f4d51c8874f3a344b2f717345a4171ccf02e87068d606b9eef899f4356b"}},{"ruleId":"D1","level":"warning","message":{"text":"OperationalStatus.reasons_for (cyclomatic 54): OperationalStatus.reasons_for has cyclomatic complexity 54 (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":"lib/hive/operational_status.rb"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"1efdc492e8e4bea2f263e66957f0f04d2c93f6d617e5c8591ab057779c5a1287"}},{"ruleId":"D1","level":"warning","message":{"text":"MergeClassifier.normalize_snapshot (cyclomatic 50): MergeClassifier.normalize_snapshot has cyclomatic complexity 50 (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":"lib/hive/refactor_patrol/merge_classifier.rb"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc25a83ed3c91cc29a8972e39cee5d9995ef28f191f62176a02db498cf8ec73"}},{"ruleId":"D1","level":"warning","message":{"text":"UserService.complete_apply_transition (cyclomatic 50): UserService.complete_apply_transition has cyclomatic complexity 50 (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":"lib/hive/user_service.rb"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e28873d8c04c7ac593e5493b7ae66ba31f649e498b979604a68a7fbc9c74ac1"}},{"ruleId":"D1","level":"warning","message":{"text":"GithubGateway.merged_prs_page (cyclomatic 49): GithubGateway.merged_prs_page has cyclomatic complexity 49 (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":"lib/hive/refactor_patrol/github_gateway.rb"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2c6fafa8e2e37db61e17c940b36eb19499cf5720b3b46b7a3a575c13d66cf4"}},{"ruleId":"D1","level":"warning","message":{"text":"UserService.complete_removal (cyclomatic 48): UserService.complete_removal has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/user_service.rb"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3487c78fc840adfa4032f503e61a4834d4365d1718ab586e44be4b82266720"}},{"ruleId":"D1","level":"warning","message":{"text":"Dispatcher.tick (cyclomatic 47): Dispatcher.tick has cyclomatic complexity 47 (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":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ee02ac0925499a3f1861d806414eebab0c697e8d3f1389847f3045e32f7a49"}},{"ruleId":"D1","level":"warning","message":{"text":"DraftPrReceipt.validate (cyclomatic 46): DraftPrReceipt.validate has cyclomatic complexity 46 (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":"lib/hive/draft_pr_receipt.rb"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44ba73b134a399ee3df088c4deb45aae0eb391fb2eba066d3eb1d7e9dea3887"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskClosure.validate_receipt! (cyclomatic 44): TaskClosure.validate_receipt! has cyclomatic complexity 44 (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":"lib/hive/task_closure.rb"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0947e5e2bf082457b64c69bb69f99dad45c3628ad018585b4eff162bcaaa7c"}},{"ruleId":"D1","level":"warning","message":{"text":"UserService.rollback_apply (cyclomatic 43): UserService.rollback_apply has cyclomatic complexity 43 (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":"lib/hive/user_service.rb"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"72eb855c38ea90cb7e2d52da0c54030e6960da7d4ac608ef8e3a2014ae5f2005"}},{"ruleId":"D1","level":"warning","message":{"text":"Dispatcher.dispatch_request! (cyclomatic 42): Dispatcher.dispatch_request! has cyclomatic complexity 42 (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":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":4199}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06d603a329ceb21f74d1b353c6d1f4e5ffd8e1280ab59aa6d3cd8e5560d0759"}},{"ruleId":"D1","level":"warning","message":{"text":"RecoveryCoordinator.request (cyclomatic 42): RecoveryCoordinator.request has cyclomatic complexity 42 (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":"lib/hive/daemon/recovery_coordinator.rb"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"6639525b17ef30123fbb1a00db5e78a79aae832a8b5b121f4d81d9419f228a87"}},{"ruleId":"D1","level":"warning","message":{"text":"Orchestrator.resume_review (cyclomatic 42): Orchestrator.resume_review has cyclomatic complexity 42 (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":"lib/hive/plan_review/orchestrator.rb"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"67af94a9b2af93b72888c5ad7bc6b66051f11295e3adf74dc702c8bde38903f9"}},{"ruleId":"D1","level":"warning","message":{"text":"Supervisor.run (cyclomatic 41): Supervisor.run has cyclomatic complexity 41 (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":"lib/hive/attempts/supervisor.rb"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"53120ccb0c2dc9e09baf86d567e470c9105f8214c1b5eff7ca959e73d212ce33"}},{"ruleId":"D1","level":"warning","message":{"text":"Dispatcher.record_completed (cyclomatic 41): Dispatcher.record_completed has cyclomatic complexity 41 (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":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":1535}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad72b35ed0761a02534653a754e44cf7dabeedf1d3fa059eeb126a0a40d3b4ae"}},{"ruleId":"D1","level":"warning","message":{"text":"RecoveryCoordinator.resume (cyclomatic 41): RecoveryCoordinator.resume has cyclomatic complexity 41 (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":"lib/hive/daemon/recovery_coordinator.rb"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce24344792fb5dc64269c8dae2486432421139f3dccc94f9b0c90debdb420c0"}},{"ruleId":"D1","level":"warning","message":{"text":"JobStore.assert_matching_discovery_payload! (cyclomatic 41): JobStore.assert_matching_discovery_payload! has cyclomatic complexity 41 (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":"lib/hive/refactor_patrol/job_store.rb"},"region":{"startLine":2191}}}],"partialFingerprints":{"codehealthFindingId/v1":"cefebc9aa49ca59b4c47f82f7ad79e4789565c5836467ebf62b0691fdc28e959"}},{"ruleId":"D1","level":"warning","message":{"text":"UserService.apply_current (cyclomatic 41): UserService.apply_current has cyclomatic complexity 41 (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":"lib/hive/user_service.rb"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9768c60c1c520836f4a92dbe5a8a07dd080d848e83d62b6a1fa0b1698d473e"}},{"ruleId":"D1","level":"warning","message":{"text":"Dispatcher.process_dispatch_request_iteration (cyclomatic 40): Dispatcher.process_dispatch_request_iteration 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":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":3919}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e25a54505a666ff8e75c0923c8f45bb51cc8b6b03c677c11a047a2854994844"}},{"ruleId":"D1","level":"warning","message":{"text":"Artifacts.run_outcome_evidence! (cyclomatic 40): Artifacts.run_outcome_evidence! has cyclomatic complexity 40 (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":"lib/hive/stages/artifacts.rb"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d406e5569e8f42862a4862a7937e06f545a9f2ef76eb6eb16a5397eed4c7bf4"}},{"ruleId":"D1","level":"warning","message":{"text":"PostMergeBatchStore.parse_record (cyclomatic 38): PostMergeBatchStore.parse_record has cyclomatic complexity 38 (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":"lib/hive/refactor_patrol/post_merge_batch_store.rb"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"51455008828c9c0978e05de1a819cc73304eb9ac195d1797c6b83f026ef7e987"}},{"ruleId":"D1","level":"warning","message":{"text":"Dispatcher.dispatch_patrol_with_admission (cyclomatic 37): Dispatcher.dispatch_patrol_with_admission has cyclomatic complexity 37 (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":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":3370}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e326085a04cb23751f56a83cb2930ad3c8f5b95dfb18f64026714f95d1ebf4e"}},{"ruleId":"D1","level":"warning","message":{"text":"PrManifest.validate_v3! (cyclomatic 36): PrManifest.validate_v3! has cyclomatic complexity 36 (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":"lib/hive/refactor_patrol/pr_manifest.rb"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecdb04335afe89a5f8173b8d59ae9095f49b0c9eb569c0231ffba37e9381b221"}},{"ruleId":"D1","level":"warning","message":{"text":"ScheduledSliceProducer.validate_result_record! (cyclomatic 36): ScheduledSliceProducer.validate_result_record! has cyclomatic complexity 36 (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":"lib/hive/refactor_patrol/scheduled_slice_producer.rb"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe8dbbce4647668cf7821741c81ae4575dbc5f80195087f4fdadc4d7adf0eda"}},{"ruleId":"D1","level":"warning","message":{"text":"RefactorPatrol.validate_mode! (cyclomatic 35): RefactorPatrol.validate_mode! 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":"lib/hive/commands/refactor_patrol.rb"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba87fd2dc373cf2719904bd87b22dc0c20788b522d0d45349f7810aad0502933"}},{"ruleId":"D1","level":"warning","message":{"text":"Execute.run_pass (cyclomatic 35): Execute.run_pass has cyclomatic complexity 35 (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":"lib/hive/stages/execute.rb"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"f581a5b71808cad6be3299b396839458a2713e1c67f0359581e28a7cb06b2133"}},{"ruleId":"D1","level":"warning","message":{"text":"CiFix.run_ci_once (cyclomatic 35): CiFix.run_ci_once 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":"lib/hive/stages/review/ci_fix.rb"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f245bce23d5ef962260d23cd8f5f715959426f7bf41a4ca854fbaf7913048c4"}},{"ruleId":"D1","level":"warning","message":{"text":"Artifacts.verify_directory! (cyclomatic 35): Artifacts.verify_directory! has cyclomatic complexity 35 (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":"packaging/release_candidate/artifacts.rb"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"3008624831cde67390989cced63c31b311f9931867daa2e1609c0834f491c5c3"}},{"ruleId":"D1","level":"warning","message":{"text":"Router.classify (cyclomatic 34): Router.classify has cyclomatic complexity 34 (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":"lib/hive/bot/router.rb"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"089cf9358495a861137f70ee2e0ee0b203030fe9a4554ccbc905fc25d336a309"}},{"ruleId":"D1","level":"warning","message":{"text":"CommandOperation.call (cyclomatic 34): CommandOperation.call has cyclomatic complexity 34 (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":"lib/hive/command_operation.rb"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41195ba229782b45e2361908ab38660a06aa846c62952928fb6959643e0c5a4"}},{"ruleId":"D1","level":"warning","message":{"text":"CommandReceiptStore.reserve (cyclomatic 34): CommandReceiptStore.reserve has cyclomatic complexity 34 (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":"lib/hive/command_receipt_store.rb"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"53531c6144aad718c0ef33b74214bb2dfe4b4650d8c6505fd47a7e25c1b6fb3b"}},{"ruleId":"D1","level":"warning","message":{"text":"Supervisor.command_success_text (cyclomatic 32): Supervisor.command_success_text has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/bot/supervisor.rb"},"region":{"startLine":1502}}}],"partialFingerprints":{"codehealthFindingId/v1":"221fa49418ff65d331b55253fb030628ac33a1b06a95e43ba8a1a16219d9d046"}},{"ruleId":"D1","level":"warning","message":{"text":"Run.marker_next_action (cyclomatic 32): Run.marker_next_action has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/run.rb"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d039049c7e7ce7d7b28e8b6a39e532278ac162364d78343cc86d72c06fbe221"}},{"ruleId":"D1","level":"warning","message":{"text":"OperationalStatus.recovery_payload (cyclomatic 32): OperationalStatus.recovery_payload has cyclomatic complexity 32 (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":"lib/hive/operational_status.rb"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2d81a997769a76c97cf1d8fb9449145657587163362cafb36c1c7fbde98aa7"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskClosure.validate_receipt_semantics! (cyclomatic 32): TaskClosure.validate_receipt_semantics! has cyclomatic complexity 32 (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":"lib/hive/task_closure.rb"},"region":{"startLine":1255}}}],"partialFingerprints":{"codehealthFindingId/v1":"df370c78586283e3f0a96781dd1a81e4badb4f14b0cdb4d837d1ca3c61eb2655"}},{"ruleId":"D1","level":"warning","message":{"text":"BubbleModel.bubble_key_to_keymap (cyclomatic 32): BubbleModel.bubble_key_to_keymap has cyclomatic complexity 32 (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":"lib/hive/tui/bubble_model.rb"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40b9c54b2a71c95afccfa9bebaf4647bfb349cc374df5249822b382604c2a84"}},{"ruleId":"D1","level":"warning","message":{"text":"Dispatcher.handle_row (cyclomatic 31): Dispatcher.handle_row has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":2296}}}],"partialFingerprints":{"codehealthFindingId/v1":"6accf56ebdd170b1e3e20599170cddb85d63c5c31a55a59625133a89381a2a1d"}},{"ruleId":"D1","level":"warning","message":{"text":"RefactorPatrolMergeProgressStore.validate_scan! (cyclomatic 31): RefactorPatrolMergeProgressStore.validate_scan! has cyclomatic complexity 31 (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":"lib/hive/daemon/refactor_patrol_merge_progress_store.rb"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af2512e15a1bc062088b2ee6c469b9998b48f9e167d985cda45c23f98792c01"}},{"ruleId":"D1","level":"warning","message":{"text":"Scheduler.reconcile_existing! (cyclomatic 31): Scheduler.reconcile_existing! has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/llm_wiki_bootstrap/scheduler.rb"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2d9ebde55241d9d7bac8432d30eaeeacf3c0930e311eb8c61e07c1e5919870"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskMeta.write (cyclomatic 31): TaskMeta.write has cyclomatic complexity 31 (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":"lib/hive/task_meta.rb"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"552eb4f87b566d90d7129c07d2bf0d7490f1eb8c8529077f787f678662f37c4c"}},{"ruleId":"D1","level":"warning","message":{"text":"Publication.publication_state (cyclomatic 31): Publication.publication_state has cyclomatic complexity 31 (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":"lib/hive/task_workspace/publication.rb"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"021b5bb3ec90a994605b7eeafecdbc6e495ee65fb914a34f8370bad0ce177b48"}},{"ruleId":"D1","level":"warning","message":{"text":"Controller.validate_state (cyclomatic 30): Controller.validate_state has cyclomatic complexity 30 (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":"lib/hive/github_publication.rb"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"d033baf1eafe041fc16c0419a2cc8d38cb6d40d6c4d66745f66535e746dc8a5e"}},{"ruleId":"D1","level":"warning","message":{"text":"Review.run_reviewers (cyclomatic 30): Review.run_reviewers has cyclomatic complexity 30 (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":"lib/hive/stages/review.rb"},"region":{"startLine":1913}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e81151ad8b5add96d9149cdcbe6373fafd1c6c97c64424d3eb1d6f4e90dfed2"}},{"ruleId":"D1","level":"warning","message":{"text":"CiFix.run! (cyclomatic 30): CiFix.run! has cyclomatic complexity 30 (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":"lib/hive/stages/review/ci_fix.rb"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"009b5be9ab2b953463123863b4deefa8dd26d351154da2acbba9cdf6e7542665"}},{"ruleId":"D1","level":"warning","message":{"text":"Agent.handle_exit (cyclomatic 29): Agent.handle_exit has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/agent.rb"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8503f6797a562b07a39d4e3fcb52ace4c55fd32af6266f610a8cc69c67ab6a"}},{"ruleId":"D1","level":"warning","message":{"text":"RefactorPatrolScheduler.reserve (cyclomatic 29): RefactorPatrolScheduler.reserve has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/refactor_patrol_scheduler.rb"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"645b58f9f2d0ab19bb703f8c334cb98e778b3422bb4091137c7cd094dfbf25b7"}},{"ruleId":"D1","level":"warning","message":{"text":"ManualRetry.call (cyclomatic 29): ManualRetry.call has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/recovery/manual_retry.rb"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc595632bf51f8efc56b40af08498c2453db90fd22956c2c2a1c33abc265763f"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentWorktree.run! (cyclomatic 29): AgentWorktree.run! has cyclomatic complexity 29 (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":"lib/hive/stages/agent_worktree.rb"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"3400f1ae6f7a25e954512c75aa6148099071bf3979ff4e9407e79333f87ef946"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskMeta.read (cyclomatic 29): TaskMeta.read has cyclomatic complexity 29 (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":"lib/hive/task_meta.rb"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"807733e586c9a3b1688f90513549111d3a4b62a028f2e778ad6aa15f2c467456"}},{"ruleId":"D1","level":"warning","message":{"text":"KeyMap.grid_message (cyclomatic 29): KeyMap.grid_message has cyclomatic complexity 29 (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":"lib/hive/tui/key_map.rb"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3e5a093abd0ac0ffe3655b7afe66b0d4a5e2056162f084b3ebb5252c78dea6"}},{"ruleId":"D1","level":"warning","message":{"text":"Controller.validate_state_relations! (cyclomatic 28): Controller.validate_state_relations! has cyclomatic complexity 28 (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":"lib/hive/github_publication.rb"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"d097d1d696165f378548386362db13d6cd20411f7cf5080a13be1b23676a2238"}},{"ruleId":"D1","level":"warning","message":{"text":"ReviewPublicationRecovery.decode (cyclomatic 28): ReviewPublicationRecovery.decode has cyclomatic complexity 28 (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":"lib/hive/review_publication_recovery.rb"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6fbcb36395501be0a70bfb69bd3c0983975cc5fafff9c5721b50ad19186bee8"}},{"ruleId":"D1","level":"warning","message":{"text":"Review.finalize_review_outcome (cyclomatic 28): Review.finalize_review_outcome 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":"lib/hive/stages/review.rb"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b42917616b492e75fcdc7e275a5a620a54f41f3cfc7d87705bdeb64a0492616"}},{"ruleId":"D1","level":"warning","message":{"text":"UserService.complete_lifecycle (cyclomatic 28): UserService.complete_lifecycle 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":"lib/hive/user_service.rb"},"region":{"startLine":1495}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7692bde6cd7cf3c2771887348acdb43502dfc2333e80b9aba221a0c61cc75da"}},{"ruleId":"D1","level":"warning","message":{"text":"CaptureToolkit.prepare! (cyclomatic 27): CaptureToolkit.prepare! has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/artifacts/capture_toolkit.rb"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6c902545843b17132df768b38bcffdd8def3780a62eb6c1e334a29089ae543"}},{"ruleId":"D1","level":"warning","message":{"text":"CommandOperation.replay (cyclomatic 27): CommandOperation.replay has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/command_operation.rb"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4723eab4bd691e29e3215c4a53b7ffdb1e8beec2376528c0ee1bbf4a52d0a1"}},{"ruleId":"D1","level":"warning","message":{"text":"Answer.decode_binding (cyclomatic 27): Answer.decode_binding 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":"lib/hive/commands/answer.rb"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"9876acdeb33c4f6488484de8174ae15739292d79f505378650b2a30fd64cd3ab"}},{"ruleId":"D1","level":"warning","message":{"text":"Dispatcher.dispatch_request_pending_item (cyclomatic 27): Dispatcher.dispatch_request_pending_item has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"93880e82cf8b62adba85c81c07b6d22c78086b7a2f00012ca50b5da1c526fa89"}},{"ruleId":"D1","level":"warning","message":{"text":"JobRecordValidator.validate_post_merge_source! (cyclomatic 27): JobRecordValidator.validate_post_merge_source! 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":"lib/hive/refactor_patrol/job_record_validator.rb"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4378060765ad1b7f8d2730436c6d0d8146564ce5a792a217198bd4c25b5611d"}},{"ruleId":"D1","level":"warning","message":{"text":"Database.transaction (cyclomatic 27): Database.transaction has cyclomatic complexity 27 (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":"lib/hive/runtime_control_plane/database.rb"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6daa6cb13a5c8c7ef0d5050f10902a190e62e8c59ae322b26cc51efdbb4898d"}},{"ruleId":"D1","level":"warning","message":{"text":"RegistryClient.validate_version_entry! (cyclomatic 27): RegistryClient.validate_version_entry! 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":"lib/hive/workflow_package/registry_client.rb"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"d255398923dc5ad739c6a18038d6cbf08841112fd35d301b3debf74dc5def5aa"}},{"ruleId":"D1","level":"warning","message":{"text":"BaselineCatalog.verify_dependency_closure! (cyclomatic 27): BaselineCatalog.verify_dependency_closure! 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":"packaging/release_candidate/baseline_catalog.rb"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c054f715b867f703200244cb23d47e4f186993f9dd863681bbc3ec51fe0cf17"}},{"ruleId":"D1","level":"warning","message":{"text":"Record.validate_receipt! (cyclomatic 26): Record.validate_receipt! has cyclomatic complexity 26 (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":"lib/hive/attempts/record.rb"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f5e2673d7f27061b83b7a14790ac299c3526ed2392cd898d17538ee2d1d0b8b"}},{"ruleId":"D1","level":"warning","message":{"text":"Status.collect_rows (cyclomatic 26): Status.collect_rows has cyclomatic complexity 26 (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":"lib/hive/commands/status.rb"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8f83a2032d7af54767b040ea23664f5211face44d33b06c41c1816e9a28636"}},{"ruleId":"D1","level":"warning","message":{"text":"Config.validate_reviewer_entries! (cyclomatic 26): Config.validate_reviewer_entries! has cyclomatic complexity 26 (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":"lib/hive/config.rb"},"region":{"startLine":3230}}}],"partialFingerprints":{"codehealthFindingId/v1":"9333c8ec4ddf9988653b87957f4656bc2697c1fdfb54ad77aead116e28451880"}},{"ruleId":"D1","level":"warning","message":{"text":"Config.validate_daily_digest! (cyclomatic 26): Config.validate_daily_digest! has cyclomatic complexity 26 (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":"lib/hive/config.rb"},"region":{"startLine":4554}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec542a9f29714a50ef1ff2eb12e4e78c4bdbc9f2dde29c0dd8a045baac53aa9"}},{"ruleId":"D1","level":"warning","message":{"text":"Policy.decide (cyclomatic 26): Policy.decide has cyclomatic complexity 26 (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":"lib/hive/daemon/policy.rb"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"859af72d7488b9d356ad7e1064f8ec02a9b8f16a855e202a9d6a6bb7595cee18"}},{"ruleId":"D1","level":"warning","message":{"text":"RecoveryCoordinator.manual_evidence (cyclomatic 26): RecoveryCoordinator.manual_evidence has cyclomatic complexity 26 (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":"lib/hive/daemon/recovery_coordinator.rb"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc895117bae01efd2a8038a365a7da290c38025f1cdc178c4f63b3fad76be49"}},{"ruleId":"D1","level":"warning","message":{"text":"Projection.project (cyclomatic 26): Projection.project has cyclomatic complexity 26 (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":"lib/hive/patrol_fix/projection.rb"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"387d8f5dfd31fd0df64fa13db900614de3884adbf5514f6989031705be2d81bc"}},{"ruleId":"D1","level":"warning","message":{"text":"Proposals.evidence! (cyclomatic 26): Proposals.evidence! 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":"lib/hive/proposals.rb"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"74bae74ec3c4ed941e99b2f381be3a74ed41e56d1553c80d794c151a3f253fc1"}},{"ruleId":"D1","level":"warning","message":{"text":"JobRecordValidator.validate_publication_receipts! (cyclomatic 26): JobRecordValidator.validate_publication_receipts! has cyclomatic complexity 26 (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":"lib/hive/refactor_patrol/job_record_validator.rb"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a35484a4a0ec97c5b8d1e1fc23b1190710f0791a4df0ff05fd0aca54e983825"}},{"ruleId":"D1","level":"warning","message":{"text":"Store.audit_tail (cyclomatic 26): Store.audit_tail has cyclomatic complexity 26 (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":"lib/hive/review_budget/store.rb"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"817ffefc6a8eae53852ac5fbf1374858cfcf897a404437b9f9ae40a2932b44de"}},{"ruleId":"D1","level":"warning","message":{"text":"Usage.call (cyclomatic 26): Usage.call has cyclomatic complexity 26 (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":"lib/hive/task_workspace/usage.rb"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf9229203be1a778f549b046435eec29691f53b35f0582f71251f4969292fff"}},{"ruleId":"D1","level":"warning","message":{"text":"PublishReceipt.validate_optional_fields! (cyclomatic 26): PublishReceipt.validate_optional_fields! 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":"lib/hive/workflow_package/publish_receipt.rb"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4e6a68518322e42ef5c148c959b12e4c353e7900953c9b9462856fa993ce86"}},{"ruleId":"D1","level":"warning","message":{"text":"ReleaseSelector.validate_ordinary_ci! (cyclomatic 26): ReleaseSelector.validate_ordinary_ci! has cyclomatic complexity 26 (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":"packaging/release_candidate/release_selector.rb"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"d750e9f731e8d9f7bcfd1638f8dd628339b9257367efeb88e850c6c73fef6716"}},{"ruleId":"D1","level":"warning","message":{"text":"Agent.initialize (cyclomatic 25): Agent.initialize has cyclomatic complexity 25 (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":"lib/hive/agent.rb"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c2c7b5914bd64ab179b0057fe86ad75c96e71c07b69a46074772d93ef96c7f"}},{"ruleId":"D1","level":"warning","message":{"text":"Reconciler.completion_first_disposition (cyclomatic 25): Reconciler.completion_first_disposition has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/attempts/reconciler.rb"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"144e01d9047641b97d10544d310c9e14344a9a39cba066f34eb0f2e95e381a8f"}},{"ruleId":"D1","level":"warning","message":{"text":"Babysit.stop_daemon (cyclomatic 25): Babysit.stop_daemon has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/babysit.rb"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e2703d2c5df307e4fe2668f516b4c3e14c3fea6e9357b2b25982ad75171eee"}},{"ruleId":"D1","level":"warning","message":{"text":"Run.report_text (cyclomatic 25): Run.report_text has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/run.rb"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a9aa410298fd9ec429175f0271f95b235e815b9b390247a441d43b2ca828d3"}},{"ruleId":"D1","level":"warning","message":{"text":"AdmissionStore.validate_record! (cyclomatic 25): AdmissionStore.validate_record! has cyclomatic complexity 25 (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":"lib/hive/patrol_fix/admission_store.rb"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bef471664eaceb1bd767f39b9e5c8a6778f5f722fa5507b9557771f29e7893b"}},{"ruleId":"D1","level":"warning","message":{"text":"WorktreeReceipt.read (cyclomatic 25): WorktreeReceipt.read has cyclomatic complexity 25 (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":"lib/hive/patrol_fix/worktree_receipt.rb"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"950cdaf120545f31b38742dd449c5f524ccbfbc16d875071233510775bdc630e"}},{"ruleId":"D1","level":"warning","message":{"text":"JobRecordValidator.validate_discovery_attempts! (cyclomatic 25): JobRecordValidator.validate_discovery_attempts! has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/job_record_validator.rb"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"4676e656e50fb6f21742153e389eebde0c55c2fc3683f493a2387c6df1a4b51d"}},{"ruleId":"D1","level":"warning","message":{"text":"Artifacts.run_role! (cyclomatic 25): Artifacts.run_role! has cyclomatic complexity 25 (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":"lib/hive/stages/artifacts.rb"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"7309dc32230b2495959f51c8345efe71f7797c848ce3ac86a508f3e441f5552e"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectCaptureProvider.supervise_provider_in_custody (cyclomatic 25): ProjectCaptureProvider.supervise_provider_in_custody has cyclomatic complexity 25 (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":"lib/hive/web/project_capture_provider.rb"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e884cd28be6a20ea806ab5277f45f90a6e22aa5e4b6e42a54840a1f0bd52c34"}},{"ruleId":"D1","level":"warning","message":{"text":"MutationsController.mutation_input! (cyclomatic 25): MutationsController.mutation_input! has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/controllers/api/v1/mutations_controller.rb"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a0e0f2a1386d5662817cce7701476774bdde82cb25232e3506475cc7d7f899"}},{"ruleId":"D1","level":"warning","message":{"text":"Probe.call! (cyclomatic 24): Probe.call! has cyclomatic complexity 24 (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":"components/agent-cli-runtime/lib/agent_cli_runtime/opencode/probe.rb"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1b914d7311c74af80f181d8de1b8dc08b44dcd97eed95c0f966b1561d07351"}},{"ruleId":"D1","level":"warning","message":{"text":"Record.validate! (cyclomatic 24): Record.validate! has cyclomatic complexity 24 (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":"lib/hive/attempts/record.rb"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b51a927a07d7e662d0cb3aaeab4959ef22e430f199fcb36946987887e92164"}},{"ruleId":"D1","level":"warning","message":{"text":"CLI.daemon (cyclomatic 24): CLI.daemon has cyclomatic complexity 24 (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":"lib/hive/cli.rb"},"region":{"startLine":2183}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf10225300dfd60952f0563554439da8b602726543eda459eb6d91e638291ef"}},{"ruleId":"D1","level":"warning","message":{"text":"RefactorPatrol.run_cycle (cyclomatic 24): RefactorPatrol.run_cycle has cyclomatic complexity 24 (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":"lib/hive/commands/refactor_patrol.rb"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d50e20989972320bb29cb39dffc6b3aa36adb1dc2e918ddc8cd72b024d96d6c"}},{"ruleId":"D1","level":"warning","message":{"text":"OperationalStatus.classify (cyclomatic 24): OperationalStatus.classify has cyclomatic complexity 24 (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":"lib/hive/operational_status.rb"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"727a304266bf67ff980d4dd1eaafb065b395bb0d3e61d4f0ca5eaddd99e4bf10"}},{"ruleId":"D1","level":"warning","message":{"text":"AdmissionStore.validate_state_invariants! (cyclomatic 24): AdmissionStore.validate_state_invariants! 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":"lib/hive/patrol_fix/admission_store.rb"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"0745f9b3ff3d69d53798cc08ca6460126fbd01aecb896b450629fc001259e694"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskClosure.normalize_input (cyclomatic 24): TaskClosure.normalize_input has cyclomatic complexity 24 (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":"lib/hive/task_closure.rb"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ae1bca3403d3c865493947dd2d6074c94b9ac47bf06309718df63c6bbe0ad9"}},{"ruleId":"D1","level":"warning","message":{"text":"ReleaseSelector.validate_producer! (cyclomatic 24): ReleaseSelector.validate_producer! has cyclomatic complexity 24 (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":"packaging/release_candidate/release_selector.rb"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75f0779a37b326b823d8e2ff3ecacadf2febc11b0c6bbf79dc690648968a98a"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskDisplay.status (cyclomatic 24): TaskDisplay.status has cyclomatic complexity 24 (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":"web/app/models/task_display.rb"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"230d2da3640c0fccd9483eb5e8ca1b1afc4e3a5359cad4b31a4e720d775e5f0a"}},{"ruleId":"D1","level":"warning","message":{"text":"Evidence.gateway_request (cyclomatic 23): Evidence.gateway_request 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":"lib/hive/commands/evidence.rb"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb99301b30f5418dd227aa98bfd6d75c78cf81728dd17fb73c182dd536862cd"}},{"ruleId":"D1","level":"warning","message":{"text":"Config.register_project (cyclomatic 23): Config.register_project 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":"lib/hive/config.rb"},"region":{"startLine":1799}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba0369db58dd66a86116a1dd561cf30038edb34c09b53218ba713be71c42d6a"}},{"ruleId":"D1","level":"warning","message":{"text":"Dispatcher.row_pending_item (cyclomatic 23): Dispatcher.row_pending_item 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. This is NOT this file\u0027s highest cyclomatic complexity: Dispatcher.observe_dispatch_outcome (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac45cca30957af7b596755463b5964a2eb28606040c02e3533d783ed88ba938"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectSource.boundary_attention (cyclomatic 23): ProjectSource.boundary_attention 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":"lib/hive/daily_digest/project_source.rb"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f6f4db35179ff550dad95f1083ae3a0496d12c2d58a79ea5019a09520b13b4"}},{"ruleId":"D1","level":"warning","message":{"text":"Controller.validate_record! (cyclomatic 23): Controller.validate_record! has cyclomatic complexity 23 (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":"lib/hive/github_publication.rb"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e1b561b0e79a64d067dba73109e8adfe59ba3c035fc5c9e39415a88b3db89a"}},{"ruleId":"D1","level":"warning","message":{"text":"AttemptDiagnostic.validate! (cyclomatic 23): AttemptDiagnostic.validate! 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":"lib/hive/patrol_fix/attempt_diagnostic.rb"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdddc3c0c7c0e0e20b3cfac5f6bb8abe593d66f434818c5c5a685d5699873d79"}},{"ruleId":"D1","level":"warning","message":{"text":"CeDocReview.call (cyclomatic 23): CeDocReview.call 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":"lib/hive/plan_review/adapters/ce_doc_review.rb"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a3daea9e602ace22896816b91a5b28787a0bd275d96ffb8473ca4c264dea5a"}},{"ruleId":"D1","level":"warning","message":{"text":"JobStore.claim_action! (cyclomatic 23): JobStore.claim_action! 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":"lib/hive/refactor_patrol/job_store.rb"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"a938e54f7a66ba4d70be9a287935fe99aaea44804c530f23c29b0a2b88f542e7"}},{"ruleId":"D1","level":"warning","message":{"text":"ReviewBudget.observe (cyclomatic 23): ReviewBudget.observe 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":"lib/hive/review_budget.rb"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98aa3a77276ba8c087f6052ae737690d3dc20780a1682c211f4c68a6c367291"}},{"ruleId":"D1","level":"warning","message":{"text":"Store.validate_grant! (cyclomatic 23): Store.validate_grant! has cyclomatic complexity 23 (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":"lib/hive/review_budget/store.rb"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0236a595cc6b76f78689e09cf5b2a00772acaa550384c542150593433cec8f1"}},{"ruleId":"D1","level":"warning","message":{"text":"ReviewPublicationRecovery.project (cyclomatic 23): ReviewPublicationRecovery.project 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":"lib/hive/review_publication_recovery.rb"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8e6f0a1bea23882a5ced6d4a5b5a20ca0eb8e31a5aab96e57fc0e6f4082440"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentReport.parse_sections (cyclomatic 23): AgentReport.parse_sections 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":"lib/hive/stages/agent_report.rb"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"1938a67db730a7cff64674033fcea92798de3234e35c012e5dee19bfca474758"}},{"ruleId":"D1","level":"warning","message":{"text":"Council.run! (cyclomatic 23): Council.run! has cyclomatic complexity 23 (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":"lib/hive/stages/council.rb"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33d1848a0a34ee19d2e8fabeecf7baf218c890ace6e35b51cb0dcb669cb09cf"}},{"ruleId":"D1","level":"warning","message":{"text":"Finalize.run! (cyclomatic 23): Finalize.run! 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":"lib/hive/stages/finalize.rb"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4fa1354e1a970f82496e4a4c174c5266a1b9883bd4b4c61f48dcb17d165c3f"}},{"ruleId":"D1","level":"warning","message":{"text":"Review.run_ci_gates (cyclomatic 23): Review.run_ci_gates 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":"lib/hive/stages/review.rb"},"region":{"startLine":2656}}}],"partialFingerprints":{"codehealthFindingId/v1":"7670afc7e55994c68adcffc9dd1216553a4f2ca1cb4119cf35a4ef519e43e5c8"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonlReader.call (cyclomatic 23): JsonlReader.call 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":"lib/hive/task_workspace/jsonl_reader.rb"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"97795fbaf207def2055e078f913c7841d1efafa52ff8dc274efad8afd3c0cd1c"}},{"ruleId":"D1","level":"warning","message":{"text":"HiveBetterleaksPackage.download_archive (cyclomatic 23): HiveBetterleaksPackage.download_archive 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":"packaging/betterleaks.rb"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c33b2aae4609c031b08d98cf3703c6465664aa0382ec60383866138004cc48f"}},{"ruleId":"D1","level":"warning","message":{"text":"ResultParser.parse_inspection (cyclomatic 22): ResultParser.parse_inspection has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"components/agent-cli-runtime/lib/agent_cli_runtime/opencode/result_parser.rb"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd2a0aeecba42f2359ab1537a200b1f00870c9e5ecebe199be907e71bba82b8"}},{"ruleId":"D1","level":"warning","message":{"text":"Proof.inspect_media! (cyclomatic 22): Proof.inspect_media! 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":"lib/hive/artifacts/outcome_evidence/proof.rb"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"859df72204d78326c03f410ed39fbaaa4a89a58cca6fdc772e5b5342f7cf5c69"}},{"ruleId":"D1","level":"warning","message":{"text":"Repository.observe_task_source (cyclomatic 22): Repository.observe_task_source has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/attempts/repository.rb"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"a080a649c78668a26edb4486827aa85fafc98e71839c78e26c06b434c5a28170"}},{"ruleId":"D1","level":"warning","message":{"text":"GhPolicy.api_read_only? (cyclomatic 22): GhPolicy.api_read_only? has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/babysitter/gh_policy.rb"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"2abf4f86cf52dc3148117a0d22afbfbc41600ffb611e831a91570c713645c08e"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectTick.run (cyclomatic 22): ProjectTick.run has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/babysitter/project_tick.rb"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b683d410b48c3b8d85e28110dfd9a09fa62a37bb65d92eeff2539e9323ec8a8a"}},{"ruleId":"D1","level":"warning","message":{"text":"Daemon.start_daemon (cyclomatic 22): Daemon.start_daemon has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/daemon.rb"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"43fa4e742020a4dc10cfdb22e3e72fe61bd309a497e4b70aff61caf0a2d851d2"}},{"ruleId":"D1","level":"warning","message":{"text":"Config.validate_artifact_capture! (cyclomatic 22): Config.validate_artifact_capture! has cyclomatic complexity 22 (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":"lib/hive/config.rb"},"region":{"startLine":2906}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bee936569662b3faed1f868241744f2e757b26cbef0036b9d21e456e499e34f"}},{"ruleId":"D1","level":"warning","message":{"text":"Dispatcher.reconcile_attempt_deliveries (cyclomatic 22): Dispatcher.reconcile_attempt_deliveries has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Dispatcher.observe_dispatch_outcome (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":4757}}}],"partialFingerprints":{"codehealthFindingId/v1":"1acccf5cf3362d7c5f4621d8483a0ed80751edd5a19f645c27583081520658c2"}},{"ruleId":"D1","level":"warning","message":{"text":"StaleAgentHealer.heal_attempt_losses (cyclomatic 22): StaleAgentHealer.heal_attempt_losses has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/stale_agent_healer.rb"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e738521b035130364ff3d62851cf25632f150a819a9afae0e6303ce7538263"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectSource.collect_journal (cyclomatic 22): ProjectSource.collect_journal has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daily_digest/project_source.rb"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"65eef1ebd2c0e4062be79a2db35b8e16134fcf57c9eb5fbb13c4e8126ce4b271"}},{"ruleId":"D1","level":"warning","message":{"text":"Record.prepare (cyclomatic 22): Record.prepare has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daily_digest/record.rb"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7f891686a0c87fcf4d49d94869765ab03000fcb442daaa0c5186e3ff7aaba8"}},{"ruleId":"D1","level":"warning","message":{"text":"ManagedStore.read_setup_outbox (cyclomatic 22): ManagedStore.read_setup_outbox has cyclomatic complexity 22 (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":"lib/hive/module_package/managed_store.rb"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"295b195d58883dfc9096cc5caeb2d018129c75b158ecaa2d05a3b0b676253ccf"}},{"ruleId":"D1","level":"warning","message":{"text":"Transition.validate_intent (cyclomatic 22): Transition.validate_intent has cyclomatic complexity 22 (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":"lib/hive/patrol_fix/transition.rb"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"924d52b0cb08b17bbec1cd380a7b4e8c2daf294478814189e7647303f25a24a1"}},{"ruleId":"D1","level":"warning","message":{"text":"DecisionTriage.validate! (cyclomatic 22): DecisionTriage.validate! has cyclomatic complexity 22 (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":"lib/hive/plan_review/decision_triage.rb"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99368d88334110f8b9554af993024ed1c42e9a2e58c78b4b9b76f0c316578ff"}},{"ruleId":"D1","level":"warning","message":{"text":"GithubGateway.merged_pr_details (cyclomatic 22): GithubGateway.merged_pr_details has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/github_gateway.rb"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f273397a805f1632cb562dc5c86b59c62f08d6da945d4b12979f52898d13dd"}},{"ruleId":"D1","level":"warning","message":{"text":"JobRecordValidator.validate_job! (cyclomatic 22): JobRecordValidator.validate_job! has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/job_record_validator.rb"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"765e867a7d9f334cd2227fe792e2a35ac166e41e2df40fcd15435e7419a4fe85"}},{"ruleId":"D1","level":"warning","message":{"text":"FixGuardrail.scan_diff (cyclomatic 22): FixGuardrail.scan_diff has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/review/fix_guardrail.rb"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00ccc1a22ab2df5375f966421ec5586751e3b4b352d4d027afea9293b829c41"}},{"ruleId":"D1","level":"warning","message":{"text":"Publication.read_pr (cyclomatic 22): Publication.read_pr has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_workspace/publication.rb"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb061d41beaecfaa4a9753d3ed01a843a1cdec1d039b8e371b89e8a763f33870"}},{"ruleId":"D1","level":"warning","message":{"text":"BrowserGateway.publish_media! (cyclomatic 21): BrowserGateway.publish_media! 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":"lib/hive/artifacts/browser_gateway.rb"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c295f9071763977a6e0f6baef764e54778cee133d3bc5356a391de051a561d8"}},{"ruleId":"D1","level":"warning","message":{"text":"Context.validate_task_binding! (cyclomatic 21): Context.validate_task_binding! 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":"lib/hive/attempts/context.rb"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8233d34b7883b2ccbe3dfee9aa19251c1a8deff1258894aee86fba08495cbfb"}},{"ruleId":"D1","level":"warning","message":{"text":"CommandReceiptPruner.prune (cyclomatic 21): CommandReceiptPruner.prune has cyclomatic complexity 21 (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":"lib/hive/command_receipt_pruner.rb"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab45456f9121a05d332d7ddbd719dfcc66310274c2cd1fec00d29c4b5263eae"}},{"ruleId":"D1","level":"warning","message":{"text":"Replay.classify_existing! (cyclomatic 21): Replay.classify_existing! 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":"lib/hive/command_receipt_store/replay.rb"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09a7447e2ef96f2d4806e02c76274a32d0c8b9faf8c87ddac25f42b23e5fdf6"}},{"ruleId":"D1","level":"warning","message":{"text":"Watch.run (cyclomatic 21): Watch.run has cyclomatic complexity 21 (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":"lib/hive/commands/watch.rb"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b4080902d12ea0025deece42d9d3a1505db29e52f5418f6afc2cc3e8a98185"}},{"ruleId":"D1","level":"warning","message":{"text":"RecoveryCoordinator.projected_receipt_for_request (cyclomatic 21): RecoveryCoordinator.projected_receipt_for_request 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":"lib/hive/daemon/recovery_coordinator.rb"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"81cfb3f2b025a54add1fd95f79d84f5db569abb6f03f6db48b09116e7fb4d85b"}},{"ruleId":"D1","level":"warning","message":{"text":"RecoveryCoordinator.source_receipt_for (cyclomatic 21): RecoveryCoordinator.source_receipt_for has cyclomatic complexity 21 (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":"lib/hive/daemon/recovery_coordinator.rb"},"region":{"startLine":1743}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b73a6251b7f8fa43f84a6617128563d7bffc7240b93ab303c131a2d4b928d2"}},{"ruleId":"D1","level":"warning","message":{"text":"Dispatcher.dispatch_locked (cyclomatic 21): Dispatcher.dispatch_locked has cyclomatic complexity 21 (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":"lib/hive/modules/dispatcher.rb"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e1a6259dd79d921cee0eae6bd03b8d68fad0443d4e7548d4faa7a6cda684bf"}},{"ruleId":"D1","level":"warning","message":{"text":"Rebase.resolve_conflicts (cyclomatic 21): Rebase.resolve_conflicts 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":"lib/hive/rebase.rb"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"124bf74f80ff19d27d592f15205da59ca55303b7935e2b87b49748677a58804c"}},{"ruleId":"D1","level":"warning","message":{"text":"ReviewBudget.validate_exhaustion! (cyclomatic 21): ReviewBudget.validate_exhaustion! has cyclomatic complexity 21 (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":"lib/hive/review_budget.rb"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d5fa9d4954c08635fea0deeae33481702c3514c4ef79e271e50a4dd2016194"}},{"ruleId":"D1","level":"warning","message":{"text":"ProcessRegistry.exited_process_evidence (cyclomatic 21): ProcessRegistry.exited_process_evidence 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":"lib/hive/runtime_control_plane/process_registry.rb"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"a571d9afd3c857baf5e9de20bd9fba4d1ff64f0b5611f011bf8067c3b36c1de8"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskClosure.validate_receipt_evidence! (cyclomatic 21): TaskClosure.validate_receipt_evidence! 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":"lib/hive/task_closure.rb"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb9f07909e8678651e717dbda39ea7c24711c2568450a2c5894d4c00ed91d9a"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectCaptureProvider.validate_media_content! (cyclomatic 21): ProjectCaptureProvider.validate_media_content! 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":"lib/hive/web/project_capture_provider.rb"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"93acb84b6382dad6da206e84793663d5f15d5545e26e8c905f7da77fa2f16d13"}},{"ruleId":"D1","level":"warning","message":{"text":"BaselineCache.plan (cyclomatic 21): BaselineCache.plan has cyclomatic complexity 21 (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":"packaging/release_candidate/baseline_cache.rb"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9f5e71bc77ad869716d2f7a8631b0332ade50e7fa86dcb874b9dddbed500fb"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskLogsHelper.task_log_event_entries (cyclomatic 21): TaskLogsHelper.task_log_event_entries 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":"web/app/helpers/task_logs_helper.rb"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e3c40efeeab8529c5962b2261606cd5d2f6361afe27886fd95adcd18de04e9"}},{"ruleId":"D1","level":"warning","message":{"text":"GitPolicy.unsafe_read_option? (cyclomatic 20): GitPolicy.unsafe_read_option? has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/babysitter/git_policy.rb"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b80e2bde84de2dc6380aef70cd4434520753f047fa536cc8ba4ffa59e977df"}},{"ruleId":"D1","level":"warning","message":{"text":"Daemon.stop_daemon (cyclomatic 20): Daemon.stop_daemon 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":"lib/hive/commands/daemon.rb"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"96957bc0f437f2eebbe5ba9a11355591b02f4984153fd4b4d95afa994dee7e97"}},{"ruleId":"D1","level":"warning","message":{"text":"RefactorPatrol.usage_jobs_argv (cyclomatic 20): RefactorPatrol.usage_jobs_argv has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/refactor_patrol.rb"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3bbbd702cd6eb7b1dedf5399b8cb0c08a40b6655c6cf6ffbfca0729fb19d7d"}},{"ruleId":"D1","level":"warning","message":{"text":"Config.validate_web_config! (cyclomatic 20): Config.validate_web_config! 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":"lib/hive/config.rb"},"region":{"startLine":4004}}}],"partialFingerprints":{"codehealthFindingId/v1":"90195339226ddec5a3e1bb6eb4bec86f4e77091fe5b011eb4dc5df55fd5f1922"}},{"ruleId":"D1","level":"warning","message":{"text":"Dispatcher.run_one_shot (cyclomatic 20): Dispatcher.run_one_shot has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: Dispatcher.observe_dispatch_outcome (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43daf6a8a83a682cd3055ece819ab8d5bb72cb9ca2839f1966ae8fb6d16767e"}},{"ruleId":"D1","level":"warning","message":{"text":"FinalizationProof.validate! (cyclomatic 20): FinalizationProof.validate! has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/finalization_proof.rb"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"21caf77915e0c41f64bd8719135a56ed8a0eb0de779ab08cf9e87faafdee4c4a"}},{"ruleId":"D1","level":"warning","message":{"text":"TriggerEvaluator.evaluate (cyclomatic 20): TriggerEvaluator.evaluate has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/modules/trigger_evaluator.rb"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cbd1048f0dbaf0e5e1f17e701270b5c87609a553f97c17e59d6d8d621f50c22"}},{"ruleId":"D1","level":"warning","message":{"text":"OperationalStatus.project_row (cyclomatic 20): OperationalStatus.project_row 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":"lib/hive/operational_status.rb"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"547d00a9117e9d09c22488d2e73fed08975c6f22e6f684667f5fdc523a334be6"}},{"ruleId":"D1","level":"warning","message":{"text":"Decision.validate! (cyclomatic 20): Decision.validate! has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/plan_review/decision.rb"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b01a1d6fd13a99b76c8fc0dee3efbd389c72834fb7e511ddca33371359a0a60"}},{"ruleId":"D1","level":"warning","message":{"text":"Orchestrator.apply_verification (cyclomatic 20): Orchestrator.apply_verification 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":"lib/hive/plan_review/orchestrator.rb"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be0455a18364990964547dd5a53a5cb5ecff498708c371ac7bee83e67fd13f3"}},{"ruleId":"D1","level":"warning","message":{"text":"MergeClassifier.parse_record (cyclomatic 20): MergeClassifier.parse_record 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":"lib/hive/refactor_patrol/merge_classifier.rb"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59259f1e41fdd444ea2028c6ad0b96d528e453f7c718aef1cb99a0b06311423"}},{"ruleId":"D1","level":"warning","message":{"text":"Arguments.initialize (cyclomatic 20): Arguments.initialize 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":"lib/hive/remote/dispatcher.rb"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4ff943dfd595f8b1d44c6957cd4e59ec45e695eb4891e705c4e7f89833643e"}},{"ruleId":"D1","level":"warning","message":{"text":"OperationProjection.workflow_progress (cyclomatic 20): OperationProjection.workflow_progress 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":"lib/hive/remote/operation_projection.rb"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c084647d34d236385655bc74f2623e23f77264c4b06427267447fdd2a01344de"}},{"ruleId":"D1","level":"warning","message":{"text":"Store.validate! (cyclomatic 20): Store.validate! 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":"lib/hive/review_budget/store.rb"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b4dac62e147f87fe8d061729c75d0c9452272058a2343f22d2c44a6feb45a4"}},{"ruleId":"D1","level":"warning","message":{"text":"Fix.fix_authorization (cyclomatic 20): Fix.fix_authorization 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":"lib/hive/stages/patrol_fix/fix.rb"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56aa2a57c52c340b78b91935f21b56cfe3925d3c2518408f72280253047e0c9"}},{"ruleId":"D1","level":"warning","message":{"text":"Runner.wait_for_settlement! (cyclomatic 20): Runner.wait_for_settlement! 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":"lib/hive/stages/review/remote_ci.rb"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2faa65079925b5c37baabc71a7487d0b6ca4f69857ec39c41fd49bf54d12540"}},{"ruleId":"D1","level":"warning","message":{"text":"UserService.remove_current (cyclomatic 20): UserService.remove_current has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/user_service.rb"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"4360932ab9d97db5e6b66c460be330cd1913d6adb2ba890599181c3e00a5e209"}},{"ruleId":"D1","level":"warning","message":{"text":"AuthoringLint.scan_permissions (cyclomatic 20): AuthoringLint.scan_permissions 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":"lib/hive/workflow_package/authoring_lint.rb"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb8a092bacbfd5e622c14285314af812a984a7602ab91dcff838fc85d84902b"}},{"ruleId":"D1","level":"warning","message":{"text":"AuthoringLint.security_extension (cyclomatic 20): AuthoringLint.security_extension 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":"lib/hive/workflow_package/authoring_lint.rb"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9fe98363513d17b3bd96bd703cc1021cfa67b446c74e0511268717c02fc8f6"}},{"ruleId":"D1","level":"warning","message":{"text":"LintPolicy.validate! (cyclomatic 20): LintPolicy.validate! 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":"lib/hive/workflow_package/lint_policy.rb"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90a4f1268fdcaa881fc77e3741d3f4ba68e9eb07070018932b163097d3fa962"}},{"ruleId":"D1","level":"warning","message":{"text":"RegistrySubmission.submit_locked (cyclomatic 20): RegistrySubmission.submit_locked 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":"lib/hive/workflow_package/registry_submission.rb"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"eabbb8429a99f9e4adcde441a11b151cbd8f52cc2a0f0e89a1d0e3fcf19a2699"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskMigrator.build_plan (cyclomatic 20): TaskMigrator.build_plan has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/workflow_package/task_migrator.rb"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7efe3b83a2f73556419e1df507b10b4b29d88462933fcb5bc7e5064497ef2a4"}},{"ruleId":"D1","level":"warning","message":{"text":"ProcessSupervisor.validate_launch! (cyclomatic 20): ProcessSupervisor.validate_launch! 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":"packaging/live_agent_skills/workflow_creator_process_supervisor.rb"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db9b00ff0fa76b4163967ade3aab0f0b1cc7a010fb0063389e384e23fb6046d"}},{"ruleId":"D1","level":"warning","message":{"text":"ReleasePublicationVerifier.call (cyclomatic 20): ReleasePublicationVerifier.call 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":"packaging/release_candidate/release_selector.rb"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"2902674f8d9a7a7811e33049378014c5bed171b83675c142d760bd5f7d6264cd"}},{"ruleId":"D1","level":"warning","message":{"text":"DetachedLauncher.launch (cyclomatic 19): DetachedLauncher.launch has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/attempts/detached_launcher.rb"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8cba9ff3ad6d5a7a2129e79c8946dd0849905bae1397d48a8d8234e60a9412"}},{"ruleId":"D1","level":"warning","message":{"text":"Status.validate_mode_combinations! (cyclomatic 19): Status.validate_mode_combinations! has cyclomatic complexity 19 (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":"lib/hive/commands/status.rb"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92f35ca3b05bb4bb908a5f11effc947c84afc4889f7705f6219532b8d050e7d"}},{"ruleId":"D1","level":"warning","message":{"text":"Config.validate_artifact_evidence! (cyclomatic 19): Config.validate_artifact_evidence! has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/config.rb"},"region":{"startLine":2974}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08a62507182917c396a65c3a6bc2d20b8325e8a15c6d00e3518045c1b95db48"}},{"ruleId":"D1","level":"warning","message":{"text":"Dispatcher.dispatch_or_block (cyclomatic 19): Dispatcher.dispatch_or_block has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: Dispatcher.observe_dispatch_outcome (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":2592}}}],"partialFingerprints":{"codehealthFindingId/v1":"44174282f8f825724d824af30f72944e92583263ee686186e08cbdf009d69d82"}},{"ruleId":"D1","level":"warning","message":{"text":"Dispatcher.process_dispatch_requests (cyclomatic 19): Dispatcher.process_dispatch_requests has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: Dispatcher.observe_dispatch_outcome (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":3679}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a62fa569c738eac98ae9055e189d8cf980433c2e612c0ccd85617993b71b96"}},{"ruleId":"D1","level":"warning","message":{"text":"RefactorPatrolMergeReconciler.validate_page! (cyclomatic 19): RefactorPatrolMergeReconciler.validate_page! has cyclomatic complexity 19 (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":"lib/hive/daemon/refactor_patrol_merge_reconciler.rb"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d75f4837031a1ac89e2df66a7c004c39fe59046ad8322b6e3c361e001eaa163"}},{"ruleId":"D1","level":"warning","message":{"text":"Coordinator.materialize (cyclomatic 19): Coordinator.materialize has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daily_digest/coordinator.rb"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d143bdf24fbb0401465fe8dc2a14bceac93c88dccb9b38d35f1861c986d17bd"}},{"ruleId":"D1","level":"warning","message":{"text":"GitOps.hive_commit (cyclomatic 19): GitOps.hive_commit 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":"lib/hive/git_ops.rb"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"f635df875704060655fa04c40f42ad7861221bf84e384d962149dd4c2bace4ef"}},{"ruleId":"D1","level":"warning","message":{"text":"Configuration.validate! (cyclomatic 19): Configuration.validate! has cyclomatic complexity 19 (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":"lib/hive/module_package/configuration.rb"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"de33c73244c043d9afc90f5ed636f9c4aa64f4735f85773282e71ce770bc94ab"}},{"ruleId":"D1","level":"warning","message":{"text":"Manifest.validate_settings! (cyclomatic 19): Manifest.validate_settings! has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/module_package/manifest.rb"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4a8756ec70157a9af1a1d0b38b51bed27615be43341b6ba204cfdb379cc3c8"}},{"ruleId":"D1","level":"warning","message":{"text":"SecretRework.validate_payload! (cyclomatic 19): SecretRework.validate_payload! has cyclomatic complexity 19 (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":"lib/hive/patrol_fix/secret_rework.rb"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b7c4dd67fe08f0cee68d514ac03bac539c862dd262b7dd0bee63e42571c47e"}},{"ruleId":"D1","level":"warning","message":{"text":"SuccessorMaterializer.validate_relation_document! (cyclomatic 19): SuccessorMaterializer.validate_relation_document! has cyclomatic complexity 19 (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":"lib/hive/patrol_fix/successor_materializer.rb"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"51de23796888282d6f54e8c66b2e91000797b1787276369695d37dc93b2f5846"}},{"ruleId":"D1","level":"warning","message":{"text":"WorktreeSnapshot.capture (cyclomatic 19): WorktreeSnapshot.capture 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":"lib/hive/patrol_fix/worktree_snapshot.rb"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0a15f833f0545572f210d303212180f28f73281b9dfe22dc63e06697b96d8b"}},{"ruleId":"D1","level":"warning","message":{"text":"TokenStore.valid_registry? (cyclomatic 19): TokenStore.valid_registry? has cyclomatic complexity 19 (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":"lib/hive/remote/token_store.rb"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"994e4474bfb711baaba0523f76ebf864aab529c02c0bb9cca55413ca79a07e30"}},{"ruleId":"D1","level":"warning","message":{"text":"Store.append_audit! (cyclomatic 19): Store.append_audit! has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/review_budget/store.rb"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"185303b8a04098060048acc3c789519fc9c318c059d7001b66888ee0aef109ef"}},{"ruleId":"D1","level":"warning","message":{"text":"Validator.validate! (cyclomatic 19): Validator.validate! has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_journal.rb"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12db654e9a9a9edb91edae8c5e9f280353d7cc8771261215edf9ca6f016c805"}},{"ruleId":"D1","level":"warning","message":{"text":"Attempts.sessions_for (cyclomatic 19): Attempts.sessions_for has cyclomatic complexity 19 (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":"lib/hive/task_workspace/attempts.rb"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab6545197dfeace614950cf348f585c0a0bc5722624ebd9ccc4e18bc36399054"}},{"ruleId":"D1","level":"warning","message":{"text":"Timeline.call (cyclomatic 19): Timeline.call 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":"lib/hive/task_workspace/timeline.rb"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"5665a921fbfe1f5939ef4cd765af676643dc927782db02426234095c6a1613c3"}},{"ruleId":"D1","level":"warning","message":{"text":"TransactionJournal.validate_activation_process_identity! (cyclomatic 19): TransactionJournal.validate_activation_process_identity! has cyclomatic complexity 19 (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":"lib/hive/user_service/transaction_journal.rb"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e58f5368b4b148d25cfeac9874d6f8ed2341b197573454f506a2f7a60b20f2"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectCaptureProvider.supervise_provider (cyclomatic 19): ProjectCaptureProvider.supervise_provider has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/web/project_capture_provider.rb"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb90ae55ea2e817158d51ac57b9795a2abdc58cd78266f7295f227732d9bc2e"}},{"ruleId":"D1","level":"warning","message":{"text":"Configuration.validate! (cyclomatic 19): Configuration.validate! has cyclomatic complexity 19 (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":"lib/hive/workflow_package/configuration.rb"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"28de4aac7789a8293734f259bc8507ba2bcbca317cb30f5dd97bbb306d55a42b"}},{"ruleId":"D1","level":"warning","message":{"text":"HostedAggregate.valid_receipt? (cyclomatic 19): HostedAggregate.valid_receipt? has cyclomatic complexity 19 (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":"packaging/release_candidate/hosted_aggregate.rb"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac747c9f0b2718c37dc7c9b9fdb785abc483295db8bc0b992286b2df79988ffc"}},{"ruleId":"D1","level":"warning","message":{"text":"HostedGate.verify_manifest (cyclomatic 19): HostedGate.verify_manifest has cyclomatic complexity 19 (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":"packaging/release_candidate/hosted_gate.rb"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd1b446b59bc91a9ea36b43637a88dbc0e65c7d260a8b4e2a7285d26f8a7661"}},{"ruleId":"D1","level":"warning","message":{"text":"MessageExtractor.extract (cyclomatic 18): MessageExtractor.extract 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":"lib/hive/agent/message_extractor.rb"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0cbc498fb61fac8acb35775695adc385c108731225e08d9e671008b44a2299"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentProfile.initialize (cyclomatic 18): AgentProfile.initialize 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":"lib/hive/agent_profile.rb"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b04028751f8203ff6dfa9b9a4292a1b3f6b7e0ef52adbc8be00cd333cab00b"}},{"ruleId":"D1","level":"warning","message":{"text":"Proof.canonical_representation (cyclomatic 18): Proof.canonical_representation 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":"lib/hive/artifacts/outcome_evidence/proof.rb"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"948a3c87f83b0cc623a10b74d5dc5290eb14b7c8ce24d3680b1d817c97fa8f1f"}},{"ruleId":"D1","level":"warning","message":{"text":"Proof.inspect_terminal_cast! (cyclomatic 18): Proof.inspect_terminal_cast! 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":"lib/hive/artifacts/outcome_evidence/proof.rb"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f633215f21a08dedcd8c25bb3404f0573e7e188ffef325dae4e79bda2933ad"}},{"ruleId":"D1","level":"warning","message":{"text":"Reconciler.reconcile_record (cyclomatic 18): Reconciler.reconcile_record 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":"lib/hive/attempts/reconciler.rb"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a65991c90a5434e4fb185279018c1d88883df8149b86d8dcf74fa24b0c3878e"}},{"ruleId":"D1","level":"warning","message":{"text":"Record.validate_provider_evidence! (cyclomatic 18): Record.validate_provider_evidence! 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":"lib/hive/attempts/record.rb"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"e05f4b6a0fdd2e35ecc505c158f5563cdb1ffd91b00c7da7215a14a4da78abcf"}},{"ruleId":"D1","level":"warning","message":{"text":"CommandReceiptStore.allocate_successor (cyclomatic 18): CommandReceiptStore.allocate_successor 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":"lib/hive/command_receipt_store.rb"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2e5fa8a7d729d1cbabac67b545dd7b245279fbcb7096d03d5fa781d9bd3418"}},{"ruleId":"D1","level":"warning","message":{"text":"Config.reachable_model_routing_calls (cyclomatic 18): Config.reachable_model_routing_calls 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":"lib/hive/config.rb"},"region":{"startLine":2708}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c6f244aa525bc4c7cf2cf1417ded33edeeacae2f10f23298e076c01a073151"}},{"ruleId":"D1","level":"warning","message":{"text":"Config.validate_patrol! (cyclomatic 18): Config.validate_patrol! 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":"lib/hive/config.rb"},"region":{"startLine":4236}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f86de33c0daa1d6a78dee0da558eb886df4c2c7cc0c157dcc8c5eea956c072"}},{"ruleId":"D1","level":"warning","message":{"text":"Assembler.find_recovery_task (cyclomatic 18): Assembler.find_recovery_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":"lib/hive/daemon/operational_snapshot.rb"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0fcd2cc19d09301d6190fcc1558b6fc07f76be718983f86636706bcf133d98b"}},{"ruleId":"D1","level":"warning","message":{"text":"RecoveryCoordinator.prepare_manual (cyclomatic 18): RecoveryCoordinator.prepare_manual 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":"lib/hive/daemon/recovery_coordinator.rb"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"65dbed7a9d55e2a0f1bf7797cbb7ee0e70574b61e0a21557de4956f39e03f87e"}},{"ruleId":"D1","level":"warning","message":{"text":"RefactorPatrolMergeProgressStore.validate_item! (cyclomatic 18): RefactorPatrolMergeProgressStore.validate_item! 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":"lib/hive/daemon/refactor_patrol_merge_progress_store.rb"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed5aad400624a5c45bccee12490c0df777d4e14b75be05b1a665ec7b280a08b"}},{"ruleId":"D1","level":"warning","message":{"text":"RefactorPatrolMergeReconciler.reconcile_step (cyclomatic 18): RefactorPatrolMergeReconciler.reconcile_step 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":"lib/hive/daemon/refactor_patrol_merge_reconciler.rb"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ac019b4a60ab86ab97cf5b903195136792292fd59851eeaf22d3e4abb0b154"}},{"ruleId":"D1","level":"warning","message":{"text":"RefactorPatrolMergeReconciler.scan_page_step (cyclomatic 18): RefactorPatrolMergeReconciler.scan_page_step 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":"lib/hive/daemon/refactor_patrol_merge_reconciler.rb"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef46e2ce688dbb4c6aa3af79ad10c0567d2d243e0f32e5bdaf1f76229223581"}},{"ruleId":"D1","level":"warning","message":{"text":"GitOps.run_git_with_timeout (cyclomatic 18): GitOps.run_git_with_timeout 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":"lib/hive/git_ops.rb"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"603eab016ff9690a666f2aefbb37642d08ceff27efd4bff036bbed0318dc2685"}},{"ruleId":"D1","level":"warning","message":{"text":"ManagedDirectory.with_lock (cyclomatic 18): ManagedDirectory.with_lock 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":"lib/hive/managed_directory.rb"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"09290944017f5aa1cdb6c181a95fc99b4721b081db5fc3b0e23f9ca927829d4c"}},{"ruleId":"D1","level":"warning","message":{"text":"ProcessExecutor.call (cyclomatic 18): ProcessExecutor.call 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":"lib/hive/one_shot/process_executor.rb"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca702d161451dead43985e5a76f06dfeb2041caee5e1e78c831a97b86e7c0ed"}},{"ruleId":"D1","level":"warning","message":{"text":"Orchestrator.advance_unlocked! (cyclomatic 18): Orchestrator.advance_unlocked! 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":"lib/hive/plan_review/orchestrator.rb"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1adbee1858d5d0b053680b7b0f90700cedc8b93e80307c2328edc7487df086"}},{"ruleId":"D1","level":"warning","message":{"text":"ResultParser.parse (cyclomatic 18): ResultParser.parse 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":"lib/hive/plan_review/result_parser.rb"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5c58028a3b37233b277327021b268469aba694bb2fc48999336581a5f78235"}},{"ruleId":"D1","level":"warning","message":{"text":"ProcessKill.terminate_process_group (cyclomatic 18): ProcessKill.terminate_process_group 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":"lib/hive/process_kill.rb"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"6405cd25d0d9e99ab1ef643e01eceea144934c9d7883dc9748f4f1645ddcc92f"}},{"ruleId":"D1","level":"warning","message":{"text":"Projection.validate_history! (cyclomatic 18): Projection.validate_history! 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":"lib/hive/proposals/projection.rb"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"5364e653731b2e80a775bb98187fd9441b0f7a5a7c12b953d848bfde3ae0af62"}},{"ruleId":"D1","level":"warning","message":{"text":"JobQuery.blockers (cyclomatic 18): JobQuery.blockers 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":"lib/hive/refactor_patrol/job_query.rb"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"22988f0a2733e39aac991cc9b45d858db248409faf8042ddd48951a103f06f42"}},{"ruleId":"D1","level":"warning","message":{"text":"PublicationAttempt.ensure_for_patch (cyclomatic 18): PublicationAttempt.ensure_for_patch 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":"lib/hive/refactor_patrol/publication_attempt.rb"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccbb20f65c94d1b8f6bb0fc8096a335e2b9da1794930e8c6234d9c30ad161d47"}},{"ruleId":"D1","level":"warning","message":{"text":"CommandPolicy.preflight! (cyclomatic 18): CommandPolicy.preflight! 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":"lib/hive/remote/command_policy.rb"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ef3fb87376ee580f73e238c71101b7f3a72bc816436f5beb94ed636bc1c1cd"}},{"ruleId":"D1","level":"warning","message":{"text":"QuestionHandles.read (cyclomatic 18): QuestionHandles.read 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":"lib/hive/remote/question_handles.rb"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"65796234a8055c016a973bae17305953d81afe27655d23c7192892c87f92c3ea"}},{"ruleId":"D1","level":"warning","message":{"text":"AdmissionTransition.claim_request! (cyclomatic 18): AdmissionTransition.claim_request! 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":"lib/hive/runtime_control_plane/admission_transition.rb"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"b816a08a657c51181a8e513e84f798f95433c598b70a31b57f4306c5e4b0b16b"}},{"ruleId":"D1","level":"warning","message":{"text":"Task.resolve_workflow (cyclomatic 18): Task.resolve_workflow 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":"lib/hive/task.rb"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19e21eda86632f728ca058b1c7312bca870fc63ce647f12bcd3f862be8a4c0e"}},{"ruleId":"D1","level":"warning","message":{"text":"DependencyComponent.edge (cyclomatic 18): DependencyComponent.edge 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":"lib/hive/task_workspace/dependency_component.rb"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18375b323e2ea56ce662b6faf1b79543d13711fd3be579cfce6e927f0b7524b"}},{"ruleId":"D1","level":"warning","message":{"text":"Publication.read_pointer (cyclomatic 18): Publication.read_pointer 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":"lib/hive/task_workspace/publication.rb"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f1746dc6f6e9d634dd3e9e80d1165e1aaa08e6f503a1c4c67b78de8026a290"}},{"ruleId":"D1","level":"warning","message":{"text":"TransactionJournal.validate_document! (cyclomatic 18): TransactionJournal.validate_document! 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":"lib/hive/user_service/transaction_journal.rb"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"abacad9a8d3ec4b69d3afe2efbc199b6490b860989554c273af48c5585ddc286"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectCaptureProvider.validate_artifacts! (cyclomatic 18): ProjectCaptureProvider.validate_artifacts! 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":"lib/hive/web/project_capture_provider.rb"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"0afff53a95ffb7c2e03340f97b563209dc33e2cadac199f85ccc3f7ca9b0e50a"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimePolicy.compile_portable_actor (cyclomatic 18): RuntimePolicy.compile_portable_actor 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":"lib/hive/workflow_package/runtime_policy.rb"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"8744f28936750736b5e1c10c1d2db185d6909b7007d72c203465e4695f1be3bf"}},{"ruleId":"D1","level":"warning","message":{"text":"SecurityScanner.scan_text (cyclomatic 18): SecurityScanner.scan_text 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":"lib/hive/workflow_package/security_scanner.rb"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7da64d99dbedf8fa7d2399dc7096b4c3a52a189a1c2422d95e3edea0fef0511"}},{"ruleId":"D1","level":"warning","message":{"text":"Worktree.read_owned_pointer (cyclomatic 18): Worktree.read_owned_pointer 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":"lib/hive/worktree.rb"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bee1570db2e4a8cdc19090e11f181d5298bdbf75d6363291f1e54eb7fa8667b"}},{"ruleId":"D1","level":"warning","message":{"text":"BaselineCache.baseline_cache_attestation (cyclomatic 18): BaselineCache.baseline_cache_attestation 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":"packaging/release_candidate/baseline_cache.rb"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d2a71569f6a293ca2fca2d6683f77119c6bd95446d0839861ee8aefbdc69f6"}},{"ruleId":"D1","level":"warning","message":{"text":"ResultParser.parse_run (cyclomatic 17): ResultParser.parse_run 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":"components/agent-cli-runtime/lib/agent_cli_runtime/opencode/result_parser.rb"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"94eab095dd0aa07892061816cebc03d19dd1850e1d2362b9974fa80f3133f751"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentGitGate.validate_transport_target (cyclomatic 17): AgentGitGate.validate_transport_target 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. This is NOT this file\u0027s highest cyclomatic complexity: AgentGitGate.read_arguments (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/agent_git_gate.rb"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"0316e4eb6b5c4a5e8935933487b93980251916e2c56736935404de9bdda8412c"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenClaw.filesystem_clawhub (cyclomatic 17): OpenClaw.filesystem_clawhub has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/agent_skills/adapters/openclaw.rb"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a3cf33ed55587502f2971197fe91a31c211cc221f81ddb54df48475c94de4d"}},{"ruleId":"D1","level":"warning","message":{"text":"Store.build_package (cyclomatic 17): Store.build_package 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":"lib/hive/artifacts/outcome_evidence/store.rb"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98160b356934ce811b2f9497a94cb21046eb38fd25d9d1711972e1a6b2c8b9c"}},{"ruleId":"D1","level":"warning","message":{"text":"ProcessIdentity.status (cyclomatic 17): ProcessIdentity.status has cyclomatic complexity 17 (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":"lib/hive/attempts/process_identity.rb"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3e2e4c4307d2d2804832e85934ef8372f64a34a6df617febfec5b984f87207"}},{"ruleId":"D1","level":"warning","message":{"text":"ProcessIdentity.terminate_orphan_group (cyclomatic 17): ProcessIdentity.terminate_orphan_group 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":"lib/hive/attempts/process_identity.rb"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"136dfbed573293a0510c8d9abfe029a958db1bfbbca98c59796677707165de6b"}},{"ruleId":"D1","level":"warning","message":{"text":"Reconciler.finalize_interruption (cyclomatic 17): Reconciler.finalize_interruption 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":"lib/hive/attempts/reconciler.rb"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"6657c3e6b67f53a0a92ef0fe6be190c7140fcfdb15903418dd9ff538d263d090"}},{"ruleId":"D1","level":"warning","message":{"text":"Record.validate_state_fields! (cyclomatic 17): Record.validate_state_fields! 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":"lib/hive/attempts/record.rb"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"af003e02f3fd7d27c83491b34593490fa235657973023ea2421a59fb48cd8d83"}},{"ruleId":"D1","level":"warning","message":{"text":"Record.validate_subject! (cyclomatic 17): Record.validate_subject! has cyclomatic complexity 17 (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":"lib/hive/attempts/record.rb"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78fb97a97e974363d53d4f2bdeda251bd5344359793fb0d94de7b5eed15b832"}},{"ruleId":"D1","level":"warning","message":{"text":"CommandOperation.expand_template (cyclomatic 17): CommandOperation.expand_template 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":"lib/hive/command_operation.rb"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"15db524c6aaff092dca7c58156a00f1bed5fc1eff61ad8f0d17c850b7bff5540"}},{"ruleId":"D1","level":"warning","message":{"text":"CommandReceiptMaintenance.validate_successful_reconciliation! (cyclomatic 17): CommandReceiptMaintenance.validate_successful_reconciliation! has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/command_receipt_maintenance.rb"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8106cea0dd9203d2fe2f9a7ef7a01a258807b16f6e5f8902eeb862697526278"}},{"ruleId":"D1","level":"warning","message":{"text":"CommandReceiptStore.abort_pre_submission (cyclomatic 17): CommandReceiptStore.abort_pre_submission 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":"lib/hive/command_receipt_store.rb"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4d1ebd060c660f5cfdb26e9940cc0a808a606a9e72515ba5f35e3d18fa7b59"}},{"ruleId":"D1","level":"warning","message":{"text":"Pins.acquire_pin (cyclomatic 17): Pins.acquire_pin 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":"lib/hive/command_receipt_store/pins.rb"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec8bef38ee4d092ff67e2c794140dce0d4355c7c16df3b9ce6dae08acd374b6"}},{"ruleId":"D1","level":"warning","message":{"text":"Setup.emit (cyclomatic 17): Setup.emit 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":"lib/hive/commands/setup.rb"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2506cdca6cd2ac2ba5560e462b86c3720d125d4ce5a6ddb47068f51fb71a72"}},{"ruleId":"D1","level":"warning","message":{"text":"Worktree.validate_arguments! (cyclomatic 17): Worktree.validate_arguments! 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":"lib/hive/commands/worktree.rb"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"15094b66fe29a96b26789f1eca326ddd5761007ea1ea872577e758ab5d3f2c32"}},{"ruleId":"D1","level":"warning","message":{"text":"Dispatcher.initialize (cyclomatic 17): Dispatcher.initialize has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: Dispatcher.observe_dispatch_outcome (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"058cffbb783fb8246f95dd4084cf59c75282ba0a0f2ee179d564bad72bdfc9ae"}},{"ruleId":"D1","level":"warning","message":{"text":"PatrolFixAdmissionScheduler.process (cyclomatic 17): PatrolFixAdmissionScheduler.process 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":"lib/hive/daemon/patrol_fix_admission_scheduler.rb"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"16efbc8e70e1e2527943269983491982ccf09904a708df2daac2199c4a48a84b"}},{"ruleId":"D1","level":"warning","message":{"text":"PatrolScheduler.candidates (cyclomatic 17): PatrolScheduler.candidates 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":"lib/hive/daemon/patrol_scheduler.rb"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"c79d10acc31a26d33c3bcbf2c3e672df5fa668390255dc4e5b9e446f76c06f09"}},{"ruleId":"D1","level":"warning","message":{"text":"RecoveryCoordinator.mark_dispatched (cyclomatic 17): RecoveryCoordinator.mark_dispatched 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":"lib/hive/daemon/recovery_coordinator.rb"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b953102265454cc8446f53d1144b792e59442465695d85752610b33485dd9fe"}},{"ruleId":"D1","level":"warning","message":{"text":"RecoveryCoordinator.close_finished_dispatch (cyclomatic 17): RecoveryCoordinator.close_finished_dispatch 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":"lib/hive/daemon/recovery_coordinator.rb"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c72f7087e65c0382b3016aa92cab2df08a8fbc7febf6ff4e45ded78836083ee"}},{"ruleId":"D1","level":"warning","message":{"text":"RecoveryCoordinator.preserve_review_grant_attempt_resume! (cyclomatic 17): RecoveryCoordinator.preserve_review_grant_attempt_resume! has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/recovery_coordinator.rb"},"region":{"startLine":1502}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ddb8e1a26d22e6d679bf28246290b9110af98e8eefeba1644a62c7405335a33"}},{"ruleId":"D1","level":"warning","message":{"text":"RefactorPatrolMergeReconciler.validate_progress_against_checkpoint! (cyclomatic 17): RefactorPatrolMergeReconciler.validate_progress_against_checkpoint! 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":"lib/hive/daemon/refactor_patrol_merge_reconciler.rb"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff3e982dc4299d8a0d01c0fda1a27340640fc0a59319cc9faec9b1606a57c10"}},{"ruleId":"D1","level":"warning","message":{"text":"Reader.read_view (cyclomatic 17): Reader.read_view 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":"lib/hive/daily_digest/reader.rb"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de2d695eff97ad916665e6cab618c5f711f75c9f567d4fa41bec3b9ed675f66"}},{"ruleId":"D1","level":"warning","message":{"text":"Controller.reconcile_revision (cyclomatic 17): Controller.reconcile_revision 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":"lib/hive/github_publication.rb"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"27dade44dc11306cf7388e926ca0840ea61a541efbefadbc35e566b6a56a5a7e"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelPricing.validate_card! (cyclomatic 17): ModelPricing.validate_card! 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":"lib/hive/model_pricing.rb"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49e90dc1a1ac71413c923547a2edeeef01b21acb06132edf1509de70a884684"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelPricing.disjoint_quantities (cyclomatic 17): ModelPricing.disjoint_quantities has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/model_pricing.rb"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b34a10ebc3e76230903d5db623b1b6bf5a67981b23e6913115eb3185fcc1c9"}},{"ruleId":"D1","level":"warning","message":{"text":"Dispatcher.update_run (cyclomatic 17): Dispatcher.update_run 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":"lib/hive/modules/dispatcher.rb"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"073e26dced66dcd1f84e2e081ae55a6b25f51bb00f0815d283dc8b078b8d2432"}},{"ruleId":"D1","level":"warning","message":{"text":"OperationalStatus.review_grant_payload (cyclomatic 17): OperationalStatus.review_grant_payload has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/operational_status.rb"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed7620a55f75c9207e8b6b941aeb632821478f4f3e00a30424fbdd504ff006f"}},{"ruleId":"D1","level":"warning","message":{"text":"ReceiptStore.append! (cyclomatic 17): ReceiptStore.append! 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":"lib/hive/patrol_fix/receipt_store.rb"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"06916f11b0a5876522766cdcb92e15bbcee89b4448932b008f4e23b2d71ba983"}},{"ruleId":"D1","level":"warning","message":{"text":"ProcessKill.terminate_process (cyclomatic 17): ProcessKill.terminate_process 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":"lib/hive/process_kill.rb"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"354698626eb11f7ccf4d615957ff03400ce8f4a593ff453b5bbdf21166d5d01a"}},{"ruleId":"D1","level":"warning","message":{"text":"Store.build_projections (cyclomatic 17): Store.build_projections 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":"lib/hive/proposals/store.rb"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e544b14aaf913bbefe2350be15bf5d7e54d5f5e2af2fec58af2a47480c5772"}},{"ruleId":"D1","level":"warning","message":{"text":"JobRecordValidator.validate_actions! (cyclomatic 17): JobRecordValidator.validate_actions! 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":"lib/hive/refactor_patrol/job_record_validator.rb"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"da244d9012587189431e9764b9582b29930859873535ef0793d0a5c343bd1de0"}},{"ruleId":"D1","level":"warning","message":{"text":"MergeClassifierRunner.call (cyclomatic 17): MergeClassifierRunner.call 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":"lib/hive/refactor_patrol/merge_classifier_runner.rb"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"201f9fc3fd35a7e9b36b660d53e379e3b53806e6ad8cafff9d54254dc22d4696"}},{"ruleId":"D1","level":"warning","message":{"text":"PrManifest.validate! (cyclomatic 17): PrManifest.validate! has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/pr_manifest.rb"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ebb90e720ebd50bcb4a91999f782663370ca47e8bb8ad38c189a558b5149a4a"}},{"ruleId":"D1","level":"warning","message":{"text":"Dispatcher.validate_local! (cyclomatic 17): Dispatcher.validate_local! 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":"lib/hive/remote/dispatcher.rb"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c809d82cad630efb359b4473e2e12d46d832bb4156515ef8fd6ca9229b60ec9"}},{"ruleId":"D1","level":"warning","message":{"text":"ReviewBudget.validate_resume! (cyclomatic 17): ReviewBudget.validate_resume! has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/review_budget.rb"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77d945a59a6d0f331d41bea4c59a0ddc4f23f437c1d74174eea3a5ab801de37"}},{"ruleId":"D1","level":"warning","message":{"text":"ReviewBudget.read_evidence (cyclomatic 17): ReviewBudget.read_evidence 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":"lib/hive/review_budget.rb"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9be09a4f13c6342263671f49c84da4e9c697e519549ad6493d1e3fda2e7dfff"}},{"ruleId":"D1","level":"warning","message":{"text":"RunningStatus.each_active_lease_row (cyclomatic 17): RunningStatus.each_active_lease_row 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":"lib/hive/running_status.rb"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1fc4ee780149fbaef79cc780b5ed38945f625766731324acec76c3ba61b1f3b"}},{"ruleId":"D1","level":"warning","message":{"text":"ActivationGate.default_status_route? (cyclomatic 17): ActivationGate.default_status_route? 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":"lib/hive/runtime_control_plane/activation_gate.rb"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80ce18a07447530d27f8cd0e5d68e8e4107045f3bff645e6ecf5da3b2e61852"}},{"ruleId":"D1","level":"warning","message":{"text":"AdmissionTransition.bind_command_context! (cyclomatic 17): AdmissionTransition.bind_command_context! 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":"lib/hive/runtime_control_plane/admission_transition.rb"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"1346bfe127eecbdf16f3a9348bd8911dfd90b59e6ca3052f2725fb067636675f"}},{"ruleId":"D1","level":"warning","message":{"text":"PayloadStore.seal (cyclomatic 17): PayloadStore.seal 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":"lib/hive/runtime_control_plane/payload_store.rb"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6324ceb27cc75cafbf5c96d888db2a5c67ce906d41bff3ced4d23bf7c06349a"}},{"ruleId":"D1","level":"warning","message":{"text":"ErrorEnvelope.build (cyclomatic 17): ErrorEnvelope.build 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":"lib/hive/schemas.rb"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a62054590eb4fd2d545722aedf2c70692abd7756836e1d3685cd591931d0b2"}},{"ruleId":"D1","level":"warning","message":{"text":"ManagedAgentCustody.launch_agent (cyclomatic 17): ManagedAgentCustody.launch_agent 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":"lib/hive/stages/managed_agent_custody.rb"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"241cdb8f1a9eb75022c63cb9ff886ee40d0d422031a50f72c9cbdb6fcf15b13a"}},{"ruleId":"D1","level":"warning","message":{"text":"Publish.exact_snapshot! (cyclomatic 17): Publish.exact_snapshot! has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/patrol_fix/publish.rb"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"1049ca968309f2c547e87c0cac532fd40c824dd4d71de96ce0a6defd4eeca620"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskAction.plan_review_action (cyclomatic 17): TaskAction.plan_review_action 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":"lib/hive/task_action.rb"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7627b97b1bfd01fc5dcb6e3090b9999db857a48550381e9d46a1a31839afd2e"}},{"ruleId":"D1","level":"warning","message":{"text":"Validator.validate_attempt! (cyclomatic 17): Validator.validate_attempt! 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":"lib/hive/task_journal.rb"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"6392ab9a79150db290b67f90d399cfba83525c7b7bc8ae552b9098c8ec2363dc"}},{"ruleId":"D1","level":"warning","message":{"text":"BoundedReader.read (cyclomatic 17): BoundedReader.read has cyclomatic complexity 17 (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":"lib/hive/task_workspace/bounded_reader.rb"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f748288ce9f34f57c0080d3c4f9df3bdb5ffd8e2ea4f148134d45ec707e6b5c"}},{"ruleId":"D1","level":"warning","message":{"text":"PublicationCache.refresh (cyclomatic 17): PublicationCache.refresh 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":"lib/hive/task_workspace/publication_cache.rb"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"da264144146e7795a5474474e89cfc887ab429a5a691b79af87ac8d249d1a6fe"}},{"ruleId":"D1","level":"warning","message":{"text":"BubbleModel.submit_rich_new_idea (cyclomatic 17): BubbleModel.submit_rich_new_idea 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. This is NOT this file\u0027s highest cyclomatic complexity: BubbleModel.handle_side_effect (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/tui/bubble_model.rb"},"region":{"startLine":2479}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1d535f5494343ee0c7b9f4afa381662a5fa020bf547b18b28329492052a087"}},{"ruleId":"D1","level":"warning","message":{"text":"UserService.lifecycle (cyclomatic 17): UserService.lifecycle 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":"lib/hive/user_service.rb"},"region":{"startLine":1425}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf62ef74eeec1076cbb0cd3e578421a14b4fc4796f4d139db0d142bfcce1f690"}},{"ruleId":"D1","level":"warning","message":{"text":"StatusSnapshotStore.valid_page_data? (cyclomatic 17): StatusSnapshotStore.valid_page_data? has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/web/status_snapshot_store.rb"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68e6ec8902179f8e6ab8897ac7d35cdcc17ace26b3a34b0e3374faacb5cc964"}},{"ruleId":"D1","level":"warning","message":{"text":"GitSource.materialize (cyclomatic 17): GitSource.materialize has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/workflow_package/git_source.rb"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd3d0596dea7fed22df28f9d8e1f8a43e118ec634003a961c6318ec155d82b6"}},{"ruleId":"D1","level":"warning","message":{"text":"PermissionProjection.normalize_scoped! (cyclomatic 17): PermissionProjection.normalize_scoped! 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":"lib/hive/workflow_package/permission_projection.rb"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"75cd4b6d57374fbfd716febb224492669309818b610d63356af479ad8b3bfb13"}},{"ruleId":"D1","level":"warning","message":{"text":"PublishReceipt.validate_step_fields! (cyclomatic 17): PublishReceipt.validate_step_fields! 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":"lib/hive/workflow_package/publish_receipt.rb"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d38a1f3c17e5a4b9ed305a16f34a306d79c956c6066f61390f15ddff6f088ea"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceSnapshot.read_record (cyclomatic 17): SourceSnapshot.read_record has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/workflow_package/source_snapshot.rb"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2aff8ff83415e2b40fbbfef6eaf825301b8e5c42e7b64c87d4c7a6259319a52"}},{"ruleId":"D1","level":"warning","message":{"text":"ReleaseSelector.validate_evidence! (cyclomatic 17): ReleaseSelector.validate_evidence! has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/release_candidate/release_selector.rb"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b38ff194115cdaf951cde5e8d2889eed6fbc6a75cc20a8a106bdd896dc23e49"}},{"ruleId":"D1","level":"warning","message":{"text":"ReleaseSelector.validate_effective_gates! (cyclomatic 17): ReleaseSelector.validate_effective_gates! has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/release_candidate/release_selector.rb"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcbf9d8fc7158cc159226e5bc744e7c2b1f68f25db744a9fb54f8bcd8382f8da"}},{"ruleId":"D1","level":"warning","message":{"text":"Recovery.read (cyclomatic 16): Recovery.read has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/artifacts/outcome_evidence/recovery.rb"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8badb94377a79f90553da4678db283ddb30db0ae24638c39e48947ca16ad5b9"}},{"ruleId":"D1","level":"warning","message":{"text":"PendingBookkeeping.verify_reference! (cyclomatic 16): PendingBookkeeping.verify_reference! has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/attempts/pending_bookkeeping.rb"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5da0a606fd46041837e27f3285ab646699a6053a095460d8e6bc740c2674546"}},{"ruleId":"D1","level":"warning","message":{"text":"PrFixer.run (cyclomatic 16): PrFixer.run has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/babysitter/pr_fixer.rb"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef18ef801333afd442989ac3fac28f4e4d2a932066d91fe0d6db163016f3301"}},{"ruleId":"D1","level":"warning","message":{"text":"Supervisor.execute_dispatch (cyclomatic 16): Supervisor.execute_dispatch 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":"lib/hive/bot/supervisor.rb"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"2386498ebd20508b1c6d92e85b2c6421e58dc3c56e7ee63981c49a002ba3eee3"}},{"ruleId":"D1","level":"warning","message":{"text":"Reclamation.reclaim_dead_executing_owners (cyclomatic 16): Reclamation.reclaim_dead_executing_owners has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/command_receipt_store/reclamation.rb"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"9814676a0c9444f024367bd10731f07239364b8576888a2da1c2b1c5c75add9e"}},{"ruleId":"D1","level":"warning","message":{"text":"RefactorPatrolScheduled.call (cyclomatic 16): RefactorPatrolScheduled.call has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/refactor_patrol_scheduled.rb"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"5463e5ef2b1c55290f9076e9f9e0b46ccbdb41678bca81c05ea3178bdbee4fca"}},{"ruleId":"D1","level":"warning","message":{"text":"Run.commit_after (cyclomatic 16): Run.commit_after has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/run.rb"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8bad42374198d30a82b8745ca71d9bca99885dd337aa97ef84f8fb746ce570f"}},{"ruleId":"D1","level":"warning","message":{"text":"Base.record_user_service_messages (cyclomatic 16): Base.record_user_service_messages has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/service_installer/base.rb"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f0fca198b47d161c39e2191a87343fc9780ea8a1720aa6dfe163bd04810ec1"}},{"ruleId":"D1","level":"warning","message":{"text":"Setup.call (cyclomatic 16): Setup.call 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":"lib/hive/commands/setup.rb"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb75f5fcc2fd5f71084588ab407768f307256201bc1373e0f19915b552a9e0c9"}},{"ruleId":"D1","level":"warning","message":{"text":"Status.current_status_cache (cyclomatic 16): Status.current_status_cache has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/status.rb"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"b772a62d97959c20f069f070ac16c23f0fb019a70fbb33c644248871eee9ffd9"}},{"ruleId":"D1","level":"warning","message":{"text":"Status.task_payload (cyclomatic 16): Status.task_payload has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/status.rb"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0e0dd0631b9339a39f230ccd3377827e79588163453141cbb396422b8d1879"}},{"ruleId":"D1","level":"warning","message":{"text":"Workflow.call! (cyclomatic 16): Workflow.call! has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/workflow.rb"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"c807e2da18ef636b9790bc7e38344b64fa447a2aacda8a0570f2f0385bd97ce6"}},{"ruleId":"D1","level":"warning","message":{"text":"Evidence.validate_types! (cyclomatic 16): Evidence.validate_types! has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/conditions/evidence.rb"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd867b17b3d0057df52bc2f299e4eac7b78cebd1c773ec7c9da97e0b108d4d87"}},{"ruleId":"D1","level":"warning","message":{"text":"TransitionGuard.validate! (cyclomatic 16): TransitionGuard.validate! has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/conditions/transition_guard.rb"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d895fbe96d65b75ce4d0d1a1fcc87ed80849b352cb43cada599117525de779e"}},{"ruleId":"D1","level":"warning","message":{"text":"Config.validate_daemon! (cyclomatic 16): Config.validate_daemon! has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/config.rb"},"region":{"startLine":3940}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc93406b9212050564fa4338674d53687dcacd8758be14634ff5d6dbc298ea2"}},{"ruleId":"D1","level":"warning","message":{"text":"ConcurrencyController.restore_schedule_state (cyclomatic 16): ConcurrencyController.restore_schedule_state has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/concurrency_controller.rb"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb9ef680555ead3d9dbf3b909b66a19192417d05626ae9f0541582a77529d07"}},{"ruleId":"D1","level":"warning","message":{"text":"Dispatcher.dispatch_durable_command (cyclomatic 16): Dispatcher.dispatch_durable_command 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. This is NOT this file\u0027s highest cyclomatic complexity: Dispatcher.observe_dispatch_outcome (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":5161}}}],"partialFingerprints":{"codehealthFindingId/v1":"76619e0237a4bce1971a05862129d77fa289ddeed5df1635325b2894d1fccdad"}},{"ruleId":"D1","level":"warning","message":{"text":"Quiescence.run_under_operation_lock (cyclomatic 16): Quiescence.run_under_operation_lock has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/quiescence.rb"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"89be2179571c9eb442454a26980a4089787a232bbf43bd159287dbd51a5da21e"}},{"ruleId":"D1","level":"warning","message":{"text":"RecoveryCoordinator.request_admission_failure (cyclomatic 16): RecoveryCoordinator.request_admission_failure 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":"lib/hive/daemon/recovery_coordinator.rb"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"030eb8e5ae4bc138ec44811926283336413b4131ca0b17ec65517e3550132326"}},{"ruleId":"D1","level":"warning","message":{"text":"RecoveryCoordinator.receipt_for_request (cyclomatic 16): RecoveryCoordinator.receipt_for_request 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":"lib/hive/daemon/recovery_coordinator.rb"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b461f974dfae150f9cb5d4f9b6c73c2935b5b1911271d7739a611fead89794"}},{"ruleId":"D1","level":"warning","message":{"text":"DependencySnapshot.base_selection (cyclomatic 16): DependencySnapshot.base_selection 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":"lib/hive/dependency_snapshot.rb"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad861ba57708047be6fd366abb93868d313831e239cfe07c458f78c1fb36c49"}},{"ruleId":"D1","level":"warning","message":{"text":"ImplementationIdentity.normalize_routing_metadata (cyclomatic 16): ImplementationIdentity.normalize_routing_metadata has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/implementation_identity.rb"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"e669c4eda114f9bb17e6d8207cf7d3c3efd117cd51a8394f053328235415a082"}},{"ruleId":"D1","level":"warning","message":{"text":"ManagedDirectory.atomic_write (cyclomatic 16): ManagedDirectory.atomic_write has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/managed_directory.rb"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61130926e7ed21884c95d5c2894e62bdef97eb8b5a8f2d382984340e10322aa"}},{"ruleId":"D1","level":"warning","message":{"text":"AttemptDiagnostic.failure_code (cyclomatic 16): AttemptDiagnostic.failure_code has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol_fix/attempt_diagnostic.rb"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06622f635a928df744d451471d9cbb4ea1cc583a0bc37e33098e9631364d0c5"}},{"ruleId":"D1","level":"warning","message":{"text":"PublicationBlockReceipt.validate_payload! (cyclomatic 16): PublicationBlockReceipt.validate_payload! has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol_fix/publication_block_receipt.rb"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e537dde45ed1ca17e35e32a0ecf1f3ba97fa3a8b8670fa82691bd7f04ce6c32"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectIdentity.resolve_read_only (cyclomatic 16): ProjectIdentity.resolve_read_only has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/project_identity.rb"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"491960881caa9c18a02b8910c97734ad42be3c8511aa54e85b91f489cb6f1cad"}},{"ruleId":"D1","level":"warning","message":{"text":"DecisionService.with_lifecycle_commit (cyclomatic 16): DecisionService.with_lifecycle_commit 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":"lib/hive/proposals/decision_service.rb"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"9560e04ee761f90b33f651219cd254ccadd66d4f488a1c3c74a4f51252a4d955"}},{"ruleId":"D1","level":"warning","message":{"text":"JobRecordValidator.validate_terminal_proof! (cyclomatic 16): JobRecordValidator.validate_terminal_proof! has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/job_record_validator.rb"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"d546f491c4f17c10239c17bd46d1076f489cfbc9670ed10d4815fe6d4e5bbd9f"}},{"ruleId":"D1","level":"warning","message":{"text":"JobStore.claim_discovery! (cyclomatic 16): JobStore.claim_discovery! 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":"lib/hive/refactor_patrol/job_store.rb"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe1820e99ed80462ac0192a0e4efb3bcaeee94f80b718f35a5b8707cc024802"}},{"ruleId":"D1","level":"warning","message":{"text":"ThesisNormalizer.defaulted_hash (cyclomatic 16): ThesisNormalizer.defaulted_hash has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/thesis_normalizer.rb"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"21765882187a24fd4ba0a996234630c76aa78b438df8c99b5481750c8dce3fb0"}},{"ruleId":"D1","level":"warning","message":{"text":"Finalize.verify_state! (cyclomatic 16): Finalize.verify_state! has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/finalize.rb"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e31b5b382eb9bf37a9e232f0b314ee3a7cf4a0b92b8380aafbf2fe6fb719330"}},{"ruleId":"D1","level":"warning","message":{"text":"Diagnostic.suggested_next_action_payload (cyclomatic 16): Diagnostic.suggested_next_action_payload has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_action/diagnostic.rb"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4950fa251f846edb18be4e89e03637a79b5c0d7f86378a8bbba3e2a3673e7f7"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder.operator_payload (cyclomatic 16): Builder.operator_payload has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_workspace/builder.rb"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"5673e0abac170218aec2d2221331091230c2702d7849372c3f1aad0e7a1fbbbd"}},{"ruleId":"D1","level":"warning","message":{"text":"BubbleModel.handle_new_idea_paste (cyclomatic 16): BubbleModel.handle_new_idea_paste 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. This is NOT this file\u0027s highest cyclomatic complexity: BubbleModel.handle_side_effect (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/tui/bubble_model.rb"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"94cfcddab2786c060514b5e44ef6c4a2a105efec84ba98e814b39444f23a5c96"}},{"ruleId":"D1","level":"warning","message":{"text":"UserService.reconcile_pending (cyclomatic 16): UserService.reconcile_pending has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/user_service.rb"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab858e06b669b0e5fa3fac0026a408d65f79d023fb5114f85fa10e370d36ad63"}},{"ruleId":"D1","level":"warning","message":{"text":"UserService.activation_effect (cyclomatic 16): UserService.activation_effect has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/user_service.rb"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22a2c2d76542ebc4ca29fc60d721e730254b0f3234b435b89a936c4cffed0c1"}},{"ruleId":"D1","level":"warning","message":{"text":"UserService.lifecycle_effect (cyclomatic 16): UserService.lifecycle_effect 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":"lib/hive/user_service.rb"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd57cc2b6e3290fa849a9a80d882efd72bea43b0938744a0b1c2dbd7876bdfcd"}},{"ruleId":"D1","level":"warning","message":{"text":"TransactionJournal.validate_restore_process_identity! (cyclomatic 16): TransactionJournal.validate_restore_process_identity! has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/user_service/transaction_journal.rb"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba236ad5ee7cb8754e4275b3f39e66d6cbaea1e601abbaff0023ba8e69043c1"}},{"ruleId":"D1","level":"warning","message":{"text":"TransactionJournal.observed_target_digest (cyclomatic 16): TransactionJournal.observed_target_digest has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/user_service/transaction_journal.rb"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"1195233db6ed11b98685f3d4ce6a3e364434f748fe4c022e2148a49ca2c07730"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectCaptureProvider.validate_result_shape! (cyclomatic 16): ProjectCaptureProvider.validate_result_shape! has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/web/project_capture_provider.rb"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe3e2faf1108eab106e1297b251fa9ba2ba9d2def929618c57987afe9629d26"}},{"ruleId":"D1","level":"warning","message":{"text":"Manifest.inventory (cyclomatic 16): Manifest.inventory has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/workflow_package/manifest.rb"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43eae43442ec360a3be5c3be82774bfb68dcd2c5ccbefbbb17f500a985195fd"}},{"ruleId":"D1","level":"warning","message":{"text":"PermissionProjection.normalize_scope_path (cyclomatic 16): PermissionProjection.normalize_scope_path has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/workflow_package/permission_projection.rb"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2292b9ef679cbd80378b835952d5f8355d7e7bb93f4a54e30aeba647c1ac90"}},{"ruleId":"D1","level":"warning","message":{"text":"Validator.validate (cyclomatic 16): Validator.validate 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":"lib/hive/workflow_package/validator.rb"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2330a6400bcdb4ef1758fc68cd268ff182e6c6863bbb8a3beaa69d03f0f8bca"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkspacePreparer.call (cyclomatic 16): WorkspacePreparer.call has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/live_agent_skills/workflow_creator_live_setup.rb"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f081552bdc3ccdef35cbf21efa74f18fb43afa1c74954f9d105048033a1c0fe"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkflowCreatorReceiptPublisher.settle (cyclomatic 16): WorkflowCreatorReceiptPublisher.settle 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":"packaging/live_agent_skills/workflow_creator_receipt_publisher.rb"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"605f5da6f99a4f13ad571508c404d79e03b3b147de6848a0fae8dcaae6cede3d"}},{"ruleId":"D1","level":"warning","message":{"text":"Aggregate.valid_job? (cyclomatic 16): Aggregate.valid_job? has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/release_candidate/aggregate.rb"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"27592b674b34411670cecccd32e47027aaf308625037a4e6224bc4277a0ef6cf"}},{"ruleId":"D1","level":"warning","message":{"text":"ReleaseSelector.validate_provenance! (cyclomatic 16): ReleaseSelector.validate_provenance! has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/release_candidate/release_selector.rb"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d79de2606a9a039e0e34074fc3089a9e90ef5490de91c8effbcbd623f1f459"}},{"ruleId":"D1","level":"warning","message":{"text":"DigestsHelper.render_digest_document (cyclomatic 16): DigestsHelper.render_digest_document has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/helpers/digests_helper.rb"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5c622cb2b000771357f55e4c783407daf714a70312e99d7390f4663e503b81"}},{"ruleId":"D1","level":"warning","message":{"text":"Task.outcome_evidence_file (cyclomatic 16): Task.outcome_evidence_file 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":"web/app/models/task.rb"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"80979836e3e576e44ed721de98d4ad7b0a280246921614889e4946e7c4b59894"}},{"ruleId":"D2","level":"warning","message":{"text":"Review.run_review_body! (cognitive 258): Review.run_review_body! has cognitive complexity 258 (threshold 15). Drivers by points: if/else 100 (163 pts), boolean chains 57, ternaries 7 (16 pts), error handling 5 (15 pts), match/switch 5 (7 pts) (nesting depth added 84). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/review.rb"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59fb7a0dbe0902b1993260b8a76390cd570820905537641158ece3fc8c1e949"}},{"ruleId":"D2","level":"warning","message":{"text":"Supervisor.run_worker (cognitive 145): Supervisor.run_worker has cognitive complexity 145 (threshold 15). Drivers by points: if/else 50 (100 pts), boolean chains 34, ternaries 4 (10 pts), loops 1 (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/attempts/supervisor.rb"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6cf2ebf2a5e9e39c09f05640717f3c64b0f21ae7aadf200d183ee2889de9ce1"}},{"ruleId":"D2","level":"warning","message":{"text":"Agent.spawn_and_wait (cognitive 112): Agent.spawn_and_wait has cognitive complexity 112 (threshold 15). Drivers by points: if/else 52 (61 pts), boolean chains 36, ternaries 6 (12 pts), error handling 2 (3 pts) (nesting depth added 16). 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":"lib/hive/agent.rb"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff410b63bbb9b2b44d9bd14261457b05f69629ed54b8ffcc9e67fd4f00f6a78"}},{"ruleId":"D2","level":"warning","message":{"text":"UserService.complete_apply_transition (cognitive 81): UserService.complete_apply_transition has cognitive complexity 81 (threshold 15). Drivers by points: if/else 35 (60 pts), boolean chains 12, ternaries 2 (6 pts), error handling 1 (3 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/user_service.rb"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f1a1f48074a7f6019a7b22d9c488ecf86656638316890d7e5ebb80008a516e"}},{"ruleId":"D2","level":"warning","message":{"text":"Dispatcher.admit (cognitive 73): Dispatcher.admit has cognitive complexity 73 (threshold 15). Drivers by points: if/else 24 (38 pts), boolean chains 21, ternaries 3 (8 pts), error handling 3 (6 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":"lib/hive/attempts/dispatcher.rb"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ac47e9143b4247b23ec2d094d9b211d554bf2624856c859e494ba791f1bfa8"}},{"ruleId":"D2","level":"warning","message":{"text":"UserService.complete_removal (cognitive 68): UserService.complete_removal has cognitive complexity 68 (threshold 15). Drivers by points: if/else 32 (50 pts), boolean chains 13, error handling 2 (4 pts), ternaries 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/user_service.rb"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a75a6f334a6f58feebbd52036998d1530f9547223ceea37138e1a14ab1feb3"}},{"ruleId":"D2","level":"warning","message":{"text":"Supervisor.run (cognitive 64): Supervisor.run has cognitive complexity 64 (threshold 15). Drivers by points: if/else 18 (32 pts), error handling 7 (28 pts), boolean chains 4 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/attempts/supervisor.rb"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"028aa27d041459faf3906a5a83f41529aeff9f4a0cf0c852343f16df3fd78334"}},{"ruleId":"D2","level":"warning","message":{"text":"Base.spawn_agent (cognitive 64): Base.spawn_agent has cognitive complexity 64 (threshold 15). Drivers by points: boolean chains 32, if/else 24 (28 pts), error handling 2 (3 pts), ternaries 1 (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":"lib/hive/stages/base.rb"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc92b129433250e0b89dfc3bd2faf157daae818ae79c4865730e01378049def"}},{"ruleId":"D2","level":"warning","message":{"text":"RecoveryCoordinator.resume (cognitive 61): RecoveryCoordinator.resume has cognitive complexity 61 (threshold 15). Drivers by points: if/else 25 (41 pts), boolean chains 12, error handling 3 (6 pts), ternaries 1 (2 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/recovery_coordinator.rb"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6cbf6645e01b448677c8de8a51899603daedc943c4b7e088a25ab025fad02b"}},{"ruleId":"D2","level":"warning","message":{"text":"OperationalStatus.reasons_for (cognitive 58): OperationalStatus.reasons_for has cognitive complexity 58 (threshold 15). Drivers by points: if/else 27 (28 pts), boolean chains 26, ternaries 2 (4 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/operational_status.rb"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a436631fae7c62f27fef362b7dff25cbb2f1cd77500dc0ed399b567cf3aa26"}},{"ruleId":"D2","level":"warning","message":{"text":"DraftPrReceipt.validate (cognitive 53): DraftPrReceipt.validate has cognitive complexity 53 (threshold 15). Drivers by points: if/else 30 (38 pts), boolean chains 14, error handling 1 (nesting depth added 8). 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":"lib/hive/draft_pr_receipt.rb"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c744c7227cbd408343c35cdef623b8ecc9a608defa36407e5f21815ce4d93c"}},{"ruleId":"D2","level":"warning","message":{"text":"UserService.apply_current (cognitive 53): UserService.apply_current has cognitive complexity 53 (threshold 15). Drivers by points: if/else 18 (20 pts), ternaries 5 (14 pts), boolean chains 13, error handling 2 (5 pts), match/switch 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/user_service.rb"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1c19ca7f0cf98a25e4f8b886273862511ee65ef6256bc4ea95620e3852d668"}},{"ruleId":"D2","level":"warning","message":{"text":"Dispatcher.dispatch_patrol_with_admission (cognitive 52): Dispatcher.dispatch_patrol_with_admission has cognitive complexity 52 (threshold 15). Drivers by points: if/else 21 (38 pts), error handling 4 (7 pts), boolean chains 4, ternaries 2 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":3370}}}],"partialFingerprints":{"codehealthFindingId/v1":"01639f8c649a8b35f2a7a3ecd4e060ad5e08496bb846218b59a9af94d52be93f"}},{"ruleId":"D2","level":"warning","message":{"text":"Orchestrator.resume_review (cognitive 51): Orchestrator.resume_review has cognitive complexity 51 (threshold 15). Drivers by points: if/else 24 (32 pts), boolean chains 17, ternaries 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":"lib/hive/plan_review/orchestrator.rb"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8edb919a50ae76c8d79c18433e0004da7dea4a8fc30215de486e98ad9d9bc4"}},{"ruleId":"D2","level":"warning","message":{"text":"GithubGateway.merged_prs_page (cognitive 51): GithubGateway.merged_prs_page has cognitive complexity 51 (threshold 15). Drivers by points: boolean chains 22, if/else 15, ternaries 9 (11 pts), error handling 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/github_gateway.rb"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aeb361429680e7afa2f718615d10b485cc0abf8169f2e23bcc1d9aa08ad1a08"}},{"ruleId":"D2","level":"warning","message":{"text":"UserService.rollback_apply (cognitive 51): UserService.rollback_apply has cognitive complexity 51 (threshold 15). Drivers by points: if/else 21 (30 pts), boolean chains 18, ternaries 1 (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":"lib/hive/user_service.rb"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50d8f5d773a8fb75c000c860f2aaa8a3db16db68eb91477969703e29f721a36"}},{"ruleId":"D2","level":"warning","message":{"text":"Run.marker_next_action (cognitive 49): Run.marker_next_action has cognitive complexity 49 (threshold 15). Drivers by points: ternaries 8 (23 pts), if/else 11 (19 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/run.rb"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"41323aa871b7301b843cd7c89868b317c30abd2d22d8a90a6878d9d6ac6d4248"}},{"ruleId":"D2","level":"warning","message":{"text":"Dispatcher.process_dispatch_request_iteration (cognitive 49): Dispatcher.process_dispatch_request_iteration has cognitive complexity 49 (threshold 15). Drivers by points: if/else 26 (33 pts), boolean chains 10, error handling 3 (6 pts) (nesting depth added 10). 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":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":3919}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d99bd289c5e5ec99a56aef06c8d4c3d43fad37fc6d5a2a93179c54774ee91cc"}},{"ruleId":"D2","level":"warning","message":{"text":"Dispatcher.tick (cognitive 47): Dispatcher.tick has cognitive complexity 47 (threshold 15). Drivers by points: if/else 34 (40 pts), error handling 4 (5 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46dbae829fb8dca426cf42bc235e228a24093999a09d20212f0c3a6254f1e58"}},{"ruleId":"D2","level":"warning","message":{"text":"RecoveryCoordinator.request (cognitive 47): RecoveryCoordinator.request has cognitive complexity 47 (threshold 15). Drivers by points: if/else 27 (31 pts), boolean chains 7, error handling 3 (5 pts), ternaries 3 (4 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/recovery_coordinator.rb"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac937ab8b42fc2a70cc967a9bf06b03ae6f0e52c7f38abfedc986241bc8b672f"}},{"ruleId":"D2","level":"warning","message":{"text":"MergeClassifier.normalize_snapshot (cognitive 47): MergeClassifier.normalize_snapshot has cognitive complexity 47 (threshold 15). Drivers by points: boolean chains 35, if/else 9, error handling 1, match/switch 1, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/merge_classifier.rb"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd33b375e94c59fefcb7414278c2200abab77a54cde0873f2adf4f0c7950475"}},{"ruleId":"D2","level":"warning","message":{"text":"Artifacts.run_outcome_evidence! (cognitive 47): Artifacts.run_outcome_evidence! has cognitive complexity 47 (threshold 15). Drivers by points: if/else 26 (32 pts), boolean chains 7, ternaries 2 (5 pts), error handling 2 (3 pts) (nesting depth added 10). 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":"lib/hive/stages/artifacts.rb"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"e607be54eadba1c5799a1013f00e2e646d4b653acaea32feb57eaa1625d38467"}},{"ruleId":"D2","level":"warning","message":{"text":"Dispatcher.dispatch_request! (cognitive 46): Dispatcher.dispatch_request! has cognitive complexity 46 (threshold 15). Drivers by points: if/else 19 (31 pts), boolean chains 9, error handling 2, match/switch 1 (2 pts), ternaries 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":4199}}}],"partialFingerprints":{"codehealthFindingId/v1":"0427c8f0b36d38c3fc62f573829b03d2aeea35b10209ae35840f81dce8d9e125"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskClosure.validate_receipt! (cognitive 46): TaskClosure.validate_receipt! has cognitive complexity 46 (threshold 15). Drivers by points: boolean chains 25, if/else 18 (20 pts), ternaries 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_closure.rb"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c521b7ed14844e3b3112f6a0624e4f5c13d15b882d1049e572f7d47e126e821"}},{"ruleId":"D2","level":"warning","message":{"text":"CommandReceiptStore.reserve (cognitive 45): CommandReceiptStore.reserve has cognitive complexity 45 (threshold 15). Drivers by points: if/else 18 (27 pts), ternaries 7 (9 pts), boolean chains 6, error handling 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/command_receipt_store.rb"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"1881142a2dc127eca9c895e1d02ea79f90a305deafcd647fd764704049180edb"}},{"ruleId":"D2","level":"warning","message":{"text":"RefactorPatrol.validate_mode! (cognitive 43): RefactorPatrol.validate_mode! has cognitive complexity 43 (threshold 15). Drivers by points: if/else 18 (27 pts), boolean chains 16 (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":"lib/hive/commands/refactor_patrol.rb"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f937b3a7f340909de06ee3da08d11e6e094366a17d64eeb79f3594b038c0c5"}},{"ruleId":"D2","level":"warning","message":{"text":"JobStore.assert_matching_discovery_payload! (cognitive 42): JobStore.assert_matching_discovery_payload! has cognitive complexity 42 (threshold 15). Drivers by points: boolean chains 28, if/else 11 (13 pts), error handling 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/job_store.rb"},"region":{"startLine":2191}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f1b2b80638099f09873cbcb34c2a015fed465895b5e7fb4da4c4e4e84e6c22"}},{"ruleId":"D2","level":"warning","message":{"text":"CommandOperation.call (cognitive 41): CommandOperation.call has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 10, error handling 3 (5 pts), ternaries 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/command_operation.rb"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"db885905e76cd7b116104fc23a68b2ff5bb3cd9d367a051a28d4fd4074db4a22"}},{"ruleId":"D2","level":"warning","message":{"text":"ManualRetry.call (cognitive 40): ManualRetry.call has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 7, ternaries 3 (6 pts), error handling 2 (3 pts), match/switch 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":"lib/hive/recovery/manual_retry.rb"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa6d998dd0df6a191876e7a4e81b939f3a75d0b3cc5822bd6a1742ae9f0198c"}},{"ruleId":"D2","level":"warning","message":{"text":"Router.classify (cognitive 39): Router.classify has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (31 pts), boolean chains 7, match/switch 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/bot/router.rb"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b790a63b44a4981017d0f1250f56a97c1189dabd8269956ec4458cb589b87e2"}},{"ruleId":"D2","level":"warning","message":{"text":"CeDocReview.call (cognitive 39): CeDocReview.call has cognitive complexity 39 (threshold 15). Drivers by points: error handling 6 (16 pts), ternaries 2 (9 pts), if/else 7 (8 pts), boolean chains 6 (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":"lib/hive/plan_review/adapters/ce_doc_review.rb"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"076a439109f3f68293a653dccd0ac23d161040b30db99feaf2376410f61fb62b"}},{"ruleId":"D2","level":"warning","message":{"text":"Babysit.stop_daemon (cognitive 38): Babysit.stop_daemon has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (24 pts), ternaries 3 (6 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/babysit.rb"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccffc2b83e55008cdcc89f4ad4f72ea24bfd3c7057f6359ca4865ea879cebae9"}},{"ruleId":"D2","level":"warning","message":{"text":"Rebase.resolve_conflicts (cognitive 38): Rebase.resolve_conflicts has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 4 (12 pts), boolean chains 5, ternaries 1 (3 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/rebase.rb"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb588f5d12081be8c5acf02dfcabcd4308a268dcbea354a9277dd6c48a3f473e"}},{"ruleId":"D2","level":"warning","message":{"text":"PostMergeBatchStore.parse_record (cognitive 38): PostMergeBatchStore.parse_record has cognitive complexity 38 (threshold 15). Drivers by points: boolean chains 28, if/else 8 (9 pts), error handling 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/post_merge_batch_store.rb"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"287de3d5db095793c98a6103b04742ccd944aee93d1bdbba3992955040ca9bfe"}},{"ruleId":"D2","level":"warning","message":{"text":"Run.report_text (cognitive 37): Run.report_text has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (26 pts), ternaries 2 (8 pts), boolean chains 2, match/switch 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/run.rb"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f80f9acd746154162298f1627beb00275bbda7a1ac8987ec0282386f49a70fe"}},{"ruleId":"D2","level":"warning","message":{"text":"UserService.complete_lifecycle (cognitive 37): UserService.complete_lifecycle has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (28 pts), boolean chains 8, ternaries 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":"lib/hive/user_service.rb"},"region":{"startLine":1495}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a89b315a5e457b7b58b5976808b36d437cb242abad131844ff4c947868f938"}},{"ruleId":"D2","level":"warning","message":{"text":"Agent.handle_exit (cognitive 36): Agent.handle_exit has cognitive complexity 36 (threshold 15). Drivers by points: if/else 22 (31 pts), boolean chains 4, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/agent.rb"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d702576d89cdfe6cf90a7027eb19724d765266b392cc4aa3f3ba71096e1a17"}},{"ruleId":"D2","level":"warning","message":{"text":"Reconciler.completion_first_disposition (cognitive 36): Reconciler.completion_first_disposition has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 10, error handling 1 (3 pts), ternaries 1 (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":"lib/hive/attempts/reconciler.rb"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea555072ada7d37487481986dc33835a1007df870fff44e08fd5411888abd29e"}},{"ruleId":"D2","level":"warning","message":{"text":"RefactorPatrolScheduler.reserve (cognitive 36): RefactorPatrolScheduler.reserve has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 7, error handling 5 (6 pts), ternaries 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/refactor_patrol_scheduler.rb"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"5538fbd83749cd863495500c725ce247118453fa79429eb40e17f809d3e3b77c"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler.reconcile_existing! (cognitive 36): Scheduler.reconcile_existing! has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18 (24 pts), boolean chains 10, error handling 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/llm_wiki_bootstrap/scheduler.rb"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44e89d8282f16820da8c654001d11726f5714cc78e2ecb886229a915e94a701"}},{"ruleId":"D2","level":"warning","message":{"text":"CiFix.run_ci_once (cognitive 36): CiFix.run_ci_once has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18 (26 pts), error handling 4 (5 pts), ternaries 3 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/review/ci_fix.rb"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa29e6a41e8be85f2bb562d5df1aae51a505ca27835f5ee139b103a6b8f85a2"}},{"ruleId":"D2","level":"warning","message":{"text":"PublishReceipt.validate_optional_fields! (cognitive 36): PublishReceipt.validate_optional_fields! has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 10 (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":"lib/hive/workflow_package/publish_receipt.rb"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ee51e62862b2498085603452c0588f4be83cd1e016aefd4843bd8380d9d385"}},{"ruleId":"D2","level":"warning","message":{"text":"Supervisor.command_success_text (cognitive 35): Supervisor.command_success_text has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 15 (30 pts), if/else 3 (4 pts), match/switch 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/bot/supervisor.rb"},"region":{"startLine":1502}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9fe694defa1f518f8a561f2c78ac4aa5163140cd900907f193bc646e34bb0e8"}},{"ruleId":"D2","level":"warning","message":{"text":"Status.collect_rows (cognitive 35): Status.collect_rows has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 7, error handling 5 (7 pts), ternaries 3 (4 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"lib/hive/commands/status.rb"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe0fa0c3f1acd3b18ec5a29ed8c34269aab96da100875317e641ae641e6f7b2"}},{"ruleId":"D2","level":"warning","message":{"text":"Dispatcher.record_completed (cognitive 35): Dispatcher.record_completed has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 8, ternaries 2 (6 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":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":1535}}}],"partialFingerprints":{"codehealthFindingId/v1":"f325961c37101af61bd7e5242a85416d9de21a5ed919e3c5dbdc23a424b92bc2"}},{"ruleId":"D2","level":"warning","message":{"text":"PrManifest.validate_v3! (cognitive 35): PrManifest.validate_v3! has cognitive complexity 35 (threshold 15). Drivers by points: boolean chains 27, if/else 8. 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":"lib/hive/refactor_patrol/pr_manifest.rb"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"889ee06885f81c93e70e894315e585f84ef338844062444e6647902dc5cf3e5d"}},{"ruleId":"D2","level":"warning","message":{"text":"ScheduledSliceProducer.validate_result_record! (cognitive 35): ScheduledSliceProducer.validate_result_record! has cognitive complexity 35 (threshold 15). Drivers by points: boolean chains 29, if/else 6. 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":"lib/hive/refactor_patrol/scheduled_slice_producer.rb"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74d5c7897d888391d762db14a85e8ecac45dfdf67d895afa0fabb2883364a64"}},{"ruleId":"D2","level":"warning","message":{"text":"Arguments.initialize (cognitive 35): Arguments.initialize has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (28 pts), boolean chains 6, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/remote/dispatcher.rb"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc24207e67302156301d5e87cebd314c2c31cf89964e070cc52f92b710b6fbe"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentReport.parse_sections (cognitive 35): AgentReport.parse_sections has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (30 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/agent_report.rb"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"faff06bf523536d5305ecdbdb3bbcdeccdce4c11587caf74ea0bd79b24d2691e"}},{"ruleId":"D2","level":"warning","message":{"text":"Review.run_reviewers (cognitive 35): Review.run_reviewers has cognitive complexity 35 (threshold 15). Drivers by points: if/else 21 (25 pts), boolean chains 7, ternaries 1 (3 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"lib/hive/stages/review.rb"},"region":{"startLine":1913}}}],"partialFingerprints":{"codehealthFindingId/v1":"8157220b84b53dfa0e34f60a0d3392cd530d36fc57238627834d224ca195e914"}},{"ruleId":"D2","level":"warning","message":{"text":"Execute.run_pass (cognitive 34): Execute.run_pass has cognitive complexity 34 (threshold 15). Drivers by points: boolean chains 15, if/else 13, error handling 4 (5 pts), ternaries 1 (nesting depth added 1). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/execute.rb"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f617e3245d0f17ad25a70c16a363737ec06ee15616718b07fe1810cfbeb77d7"}},{"ruleId":"D2","level":"warning","message":{"text":"Artifacts.verify_directory! (cognitive 34): Artifacts.verify_directory! has cognitive complexity 34 (threshold 15). Drivers by points: boolean chains 19, if/else 14, error handling 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/release_candidate/artifacts.rb"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b3a9d605917942d44af8f2f1c7a025bedeac1d867eaa6f302ac497231b99a2"}},{"ruleId":"D2","level":"warning","message":{"text":"BrowserGateway.publish_media! (cognitive 33): BrowserGateway.publish_media! has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (15 pts), error handling 5 (11 pts), boolean chains 5, loops 1, ternaries 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/artifacts/browser_gateway.rb"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"929369a32f8513c93caf87ff3c27bcccecbac9217555a8929c368de849e24415"}},{"ruleId":"D2","level":"warning","message":{"text":"CommandOperation.replay (cognitive 33): CommandOperation.replay has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 11, ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/command_operation.rb"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b8611e88a31d0433278d95065e0795bc17e5fa0d4c5faed2b8db0ba3b5b18e"}},{"ruleId":"D2","level":"warning","message":{"text":"Proposals.evidence! (cognitive 33): Proposals.evidence! has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 10 (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":"lib/hive/proposals.rb"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"5473379b0fd5548593d51cbe26e97bbb728fa451982d8d067db973bbb75a5920"}},{"ruleId":"D2","level":"warning","message":{"text":"CiFix.run! (cognitive 33): CiFix.run! has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 15 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/review/ci_fix.rb"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b4edacbcf1f3ee209b3da9aa7c2fbe7a2e98ac78f98d94e47a48ba251da20f"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskClosure.validate_receipt_semantics! (cognitive 33): TaskClosure.validate_receipt_semantics! has cognitive complexity 33 (threshold 15). Drivers by points: boolean chains 23, if/else 7 (9 pts), error handling 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_closure.rb"},"region":{"startLine":1255}}}],"partialFingerprints":{"codehealthFindingId/v1":"be363f6eb6db17a052e310658e8cd18be2140291405b90d82ad9636f2ff251e3"}},{"ruleId":"D2","level":"warning","message":{"text":"Publication.publication_state (cognitive 33): Publication.publication_state has cognitive complexity 33 (threshold 15). Drivers by points: if/else 24 (28 pts), boolean chains 5 (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":"lib/hive/task_workspace/publication.rb"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed86048f130b5d3aa65e8ab564c13d35cabcf511b2e07ac8fce85effbdc2db8"}},{"ruleId":"D2","level":"warning","message":{"text":"Daemon.stop_daemon (cognitive 32): Daemon.stop_daemon has cognitive complexity 32 (threshold 15). Drivers by points: if/else 19 (26 pts), boolean chains 4, loops 1, match/switch 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":"lib/hive/commands/daemon.rb"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"7942d861ef8d92502daae85f92c555ca189c9e105fac1d94bab5250793bd26da"}},{"ruleId":"D2","level":"warning","message":{"text":"Policy.decide (cognitive 32): Policy.decide has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 12, ternaries 2 (4 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"lib/hive/daemon/policy.rb"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"88943199033a1876d5e6baa33efedc1386b9300fd689bc73b1d10978afce14a2"}},{"ruleId":"D2","level":"warning","message":{"text":"Review.finalize_review_outcome (cognitive 32): Review.finalize_review_outcome has cognitive complexity 32 (threshold 15). Drivers by points: if/else 20 (22 pts), boolean chains 8, error handling 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/review.rb"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2dc242fc09f382c882ee0dd99ed5be5222e2b6283b7ca217cea1b33cff7b0b"}},{"ruleId":"D2","level":"warning","message":{"text":"Runner.wait_for_settlement! (cognitive 32): Runner.wait_for_settlement! has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 7, ternaries 1 (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":"lib/hive/stages/review/remote_ci.rb"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"92bb960f51ecaf284d6a6527165025bd1c951d5848cf30a290a180317d661ad2"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskMeta.write (cognitive 32): TaskMeta.write has cognitive complexity 32 (threshold 15). Drivers by points: if/else 26 (28 pts), boolean chains 2, error handling 1, ternaries 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, 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":"lib/hive/task_meta.rb"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62813622f55277d29f03ac05657b1fce7c5bfff2d5b14335ebd25f9b15aae4e"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonlReader.call (cognitive 32): JsonlReader.call has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (16 pts), error handling 5 (11 pts), boolean chains 4, ternaries 1 (nesting depth added 7). 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":"lib/hive/task_workspace/jsonl_reader.rb"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecdeb82d93c7073bae53accd27a0af9518173a4cfae85a8ed6cb9f80be9e5e77"}},{"ruleId":"D2","level":"warning","message":{"text":"CaptureToolkit.prepare! (cognitive 31): CaptureToolkit.prepare! has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (15 pts), error handling 4 (10 pts), boolean chains 5, ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/artifacts/capture_toolkit.rb"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"c505620170635ac6be52994f56551e385e27c471316b6eca6c72b26dea9c9915"}},{"ruleId":"D2","level":"warning","message":{"text":"CLI.daemon (cognitive 31): CLI.daemon has cognitive complexity 31 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 8 (nesting depth added 5). 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":"lib/hive/cli.rb"},"region":{"startLine":2183}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc3c2c6c0ab103b8f98d9b260e40a4caaa78295479ba028cf880da1bae28ec0"}},{"ruleId":"D2","level":"warning","message":{"text":"Setup.call (cognitive 31): Setup.call has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 3, error handling 1 (2 pts), ternaries 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/setup.rb"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff81c40a2b87ab3444d60afc631c2d57b198dc02d2c851bfa93e4498ff9f619"}},{"ruleId":"D2","level":"warning","message":{"text":"Dispatcher.dispatch_request_pending_item (cognitive 31): Dispatcher.dispatch_request_pending_item has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 9, ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"55cdce04f5590643148ace7723fb7ca8fa4983cba08959b3b5dec6d0da5f0053"}},{"ruleId":"D2","level":"warning","message":{"text":"Controller.validate_state_relations! (cognitive 31): Controller.validate_state_relations! has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 16, if/else 11 (15 pts) (nesting depth added 4). 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":"lib/hive/github_publication.rb"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"53766e1bb9245d2395c25c193039c46b85f508b495180037dcbc494a097bac16"}},{"ruleId":"D2","level":"warning","message":{"text":"JobRecordValidator.validate_discovery_attempts! (cognitive 31): JobRecordValidator.validate_discovery_attempts! has cognitive complexity 31 (threshold 15). Drivers by points: if/else 17 (24 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":"lib/hive/refactor_patrol/job_record_validator.rb"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b6eafe70b917e57258ba58bfce0f018a1d9e6e45e0602ba6cabe7d468b3326"}},{"ruleId":"D2","level":"warning","message":{"text":"ReviewBudget.observe (cognitive 31): ReviewBudget.observe has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 7, error handling 2 (3 pts), ternaries 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":"lib/hive/review_budget.rb"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ebb3db96d0b58b9a822f9c43afc2203021a33e16066059d3e71e4786fbf0e39"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentWorktree.run! (cognitive 31): AgentWorktree.run! has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 11, error handling 2, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/agent_worktree.rb"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecacb983f7bd8f5f9de4927f2951aec9426322b3d546e0af6036f0043dffe140"}},{"ruleId":"D2","level":"warning","message":{"text":"BubbleModel.bubble_key_to_keymap (cognitive 31): BubbleModel.bubble_key_to_keymap has cognitive complexity 31 (threshold 15). Drivers by points: if/else 18, boolean chains 12, ternaries 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/tui/bubble_model.rb"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b9c22c5e5b1fe3bc007a5c1175bd23bcaf5abb3de3f67905b08ce66cd98b51"}},{"ruleId":"D2","level":"warning","message":{"text":"KeyMap.grid_message (cognitive 31): KeyMap.grid_message has cognitive complexity 31 (threshold 15). Drivers by points: if/else 20 (23 pts), boolean chains 8 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/tui/key_map.rb"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ef9503a2425f8e6234041e98a51dfab7551e2a38cd82e8e18520e24b085ac0"}},{"ruleId":"D2","level":"warning","message":{"text":"RegistrySubmission.submit_locked (cognitive 31): RegistrySubmission.submit_locked has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (21 pts), error handling 2 (5 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/workflow_package/registry_submission.rb"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a237b1736eb5e90c96799b4fd0fd68d571d1ba5b79322b516efe833c09f7cb"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskLogsHelper.task_log_event_entries (cognitive 31): TaskLogsHelper.task_log_event_entries has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 7 (19 pts), if/else 5 (7 pts), match/switch 2 (3 pts), boolean chains 2 (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":"web/app/helpers/task_logs_helper.rb"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e86889bced6b344a45d19a7616664f3f2929089848ef4ab222924dd633b0178"}},{"ruleId":"D2","level":"warning","message":{"text":"Agent.initialize (cognitive 30): Agent.initialize has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 13 (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":"lib/hive/agent.rb"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"0630b9fc26bf29f09d668f14bc6794d7db143ef268bd242a1607ba4814b0fca2"}},{"ruleId":"D2","level":"warning","message":{"text":"CommandReceiptPruner.prune (cognitive 30): CommandReceiptPruner.prune has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (15 pts), error handling 4 (10 pts), boolean chains 4, ternaries 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":"lib/hive/command_receipt_pruner.rb"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"5adf4ade1e796993c2d52c69970e85245cef6f8f3a7c3326535ea9f8ae121271"}},{"ruleId":"D2","level":"warning","message":{"text":"RefactorPatrolMergeProgressStore.validate_scan! (cognitive 30): RefactorPatrolMergeProgressStore.validate_scan! has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 21, if/else 8, error handling 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/refactor_patrol_merge_progress_store.rb"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f4e60eb8badac99136b95dfbe362373a183f328bdfcaac4b9ff72893f7ec8c"}},{"ruleId":"D2","level":"warning","message":{"text":"Controller.validate_state (cognitive 30): Controller.validate_state has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 22, if/else 6 (7 pts), error handling 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/github_publication.rb"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"86aa6ef7af349855564fb9736ec316bf3e8e6ff6fa3b85b008314f0205a9929c"}},{"ruleId":"D2","level":"warning","message":{"text":"WorktreeReceipt.read (cognitive 30): WorktreeReceipt.read has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12, error handling 4 (10 pts), boolean chains 8 (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":"lib/hive/patrol_fix/worktree_receipt.rb"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"4219dd580af0b86d257742a27fcc9f34acec79b966c43d72e8954d4eccffa762"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcessRegistry.exited_process_evidence (cognitive 30): ProcessRegistry.exited_process_evidence has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 7, error handling 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":"lib/hive/runtime_control_plane/process_registry.rb"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"f615827c1efe7b317d20518192d84014df5e741e15a15ca61db1dcfcd5b66068"}},{"ruleId":"D2","level":"warning","message":{"text":"MutationsController.mutation_input! (cognitive 30): MutationsController.mutation_input! has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 11 (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":"web/app/controllers/api/v1/mutations_controller.rb"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae177a80752ad47b326bda689cb83314c8526707f7cf720bdfdc31408ed7045"}},{"ruleId":"D2","level":"warning","message":{"text":"Supervisor.execute_dispatch (cognitive 29): Supervisor.execute_dispatch has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 4 (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/bot/supervisor.rb"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aded46d61d17fd7adfc3c3bb35ac0778dbfa817288ee7e5f55e157454539c03"}},{"ruleId":"D2","level":"warning","message":{"text":"Watch.run (cognitive 29): Watch.run has cognitive complexity 29 (threshold 15). Drivers by points: if/else 20 (26 pts), error handling 2 (3 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/watch.rb"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad807edd356d3e19c11a0f333ef2d5f7859c4211ceba3b6a942967eb5c8293db"}},{"ruleId":"D2","level":"warning","message":{"text":"OperationalStatus.classify (cognitive 29): OperationalStatus.classify has cognitive complexity 29 (threshold 15). Drivers by points: if/else 19 (22 pts), ternaries 4 (7 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/operational_status.rb"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2183c1fabd0c7ef8e0438c10795dd9c3317d41ec635f5d4bf3424e5f35c371a"}},{"ruleId":"D2","level":"warning","message":{"text":"JobRecordValidator.validate_publication_receipts! (cognitive 29): JobRecordValidator.validate_publication_receipts! has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 12 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/job_record_validator.rb"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3ce4fc69319e709acaf05d9010f71fd158b3410d605b058ba64b5411f7dc23"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskMeta.read (cognitive 29): TaskMeta.read has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 17, if/else 9, error handling 2 (3 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_meta.rb"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c700a29600a682fd981d4309f6439e18cdc57fa1a47442ac12bcee84f57e63"}},{"ruleId":"D2","level":"warning","message":{"text":"Config.validate_reviewer_entries! (cognitive 28): Config.validate_reviewer_entries! has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 9, ternaries 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/config.rb"},"region":{"startLine":3230}}}],"partialFingerprints":{"codehealthFindingId/v1":"acbf058fc7dc8181d91b215beb3e2221237c3dc76978842ccb9de6582e2dd609"}},{"ruleId":"D2","level":"warning","message":{"text":"RecoveryCoordinator.manual_evidence (cognitive 28): RecoveryCoordinator.manual_evidence has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 12, error handling 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, 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":"lib/hive/daemon/recovery_coordinator.rb"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7b7a74c7446a60b5e07003e224a763a50fb62388c578cb2f6fd73c6d0ff50c"}},{"ruleId":"D2","level":"warning","message":{"text":"Dispatcher.report_error (cognitive 28): Dispatcher.report_error has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 4 (14 pts), if/else 7 (12 pts), boolean chains 2 (nesting depth added 15). 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":"lib/hive/remote/dispatcher.rb"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"019343b078079b89f4991c43269c8264546a85e53a8dac8e1b3753dbc05c25aa"}},{"ruleId":"D2","level":"warning","message":{"text":"ReviewPublicationRecovery.project (cognitive 28): ReviewPublicationRecovery.project has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 7, ternaries 3 (6 pts), match/switch 1 (2 pts) (nesting depth added 5). 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":"lib/hive/review_publication_recovery.rb"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ee4fc1a362caee7bde1ddfb292a8ec9bea59db62f21de502b2a745e48fe68a"}},{"ruleId":"D2","level":"warning","message":{"text":"Publication.publish! (cognitive 28): Publication.publish! has cognitive complexity 28 (threshold 15). Drivers by points: error handling 6 (21 pts), if/else 6 (7 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":"lib/hive/stages/review/publication.rb"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2db963706f5e2e09e2c4a9c159bae104dddd0cad30d5c2037df46e8497a730e"}},{"ruleId":"D2","level":"warning","message":{"text":"Usage.call (cognitive 28): Usage.call has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 9, error handling 1, ternaries 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, 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":"lib/hive/task_workspace/usage.rb"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8ea2b0f01f7983f7093d80b1e4739c29e44b3542eec4267415bf65943327b3"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskDisplay.status (cognitive 28): TaskDisplay.status has cognitive complexity 28 (threshold 15). Drivers by points: if/else 19, ternaries 3 (7 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":"web/app/models/task_display.rb"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab35d4dc282109760794f2dc9c5ef4982ec17b49aac44a3ceb9a3e5e9e08299"}},{"ruleId":"D2","level":"warning","message":{"text":"Probe.call! (cognitive 27): Probe.call! has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12, boolean chains 6, error handling 3 (6 pts), ternaries 2 (3 pts) (nesting depth added 4). 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":"components/agent-cli-runtime/lib/agent_cli_runtime/opencode/probe.rb"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"33bf93ac06737f51966a755b16115c7e17690b3f676af0c74850ddd7a3a0ed54"}},{"ruleId":"D2","level":"warning","message":{"text":"Replay.classify_existing! (cognitive 27): Replay.classify_existing! has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 7, error handling 1 (2 pts), ternaries 1 (2 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/command_receipt_store/replay.rb"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df1a13cedb607d0deaaafa04fded93878e4e969f11bdcb0c4d30ceee54f2761"}},{"ruleId":"D2","level":"warning","message":{"text":"RecoveryCoordinator.projected_receipt_for_request (cognitive 27): RecoveryCoordinator.projected_receipt_for_request has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 3, ternaries 1 (3 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":"lib/hive/daemon/recovery_coordinator.rb"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"676002f13ffeca413e6759fd87e33972936c987950d89cfd2306e2b07b7571b9"}},{"ruleId":"D2","level":"warning","message":{"text":"StatusReport.running_state (cognitive 27): StatusReport.running_state has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 4, error handling 1 (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/status_report.rb"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b2d1910c01871c1036cf489b7496c6fa6bcc3f4f043a4cdc004b26746b73e7b"}},{"ruleId":"D2","level":"warning","message":{"text":"Context.walk (cognitive 27): Context.walk has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 2, 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":"lib/hive/dependency_admission.rb"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"570928a172f76b9ad6f6c6249a50f2011f960aa5a4abcd8e70b586008b251534"}},{"ruleId":"D2","level":"warning","message":{"text":"AdmissionStore.validate_state_invariants! (cognitive 27): AdmissionStore.validate_state_invariants! has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17 (23 pts), boolean chains 4 (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":"lib/hive/patrol_fix/admission_store.rb"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c098cb31f7b4db6d38a5b014fedab921f25ca18a9fea2178dae2753f87f567"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskClosure.normalize_input (cognitive 27): TaskClosure.normalize_input has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 6, ternaries 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_closure.rb"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"534535a5a8ce6154fec0ab7b01f83eb217bbd0638e639323884d5536fea149f3"}},{"ruleId":"D2","level":"warning","message":{"text":"Repository.observe_task_source (cognitive 26): Repository.observe_task_source has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 10, error handling 2 (3 pts), ternaries 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/attempts/repository.rb"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"044e8e1a89cb37b3ee221381a41afa64fa9afd9736038cb3d069e4deffb83ab6"}},{"ruleId":"D2","level":"warning","message":{"text":"Answer.decode_binding (cognitive 26): Answer.decode_binding has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 23, if/else 2, error handling 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/answer.rb"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a211e80a2b6e121931c73de6bbd4bcfa89aecf083e158f817665c463548be0"}},{"ruleId":"D2","level":"warning","message":{"text":"Config.register_project (cognitive 26): Config.register_project has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 10, ternaries 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, 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":"lib/hive/config.rb"},"region":{"startLine":1799}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5ab4fd4536622b2dbff1ad4735c946809dcd8ec60ae064593ebee10b33bf99"}},{"ruleId":"D2","level":"warning","message":{"text":"Config.validate_daily_digest! (cognitive 26): Config.validate_daily_digest! has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 10 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/config.rb"},"region":{"startLine":4554}}}],"partialFingerprints":{"codehealthFindingId/v1":"5253f5b8e0c53b295382caca8b8eacd686c8d2187197f4b3dc8fc3f1b14ed66f"}},{"ruleId":"D2","level":"warning","message":{"text":"Assembler.find_recovery_task (cognitive 26): Assembler.find_recovery_task has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 4 (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":"lib/hive/daemon/operational_snapshot.rb"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ff304c4fc68b9216cb81be4786ce6c9279613c6507b85f184ea13e2a141c17"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectSource.boundary_attention (cognitive 26): ProjectSource.boundary_attention has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 7, ternaries 2 (3 pts), error handling 1, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daily_digest/project_source.rb"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfdbee7a4e2c83c6112f3a03cb6611f5a0207ea51247cb5758fa84315e5106ee"}},{"ruleId":"D2","level":"warning","message":{"text":"Controller.reconcile_revision (cognitive 26): Controller.reconcile_revision has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (17 pts), error handling 2 (5 pts), boolean chains 4 (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":"lib/hive/github_publication.rb"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d5a44c231eedabce9efb250b00e76b0006d3d1f31a9e555b96a71cd18d8f55"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelPricing.selected_rates (cognitive 26): ModelPricing.selected_rates has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/model_pricing.rb"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"35592033e48bb33ee5f12e66c9d378e6768403076e53300064cbddacd40e1c01"}},{"ruleId":"D2","level":"warning","message":{"text":"AdmissionStore.validate_record! (cognitive 26): AdmissionStore.validate_record! has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 8, error handling 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":"lib/hive/patrol_fix/admission_store.rb"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b5d2bf71ae317826ad257f084d120106f59ad11758f7062e8a522b60a6e5b5"}},{"ruleId":"D2","level":"warning","message":{"text":"JobRecordValidator.validate_post_merge_source! (cognitive 26): JobRecordValidator.validate_post_merge_source! has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 14, if/else 12. 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":"lib/hive/refactor_patrol/job_record_validator.rb"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"848bf8fb28630f79602a9db3df869db3094fb8551b1d29ce16bd9c6e63f318d5"}},{"ruleId":"D2","level":"warning","message":{"text":"ActivationGate.default_status_route? (cognitive 26): ActivationGate.default_status_route? has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/runtime_control_plane/activation_gate.rb"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"857756252bc95e3aee5c040093b0ef0c1440866f553af24f3f8c979c8bec5561"}},{"ruleId":"D2","level":"warning","message":{"text":"Database.transaction (cognitive 26): Database.transaction has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 6, ternaries 4, error handling 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/runtime_control_plane/database.rb"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6a14ae741ad7912b1aa9522c3a82964630a7b4177ec7fa3d6b4eefea0b7cae"}},{"ruleId":"D2","level":"warning","message":{"text":"Artifacts.run_role! (cognitive 26): Artifacts.run_role! has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 10, error handling 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/artifacts.rb"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9ee4ffb803b4da0c94b102ef18a7f37a48a08dcd40557f43cd2a7a23974150"}},{"ruleId":"D2","level":"warning","message":{"text":"BubbleModel.submit_rich_new_idea (cognitive 26): BubbleModel.submit_rich_new_idea has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 3 (5 pts), error handling 2 (4 pts), boolean chains 3 (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":"lib/hive/tui/bubble_model.rb"},"region":{"startLine":2479}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8c29bf437e1fdcfb16d8291b19deea061207be20d6961db1166a96b8498f99"}},{"ruleId":"D2","level":"warning","message":{"text":"RegistryClient.validate_version_entry! (cognitive 26): RegistryClient.validate_version_entry! has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 13, if/else 11, error handling 1, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/workflow_package/registry_client.rb"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"938038894a8d297fcdb0b2532c8d5ece0c37cbeabe53caf3c6a89247701b688f"}},{"ruleId":"D2","level":"warning","message":{"text":"BaselineCatalog.verify_dependency_closure! (cognitive 26): BaselineCatalog.verify_dependency_closure! has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 17, if/else 8, error handling 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/release_candidate/baseline_catalog.rb"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"551d71bd001c563cf438c8e078b877ae5c2fb0b55cba48996681989b5eec70c2"}},{"ruleId":"D2","level":"warning","message":{"text":"Record.validate_receipt! (cognitive 25): Record.validate_receipt! has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16, boolean chains 6, ternaries 2, error handling 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/attempts/record.rb"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6fb4a2d1b77e422e4b01c54abf69980ce3e36a9a295e64f4b775cbdd4e88256"}},{"ruleId":"D2","level":"warning","message":{"text":"Setup.emit (cognitive 25): Setup.emit has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/setup.rb"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8416a4d0f6a8150bbd0f3a4c8dbe41c36a2b8b48a15e6f572f2ea45a2cd4fc7"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectSource.collect_journal (cognitive 25): ProjectSource.collect_journal has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 4, error handling 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daily_digest/project_source.rb"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ddadbc9e6d224cce8b9f2e59184f70a0cfa7a85dce3438399a16adf5118982"}},{"ruleId":"D2","level":"warning","message":{"text":"GitOps.hive_commit (cognitive 25): GitOps.hive_commit has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/git_ops.rb"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c3718450385a51f80b49b9f743214f861f5ac87f7bb510977719a7ee752c25"}},{"ruleId":"D2","level":"warning","message":{"text":"JobStore.claim_action! (cognitive 25): JobStore.claim_action! has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 3, error handling 2 (3 pts), ternaries 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":"lib/hive/refactor_patrol/job_store.rb"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce3f8cea51b4483db65ba771558059310c66f6af6cc5224160d7b8b72092147"}},{"ruleId":"D2","level":"warning","message":{"text":"OperationProjection.workflow_progress (cognitive 25): OperationProjection.workflow_progress has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 10, if/else 8 (9 pts), ternaries 2 (6 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":"lib/hive/remote/operation_projection.rb"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"851479f3145373501c65323dc28d340a692c507db8d125f682b53f1d28aadf14"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.audit_tail (cognitive 25): Store.audit_tail has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 15, if/else 7, error handling 1, match/switch 1, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/review_budget/store.rb"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee3e53c1aa294b5a2cb1cbaca15ddf0cbc4c98ac43cc561700e56427993776e"}},{"ruleId":"D2","level":"warning","message":{"text":"Review.run_ci_gates (cognitive 25): Review.run_ci_gates has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 4, ternaries 3, 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, 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":"lib/hive/stages/review.rb"},"region":{"startLine":2656}}}],"partialFingerprints":{"codehealthFindingId/v1":"26607df8a33700af9d8083434ea59e6b167e4fb530d12819c608e2620772a9c5"}},{"ruleId":"D2","level":"warning","message":{"text":"UserService.lifecycle_effect (cognitive 25): UserService.lifecycle_effect has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 2 (5 pts), boolean chains 3, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/user_service.rb"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"278086a7f852a4056dd19f787d55dc7b835c3e1d3e8b8b46e74d6295d9923963"}},{"ruleId":"D2","level":"warning","message":{"text":"HiveBetterleaksPackage.download_archive (cognitive 25): HiveBetterleaksPackage.download_archive has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 6, ternaries 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/betterleaks.rb"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fef6d3ddd66dca5f171b21047a5829b7229b679495128eb7c68a9ca1125992c"}},{"ruleId":"D2","level":"warning","message":{"text":"ReleaseSelector.validate_ordinary_ci! (cognitive 25): ReleaseSelector.validate_ordinary_ci! has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 23, if/else 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":"packaging/release_candidate/release_selector.rb"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb52ca4008cd39277ce5603221f9d796f715944885a671f8aa26cdf9ebbe0de"}},{"ruleId":"D2","level":"warning","message":{"text":"Decide.complete! (cognitive 24): Decide.complete! has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (18 pts), error handling 2 (5 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/decide.rb"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"11dcc8ce4e8e353805eafd6203a1d992dfa06bd8c56dd993aa29a29b2d193a4e"}},{"ruleId":"D2","level":"warning","message":{"text":"RefactorPatrol.run_cycle (cognitive 24): RefactorPatrol.run_cycle has cognitive complexity 24 (threshold 15). Drivers by points: if/else 18 (19 pts), boolean chains 5 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/refactor_patrol.rb"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8f55bb6f891770fcd667aaca2df1c491a8cb766aedb85e58388b720be86194"}},{"ruleId":"D2","level":"warning","message":{"text":"Dispatcher.dispatch_locked (cognitive 24): Dispatcher.dispatch_locked has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (15 pts), ternaries 4 (6 pts), boolean chains 3 (nesting depth added 5). 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":"lib/hive/modules/dispatcher.rb"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"033b860f9481626018ccd385f38c1b7ecc0d098702d5edcb99d3ce2451ef1ede"}},{"ruleId":"D2","level":"warning","message":{"text":"RunningStatus.read_metadata (cognitive 24): RunningStatus.read_metadata has cognitive complexity 24 (threshold 15). Drivers by points: error handling 5 (15 pts), if/else 3 (7 pts), boolean chains 2 (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":"lib/hive/running_status.rb"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e26798993ff31713f3f30ac5649cb2f30500e6600c61adf5d05a4ef3f7a0a27"}},{"ruleId":"D2","level":"warning","message":{"text":"Council.run! (cognitive 24): Council.run! has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 12, if/else 9, error handling 2 (3 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/council.rb"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"045de9c69c95bc3ed71e0ad0945ac152bd4ff15c2a6e054e931c4df2941469b5"}},{"ruleId":"D2","level":"warning","message":{"text":"FixGuardrail.scan_diff (cognitive 24): FixGuardrail.scan_diff has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 6, ternaries 1 (3 pts), match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"lib/hive/stages/review/fix_guardrail.rb"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"80505d08e10f94b02a0b126a61806da128686a9c531f9734d3c4cb4b1601d3ff"}},{"ruleId":"D2","level":"warning","message":{"text":"Reconciler.reconcile_record (cognitive 23): Reconciler.reconcile_record has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, ternaries 3 (5 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/attempts/reconciler.rb"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"b694a9cfba09159da39b048e1777bc4111f289634bc3888db195c2bafa3946e8"}},{"ruleId":"D2","level":"warning","message":{"text":"Record.validate! (cognitive 23): Record.validate! has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13, boolean chains 9, error handling 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/attempts/record.rb"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a0070d501976d202e0ce59275740c9daf59206aff1ba9184432a956b895ce7"}},{"ruleId":"D2","level":"warning","message":{"text":"Record.validate_state_fields! (cognitive 23): Record.validate_state_fields! has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/attempts/record.rb"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef2715c5f07bd82f866e232e854f1e2083ff5322de4b445c62d78940074515f"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectTick.run (cognitive 23): ProjectTick.run has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (17 pts), error handling 3 (4 pts), boolean chains 1, 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":"lib/hive/babysitter/project_tick.rb"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"9943848f00f0bdac03fb571a87a3a44e3a3edbad5164250f40bad49cc0974716"}},{"ruleId":"D2","level":"warning","message":{"text":"Dispatcher.run_forever (cognitive 23): Dispatcher.run_forever has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 3, 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":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2bca614ca9d46a1216545cf38a254760972f6637e1c1cf5f50f158b5dbec58"}},{"ruleId":"D2","level":"warning","message":{"text":"RefactorPatrolMergeReconciler.reconcile_step (cognitive 23): RefactorPatrolMergeReconciler.reconcile_step has cognitive complexity 23 (threshold 15). Drivers by points: error handling 5 (11 pts), if/else 6, boolean chains 5, 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":"lib/hive/daemon/refactor_patrol_merge_reconciler.rb"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"968ca93590ed911b681a0a5fbc41194d462addeec1629794ef0a09c54bbe719c"}},{"ruleId":"D2","level":"warning","message":{"text":"RefactorPatrolMergeReconciler.scan_page_step (cognitive 23): RefactorPatrolMergeReconciler.scan_page_step has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 4, error handling 3 (4 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"lib/hive/daemon/refactor_patrol_merge_reconciler.rb"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1ac7f54c5c58c61e99b87cad680e64916e417a4c4679b4e6b86f4e39f03254"}},{"ruleId":"D2","level":"warning","message":{"text":"Coordinator.materialize (cognitive 23): Coordinator.materialize has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 7, error handling 2 (4 pts), ternaries 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daily_digest/coordinator.rb"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a488c1927dd09a06676888a459f38135f1d294440add215d4464a72cc13ff4"}},{"ruleId":"D2","level":"warning","message":{"text":"OperationalStatus.project_row (cognitive 23): OperationalStatus.project_row has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 8, ternaries 1 (3 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":"lib/hive/operational_status.rb"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91724917d4a66f740f459f6ae1b9c2ef5daedabbc8c59cf7b6dd99b9924c8cc"}},{"ruleId":"D2","level":"warning","message":{"text":"OperationalStatus.recovery_payload (cognitive 23): OperationalStatus.recovery_payload has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 6, ternaries 2 (3 pts), match/switch 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, 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":"lib/hive/operational_status.rb"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30497b4f2de51b745891840c6ad7264657a2017af0885bc5471d4752d072423"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskClosure.validate_receipt_evidence! (cognitive 23): TaskClosure.validate_receipt_evidence! has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 11, if/else 9 (11 pts), error handling 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_closure.rb"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5dbc6e80177310f88ea18937b7e796f2deb14227bbc2803db707ac08275152a"}},{"ruleId":"D2","level":"warning","message":{"text":"Publication.read_pr (cognitive 23): Publication.read_pr has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 10, if/else 10, ternaries 1 (2 pts), error handling 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_workspace/publication.rb"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ddd8535e5c6cfe32aed4e6f54bb33c048d738701374855ceca696b7e8b00503"}},{"ruleId":"D2","level":"warning","message":{"text":"Timeline.call (cognitive 23): Timeline.call has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 7, ternaries 2 (5 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_workspace/timeline.rb"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"830675d4dee3b58433ab8bdb019ff5d9ef4ca7a64367bf2e692e602c365c9691"}},{"ruleId":"D2","level":"warning","message":{"text":"AuthoringLint.dynamic_destination (cognitive 23): AuthoringLint.dynamic_destination has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 2 (6 pts), boolean chains 3, error handling 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":"lib/hive/workflow_package/authoring_lint.rb"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c9f2975631c2a93cfa1d011e880fb92ccf01f19b27b7c39dfa547f3de00e6f"}},{"ruleId":"D2","level":"warning","message":{"text":"SecurityScanner.scan_text (cognitive 23): SecurityScanner.scan_text has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 6 (12 pts), boolean chains 7, if/else 4 (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":"lib/hive/workflow_package/security_scanner.rb"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"4380534de94be02f74e1333047c4c72ec8e6501ce96946940a187a9203eec19d"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowCreatorOpenClawRuntime.capture (cognitive 23): WorkflowCreatorOpenClawRuntime.capture has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 2, ternaries 1 (2 pts), error handling 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":"packaging/live_agent_skills/workflow_creator_openclaw_runtime.rb"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4dbb5493b2bcabd00e90ca9ebf9dc584960fc765bfb116c6f03d5055bbdd327"}},{"ruleId":"D2","level":"warning","message":{"text":"ReleaseSelector.validate_producer! (cognitive 23): ReleaseSelector.validate_producer! has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 20, if/else 3. 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":"packaging/release_candidate/release_selector.rb"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52cf4bfc679e463da3a11c8c23a918e9bde0a8d9ba50731be243a19d0c6026a"}},{"ruleId":"D2","level":"warning","message":{"text":"ResultParser.parse_inspection (cognitive 22): ResultParser.parse_inspection has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12, boolean chains 4, error handling 2 (3 pts), ternaries 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"components/agent-cli-runtime/lib/agent_cli_runtime/opencode/result_parser.rb"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"86941c6391059385ac6c0b65632ebcec2264ad2d7ad12be757ed2b5eb76b4313"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentGitGate.validate_transport_target (cognitive 22): AgentGitGate.validate_transport_target has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 6 (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":"lib/hive/agent_git_gate.rb"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"c330696c0c8e598d8623a6ca3d2de0265bf9b63593e856e2fe4a399d3bbef902"}},{"ruleId":"D2","level":"warning","message":{"text":"Context.validate_task_binding! (cognitive 22): Context.validate_task_binding! has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 11, if/else 8 (9 pts), error handling 1, ternaries 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/attempts/context.rb"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bfd6e45e1c2f64285bc3eab04e90aad1635ba88ab830660a1f8afc2719d751b"}},{"ruleId":"D2","level":"warning","message":{"text":"GhPolicy.api_read_only? (cognitive 22): GhPolicy.api_read_only? has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 2 (8 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/babysitter/gh_policy.rb"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"39736dc14790094e6c6d3e071bab56c6ce2701a57ac5edf0ad922349cf298dbc"}},{"ruleId":"D2","level":"warning","message":{"text":"Lifecycle.parse_grants (cognitive 22): Lifecycle.parse_grants has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 4, ternaries 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":"lib/hive/commands/module/lifecycle.rb"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c9eceaa60c879f371e7fb48e4ef29848dbb73fcb836c89517b4144938f48a6"}},{"ruleId":"D2","level":"warning","message":{"text":"Base.service_manager_availability (cognitive 22): Base.service_manager_availability has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 pts), ternaries 2 (4 pts), error handling 1, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/service_installer/base.rb"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ffaefdab3a6042721660770b42f1b9647f5ae0d775c3a7ee476c3d7f435c2e"}},{"ruleId":"D2","level":"warning","message":{"text":"Dispatcher.row_pending_item (cognitive 22): Dispatcher.row_pending_item has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (14 pts), ternaries 2 (4 pts), boolean chains 3, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f146ce77e6bd89ae4af36acc358941760bba6f136fb90fa70324392213e1c9"}},{"ruleId":"D2","level":"warning","message":{"text":"Dispatcher.handle_row (cognitive 22): Dispatcher.handle_row has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 6, match/switch 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, 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":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":2296}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a67d4ea602f9220286624ce27a62f9bcd6f072e20c2b51292ce41c8d0bfccae"}},{"ruleId":"D2","level":"warning","message":{"text":"PatrolScheduler.candidates (cognitive 22): PatrolScheduler.candidates has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 2, error handling 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":"lib/hive/daemon/patrol_scheduler.rb"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec30e972e8b060f056cb9f057b6d3e1f56b26f50194e017e39f6f038d2c945fe"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencySnapshot.base_selection (cognitive 22): DependencySnapshot.base_selection has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 2, error handling 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":"lib/hive/dependency_snapshot.rb"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"f988664bd048842bf2e0dfe5a952a8aa059d7b003484f9395120452578061b6c"}},{"ruleId":"D2","level":"warning","message":{"text":"ManagedStore.read_setup_outbox (cognitive 22): ManagedStore.read_setup_outbox has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 18, error handling 2 (3 pts), if/else 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/module_package/managed_store.rb"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"137c758cba9bb1b5ba80879adc552af5e64806f2d6b946a9145f9616e8c6deea"}},{"ruleId":"D2","level":"warning","message":{"text":"AttemptDiagnostic.validate! (cognitive 22): AttemptDiagnostic.validate! has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11, boolean chains 10, error handling 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol_fix/attempt_diagnostic.rb"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"807436ad89ea0cd4557369f3e21c4b742bfdadf23c832979c76a58779e4fa1b6"}},{"ruleId":"D2","level":"warning","message":{"text":"WorktreeSnapshot.capture (cognitive 22): WorktreeSnapshot.capture has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8, ternaries 4 (8 pts), boolean chains 5, error handling 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":"lib/hive/patrol_fix/worktree_snapshot.rb"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f6ec45a741d87cf07644d3de1128a7ae9d81726ee2501e831ee54d8bfe0333"}},{"ruleId":"D2","level":"warning","message":{"text":"DecisionTriage.validate! (cognitive 22): DecisionTriage.validate! has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 15, if/else 6 (7 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/plan_review/decision_triage.rb"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1be7b69a5f16777533c81b4f0ee60701380fe3577b5823eca51dff817a28b8"}},{"ruleId":"D2","level":"warning","message":{"text":"GithubGateway.merged_pr_details (cognitive 22): GithubGateway.merged_pr_details has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12, ternaries 3 (5 pts), boolean chains 4, error handling 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, 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":"lib/hive/refactor_patrol/github_gateway.rb"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"49de7170be0bfc89aa09b3374673ffd35a7741758df812e2ead94d3855732238"}},{"ruleId":"D2","level":"warning","message":{"text":"JobQuery.blockers (cognitive 22): JobQuery.blockers has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/job_query.rb"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49fec4be2091d4dc5b10e0eb5f5c228cae77d1bb2e6f28333ecd7d8c7a739a2"}},{"ruleId":"D2","level":"warning","message":{"text":"ReviewBudget.validate_exhaustion! (cognitive 22): ReviewBudget.validate_exhaustion! has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 7 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/review_budget.rb"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f498017854873d0453d2156dc0ed030a556a3d0833a57bb2e5a87ba12d6b274"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.validate_grant! (cognitive 22): Store.validate_grant! has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 16, if/else 6. 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":"lib/hive/review_budget/store.rb"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d76c4fc2840a5fb374400caa3948d570b3d62e7bc37170b9170038dd9e42cf"}},{"ruleId":"D2","level":"warning","message":{"text":"ReviewPublicationRecovery.decode (cognitive 22): ReviewPublicationRecovery.decode has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 14, if/else 6, error handling 1, match/switch 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/review_publication_recovery.rb"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79d4cce6b499e61d3060bdc8f72600628b4a950192c997b6eaa30dff5a270c2"}},{"ruleId":"D2","level":"warning","message":{"text":"Finalize.run! (cognitive 22): Finalize.run! has cognitive complexity 22 (threshold 15). Drivers by points: if/else 18 (19 pts), boolean chains 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/finalize.rb"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a98544b804f3e2b6e11184360cfe445084b0bfb97bd8ff4e3d0e02afd7fb76d"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskMeta.restore (cognitive 22): TaskMeta.restore has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (18 pts), ternaries 1 (2 pts), boolean chains 1, error handling 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":"lib/hive/task_meta.rb"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"19647ce0d76c3895436fff1cc89852dfc3c0a21dfd9c26de5adb21f3a7c27ec9"}},{"ruleId":"D2","level":"warning","message":{"text":"BoundedReader.read (cognitive 22): BoundedReader.read has cognitive complexity 22 (threshold 15). Drivers by points: error handling 4 (10 pts), if/else 8, boolean chains 4 (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":"lib/hive/task_workspace/bounded_reader.rb"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"106166b31610463da890872f71562ba90a365b85857faac481a04b3a0c1b835f"}},{"ruleId":"D2","level":"warning","message":{"text":"UserService.remove (cognitive 22): UserService.remove has cognitive complexity 22 (threshold 15). Drivers by points: error handling 5 (15 pts), if/else 4 (6 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/user_service.rb"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d8edcdc4f1459a8d061dc78fad120ee652ba896a28376f0ea0cc5aaf887367"}},{"ruleId":"D2","level":"warning","message":{"text":"PublishReceipt.validate_step_fields! (cognitive 22): PublishReceipt.validate_step_fields! has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/workflow_package/publish_receipt.rb"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"412ebbd2157f04d02b34619e537122b8b90b9736a739e5ac5c09fc376bb1d7d7"}},{"ruleId":"D2","level":"warning","message":{"text":"GitPolicy.unsafe_read_option? (cognitive 21): GitPolicy.unsafe_read_option? has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 6 (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":"lib/hive/babysitter/git_policy.rb"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd2c9b72c85a12e9e204366d56913e249fd7f42e6723c07d2fa542aaaea2452"}},{"ruleId":"D2","level":"warning","message":{"text":"Daemon.upsert_daemon_enabled (cognitive 21): Daemon.upsert_daemon_enabled has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3, loops 1 (2 pts), ternaries 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":"lib/hive/commands/daemon.rb"},"region":{"startLine":1419}}}],"partialFingerprints":{"codehealthFindingId/v1":"2818cf6b10fc6b0418a89d57174ac06a57ba490d43463f372cf094357c6e3427"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultSource.prepare_task_references (cognitive 21): DefaultSource.prepare_task_references has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/watch.rb"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0ba3615d7827e5ee25d11f4f5a8d3256a405ebed02a83116d3c7482374c1d8"}},{"ruleId":"D2","level":"warning","message":{"text":"Publish.error_payload (cognitive 21): Publish.error_payload has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (18 pts), error handling 1 (3 pts) (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/workflow/publish.rb"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"22bc29a9979c0e5c88f50092d6e687510c8ed5841ebe7ea13df1b0e516d73b2d"}},{"ruleId":"D2","level":"warning","message":{"text":"Config.validate_artifact_capture! (cognitive 21): Config.validate_artifact_capture! has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 11, if/else 10. 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":"lib/hive/config.rb"},"region":{"startLine":2906}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f3451882499136db85b99b969a9341ecc23920deaf796620860c1857746ac7"}},{"ruleId":"D2","level":"warning","message":{"text":"ContextProvenance.promote_agent_receipt (cognitive 21): ContextProvenance.promote_agent_receipt has cognitive complexity 21 (threshold 15). Drivers by points: error handling 5 (15 pts), boolean chains 3, if/else 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":"lib/hive/context_provenance.rb"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"383c51d675c004629d757a33369ca080b0d3cd505b81010734486c1937ceaeeb"}},{"ruleId":"D2","level":"warning","message":{"text":"Dispatcher.dispatch_or_block (cognitive 21): Dispatcher.dispatch_or_block has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10, error handling 3 (6 pts), boolean chains 5 (nesting depth added 3). 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":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":2592}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4944ff95d396153ed5d97dbd768937bcadfd338cde8fd7bc5f447ef4a6950a"}},{"ruleId":"D2","level":"warning","message":{"text":"RecoveryCoordinator.prepare_manual (cognitive 21): RecoveryCoordinator.prepare_manual has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 7, error handling 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":"lib/hive/daemon/recovery_coordinator.rb"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3479110e9cd3604d17776c43bc5957910257818f7fedaabe23c9ac2078bc6b8"}},{"ruleId":"D2","level":"warning","message":{"text":"RefactorPatrolScheduler.complete (cognitive 21): RefactorPatrolScheduler.complete has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (9 pts), error handling 3 (6 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/refactor_patrol_scheduler.rb"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"004596997ccc7e975c387084813db84eea4746ac620b2d7eadfc001c3608dc36"}},{"ruleId":"D2","level":"warning","message":{"text":"Record.prepare (cognitive 21): Record.prepare has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13, boolean chains 8. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daily_digest/record.rb"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b17ff728823bb86129409d15e3ab4514325075f11bc3fe0a00c13ae269de084"}},{"ruleId":"D2","level":"warning","message":{"text":"Controller.validate_record! (cognitive 21): Controller.validate_record! has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 15, if/else 5, error handling 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/github_publication.rb"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"43943acdc9ecb49d64405c54a5883acaf743596242d733e14325b69907c7c6e5"}},{"ruleId":"D2","level":"warning","message":{"text":"Transition.validate_intent (cognitive 21): Transition.validate_intent has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 19, error handling 1, if/else 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol_fix/transition.rb"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb54eaf1fef35e262edd8bd925c7d7d971567c8212c7185856c3b65ee5db9e6"}},{"ruleId":"D2","level":"warning","message":{"text":"Orchestrator.apply_verification (cognitive 21): Orchestrator.apply_verification has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 12, if/else 8, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/plan_review/orchestrator.rb"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f23f301c40412e6de26ff173c2f6f533c65237c76da4549a57933af0bf0b47"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcessKill.terminate_process (cognitive 21): ProcessKill.terminate_process has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (13 pts), ternaries 3 (5 pts), error handling 2 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"lib/hive/process_kill.rb"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f0dd95f3b5e94b6a0367d085b22f30fba397b76b27baaa44dd09fb69464d2d"}},{"ruleId":"D2","level":"warning","message":{"text":"JobRecordValidator.validate_job! (cognitive 21): JobRecordValidator.validate_job! has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14, boolean chains 6, error handling 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/job_record_validator.rb"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3fc53b44d61442a7812e56a1e1e79349cd79d970db3a84240ca6cee33dd9ad5"}},{"ruleId":"D2","level":"warning","message":{"text":"CommandPolicy.preflight! (cognitive 21): CommandPolicy.preflight! has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 7, error handling 1, ternaries 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":"lib/hive/remote/command_policy.rb"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3539ed6f330c84b33a328981d3f25167cebaeda4245a3154a39c42d14ab052"}},{"ruleId":"D2","level":"warning","message":{"text":"Dispatcher.validate_local! (cognitive 21): Dispatcher.validate_local! has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 7, ternaries 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":"lib/hive/remote/dispatcher.rb"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c36a191d9ce506d580995a81399f230f3488575504d1910dc4d99dc88281e26"}},{"ruleId":"D2","level":"warning","message":{"text":"PayloadStore.seal (cognitive 21): PayloadStore.seal has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (9 pts), error handling 4 (8 pts), boolean chains 3, 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":"lib/hive/runtime_control_plane/payload_store.rb"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec3c7460ce26d347154fffcfe996a12a91dcbb4f7d89ac00d63f70233f7cd8b"}},{"ruleId":"D2","level":"warning","message":{"text":"ErrorEnvelope.build (cognitive 21): ErrorEnvelope.build has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 1, ternaries 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":"lib/hive/schemas.rb"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"8182ce1d69c51b676ce50c2db6584199a521fc161d9e21f4b1785db4b047bb3c"}},{"ruleId":"D2","level":"warning","message":{"text":"BubbleModel.open_in_agent (cognitive 21): BubbleModel.open_in_agent has cognitive complexity 21 (threshold 15). Drivers by points: error handling 5 (15 pts), boolean chains 3, if/else 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":"lib/hive/tui/bubble_model.rb"},"region":{"startLine":1510}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb4ee977f38347f9f7f72d586f9181f6270e37c79269e43a05326f40c1dc531"}},{"ruleId":"D2","level":"warning","message":{"text":"UserService.remove_current (cognitive 21): UserService.remove_current has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 8, ternaries 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/user_service.rb"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"7638ed3456bf5cd5358db78d0d430a8abf618946a5e9ed4db2e1a1f75f527d3f"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowCreatorReceiptPublisher.settle (cognitive 21): WorkflowCreatorReceiptPublisher.settle has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 3, error handling 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":"packaging/live_agent_skills/workflow_creator_receipt_publisher.rb"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd257babe2635a779796b186efd584986659378adb358a1155c317a058957ba"}},{"ruleId":"D2","level":"warning","message":{"text":"BaselineCache.plan (cognitive 21): BaselineCache.plan has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 8, if/else 7, ternaries 5, error handling 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/release_candidate/baseline_cache.rb"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"445521b4c24df809e44db269ca6fba8f41a8613e40a3b4c7ec5cbab2d375f538"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.build_package (cognitive 20): Store.build_package has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 6, 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":"lib/hive/artifacts/outcome_evidence/store.rb"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d0959c2a68c2e9e899208e28deb2f94b70063b670c0bd351af866d6d50b752"}},{"ruleId":"D2","level":"warning","message":{"text":"GhPolicy.external_launcher_option? (cognitive 20): GhPolicy.external_launcher_option? has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 2 (6 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/babysitter/gh_policy.rb"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1bfcaaa0c5aa774b11356df3148aab35357d2d01764391c0910a84ad1c96ee2"}},{"ruleId":"D2","level":"warning","message":{"text":"CommandOperation.expand_template (cognitive 20): CommandOperation.expand_template has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 9, error handling 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":"lib/hive/command_operation.rb"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19b7859b9bb7cae2a7565e0822015026fe98f438c1aa9ead0ec6fb056063a3d"}},{"ruleId":"D2","level":"warning","message":{"text":"Daemon.start_daemon (cognitive 20): Daemon.start_daemon has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 5, error handling 2, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/daemon.rb"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"341ee30426fd68d4086ae64821b3ba3f9f15ff18946b4ec7c6ded9b9fc95ba6d"}},{"ruleId":"D2","level":"warning","message":{"text":"Evidence.gateway_request (cognitive 20): Evidence.gateway_request has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 9, if/else 8, error handling 2, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/evidence.rb"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"d452149ee45a9a182be29a70bc45628003f834430e11a7714fd52cd00d09ecea"}},{"ruleId":"D2","level":"warning","message":{"text":"Status.render_running (cognitive 20): Status.render_running has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (16 pts), ternaries 2 (4 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"lib/hive/commands/status.rb"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"87559735988cbcf589622b1518b81094bb63191c90fba33830edfc0fdda7e270"}},{"ruleId":"D2","level":"warning","message":{"text":"PatrolFixAdmissionScheduler.process (cognitive 20): PatrolFixAdmissionScheduler.process has cognitive complexity 20 (threshold 15). Drivers by points: error handling 5 (9 pts), if/else 7 (9 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/patrol_fix_admission_scheduler.rb"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89f12a631f1c35991d04bceff5ba7f0fbda313f1e23dc3cd5dbe73b2efa549d"}},{"ruleId":"D2","level":"warning","message":{"text":"Quiescence.run_under_operation_lock (cognitive 20): Quiescence.run_under_operation_lock has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16 (20 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"lib/hive/daemon/quiescence.rb"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5507156e4ebf6892c2838643ff1de0787a413cb1706ddfc668715068a6f961"}},{"ruleId":"D2","level":"warning","message":{"text":"RecoveryCoordinator.mark_dispatched (cognitive 20): RecoveryCoordinator.mark_dispatched has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, ternaries 4 (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":"lib/hive/daemon/recovery_coordinator.rb"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"6970be1526e8b0c86b23300f02e063c840c88712825451d951df5d5838c8c457"}},{"ruleId":"D2","level":"warning","message":{"text":"Manifest.validate_settings! (cognitive 20): Manifest.validate_settings! has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 8 (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":"lib/hive/module_package/manifest.rb"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75f3e38c6c7d6f03309fd06f264faa91ac7000a396bea7d93fdff115f43f1ab"}},{"ruleId":"D2","level":"warning","message":{"text":"Mapper.command_features (cognitive 20): Mapper.command_features has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol/mapper.rb"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdfc2057c4760d0be9be2a51b4aecb3093a7bc9a9a431b8c8c7c477d21ea7859"}},{"ruleId":"D2","level":"warning","message":{"text":"Projection.project (cognitive 20): Projection.project has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 14, if/else 5, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol_fix/projection.rb"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3b0823bb57318ee225ac47a5d2307aeeaa5aac447dad317d5fc5a9a3b648d6"}},{"ruleId":"D2","level":"warning","message":{"text":"ReceiptStore.append! (cognitive 20): ReceiptStore.append! has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (12 pts), error handling 3 (6 pts), boolean chains 1, ternaries 1 (nesting depth added 4). 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":"lib/hive/patrol_fix/receipt_store.rb"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"52bc47c38991e990e8304e83b82c4e149bdae0faa3f05690c9bf93a404c921c6"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcessKill.terminate_process_group (cognitive 20): ProcessKill.terminate_process_group has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (14 pts), error handling 2 (3 pts), ternaries 2, boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/process_kill.rb"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3604f224bb017fef95893576dc69b1ea5e1bcb69459a8ffa7e0f7ee1cbba44"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.build_projections (cognitive 20): Store.build_projections has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 6, error handling 1, 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":"lib/hive/proposals/store.rb"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"af640c0009eb7547677206330646d0b412596a89b7a4cb02450eb4a2e2f384a7"}},{"ruleId":"D2","level":"warning","message":{"text":"Task.validate_workflow_stage! (cognitive 20): Task.validate_workflow_stage! has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task.rb"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1be666ba8703cf76f05f8ab00198e794b6220e4ebdf8f182449d39e580ace7"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectCaptureProvider.supervise_provider_in_custody (cognitive 20): ProjectCaptureProvider.supervise_provider_in_custody has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11, error handling 5 (6 pts), boolean chains 2, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/web/project_capture_provider.rb"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77399b6e911b10a059a0e1d19e4b3ac0c8c48479ffa18a8614b45c4f2fdfe19"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowAdmission.effect_for (cognitive 20): WorkflowAdmission.effect_for has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/workflow_admission.rb"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed67f7d2cc1e6856ae2c45472e8fefb0c0259a5b24ea1ab7e7569836a377e393"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskMigrator.build_plan (cognitive 20): TaskMigrator.build_plan has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9, boolean chains 8, error handling 2 (3 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/workflow_package/task_migrator.rb"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2fd42e3854ba95573a7c0c4fc8dba6ca32dcf2f09be816f347a2e1ecc6743ed"}},{"ruleId":"D2","level":"warning","message":{"text":"Worktree.read_owned_pointer (cognitive 20): Worktree.read_owned_pointer has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12, error handling 3 (6 pts), boolean chains 2 (nesting depth added 3). 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":"lib/hive/worktree.rb"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac545fb76369319f6b61e419e94952f02048ae29ccc39b1f318c0e9311ed956"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowCreatorInstallation.scan_root (cognitive 20): WorkflowCreatorInstallation.scan_root has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 1 (2 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":"packaging/live_agent_skills/workflow_creator_installation.rb"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"73986c464b6d14617bde60661ff237196c51c6cd0021fcaeecdfef1555aba5b9"}},{"ruleId":"D2","level":"warning","message":{"text":"ResultParser.parse_run (cognitive 19): ResultParser.parse_run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (15 pts), error handling 2 (3 pts), 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":"components/agent-cli-runtime/lib/agent_cli_runtime/opencode/result_parser.rb"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5687d14b7872d25ec38ba405632e2876e1338ed12a7e8e0e9118695ba3915d4"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentRuntime.prepare! (cognitive 19): AgentRuntime.prepare! has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), error handling 3 (6 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/agent_runtime.rb"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb161166e69974dca32cee88178c984ec97fef6f6daeafcf0f1892098e5c8d78"}},{"ruleId":"D2","level":"warning","message":{"text":"Proof.canonical_representation (cognitive 19): Proof.canonical_representation has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 6, ternaries 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":"lib/hive/artifacts/outcome_evidence/proof.rb"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb7f6456beca90c02bd2898a0c65ed87619dfaa60ddba5038b61a0d42d6fe6f"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcessIdentity.status (cognitive 19): ProcessIdentity.status has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 7, error handling 3 (6 pts), if/else 6 (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":"lib/hive/attempts/process_identity.rb"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a4cc079220ef1cddf5aa6172334e1cfd5ba03b9b4337f7dc7a36e2f32ee77a"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcessIdentity.terminate_orphan_group (cognitive 19): ProcessIdentity.terminate_orphan_group has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, error handling 3 (6 pts), boolean chains 1 (nesting depth added 3). 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":"lib/hive/attempts/process_identity.rb"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"954e4df703b068b3bf9a46815e16f08fd5bf6258fb2bda4e55e0e65785cacba2"}},{"ruleId":"D2","level":"warning","message":{"text":"Record.validate_subject! (cognitive 19): Record.validate_subject! has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 9, if/else 5 (9 pts), match/switch 1 (nesting depth added 4). 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":"lib/hive/attempts/record.rb"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"296a86daf19b39f123aa8b39b047d3342b612d87bd4ebc571cbcb4a0280b4f47"}},{"ruleId":"D2","level":"warning","message":{"text":"Logger.rotate_if_needed! (cognitive 19): Logger.rotate_if_needed! has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), error handling 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/babysitter/logger.rb"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"e974f3b589c6b161d65e1492bd7e5b321b5cb3d1cfe716cd1b3691f4efd94152"}},{"ruleId":"D2","level":"warning","message":{"text":"SlashHandlers.parse_closure_command (cognitive 19): SlashHandlers.parse_closure_command has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/bot/handlers/slash_handlers.rb"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a545af7ed7f6b8fc960c56afd491ca173c7365d09c4b2a25ccbbbccf09f3ec"}},{"ruleId":"D2","level":"warning","message":{"text":"Init.do_call (cognitive 19): Init.do_call has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (12 pts), error handling 3 (6 pts), boolean chains 1 (nesting depth added 4). 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":"lib/hive/commands/init.rb"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8ee1f6f7d570f83ada7186508e493c676e3e7ef5836fa9ec9d9d1dcdcfd457"}},{"ruleId":"D2","level":"warning","message":{"text":"RefactorPatrol.usage_jobs_argv (cognitive 19): RefactorPatrol.usage_jobs_argv has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, boolean chains 7. 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":"lib/hive/commands/refactor_patrol.rb"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"e997282a4fa163eac3119be3a85662b67d09925415f783fe08104a4fd5f7eb16"}},{"ruleId":"D2","level":"warning","message":{"text":"Status.validate_mode_combinations! (cognitive 19): Status.validate_mode_combinations! has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 14, if/else 3, ternaries 1 (2 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/status.rb"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa32d70c1b73173b2295e0c2feb2e4bcb79001658a8c78eb5e970e1daa9f08ca"}},{"ruleId":"D2","level":"warning","message":{"text":"Config.validate_web_config! (cognitive 19): Config.validate_web_config! has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, if/else 9. 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":"lib/hive/config.rb"},"region":{"startLine":4004}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a89b13f39471aa6af848fd1706848adb9c7a1bb39d231a0747329517aba8d9"}},{"ruleId":"D2","level":"warning","message":{"text":"Dispatcher.run_one_shot (cognitive 19): Dispatcher.run_one_shot has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10, boolean chains 6, ternaries 2, error handling 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef45b1128684dd75b2be5b0aa98d5f145cb97b4fdc2d57eae966b765cc96652"}},{"ruleId":"D2","level":"warning","message":{"text":"FinalizationProof.validate! (cognitive 19): FinalizationProof.validate! has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10, boolean chains 9. 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":"lib/hive/daemon/finalization_proof.rb"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8953b4cc1683a6996c6195f01efe4b43af78c3e7e8c421f0fa85e68b2cee1d6"}},{"ruleId":"D2","level":"warning","message":{"text":"RecoveryCoordinator.source_receipt_for (cognitive 19): RecoveryCoordinator.source_receipt_for has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, boolean chains 5, error handling 1, ternaries 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/recovery_coordinator.rb"},"region":{"startLine":1743}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7850b2a315b495f4957f3d71dfc251f8e929d7584f4ce8d09af179e0aadd3ef"}},{"ruleId":"D2","level":"warning","message":{"text":"DeliveryLedger.prepare (cognitive 19): DeliveryLedger.prepare has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 1, ternaries 1 (nesting depth added 10). 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":"lib/hive/daily_digest/delivery_ledger.rb"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f607acbdded2824edc46b08070751569ba46cc9fd26eaf42b1bdd364c14c8aad"}},{"ruleId":"D2","level":"warning","message":{"text":"ManagedDirectory.with_lock (cognitive 19): ManagedDirectory.with_lock has cognitive complexity 19 (threshold 15). Drivers by points: error handling 6 (9 pts), if/else 7 (8 pts), boolean chains 1, ternaries 1 (nesting depth added 4). 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":"lib/hive/managed_directory.rb"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"00649110cdbd2fa5f8d78fffd240409a02339970892d398b2feea33d3a86de44"}},{"ruleId":"D2","level":"warning","message":{"text":"ManagedDirectory.unlink (cognitive 19): ManagedDirectory.unlink has cognitive complexity 19 (threshold 15). Drivers by points: error handling 4 (10 pts), if/else 6 (7 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/managed_directory.rb"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0c16af79cce7a9a64097e523f9e52cbf9e346653a33116e6906eaa08361eb3"}},{"ruleId":"D2","level":"warning","message":{"text":"Decision.validate! (cognitive 19): Decision.validate! has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10, boolean chains 8, error handling 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/plan_review/decision.rb"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"10241b12f9b2e7f5985f6675c4d753e1fee39b808e36d9004156159af7125d7a"}},{"ruleId":"D2","level":"warning","message":{"text":"MergeClassifier.parse_record (cognitive 19): MergeClassifier.parse_record has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 13, if/else 5, error handling 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/merge_classifier.rb"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a8c9ec741e1f95b577e3bbb66d5a797bf220c6f8f630fd0c65a46fa718b75d"}},{"ruleId":"D2","level":"warning","message":{"text":"PublicationAttempt.ensure_for_patch (cognitive 19): PublicationAttempt.ensure_for_patch has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 9, if/else 7 (8 pts), ternaries 1 (2 pts) (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":"lib/hive/refactor_patrol/publication_attempt.rb"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b056645006e7bc921f7a321c4d2bec3c9a5dc09ce7c61df3ad116e37ebf35c"}},{"ruleId":"D2","level":"warning","message":{"text":"ReviewBudget.validate_resume! (cognitive 19): ReviewBudget.validate_resume! has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, if/else 7 (9 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/review_budget.rb"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ab872b46cd23cf2df628f9e9c7ae46c127ea19526b32c4cd78ddfe9fdd63c9"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.append_audit! (cognitive 19): Store.append_audit! has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 9 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/review_budget/store.rb"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab31ed18d643f1ee48a1d7d2b53b1a45cd52f09b2c6c12ce53f2d4011854201"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.validate! (cognitive 19): Store.validate! has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 12, if/else 3, ternaries 3, error handling 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/review_budget/store.rb"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"408be652868b6451b80907ce2138a9689c0cd00ff3184c6055f35e60a8635d97"}},{"ruleId":"D2","level":"warning","message":{"text":"Artifacts.role_security_kwargs (cognitive 19): Artifacts.role_security_kwargs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 6 (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":"lib/hive/stages/artifacts.rb"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5497a976c3f65afdf1e9d9274cf22efbfc3cb01cbd9e7ec4409af4c6da489ad"}},{"ruleId":"D2","level":"warning","message":{"text":"Review.ci_terminal_result (cognitive 19): Review.ci_terminal_result has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 3 (7 pts), boolean chains 4, match/switch 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":"lib/hive/stages/review.rb"},"region":{"startLine":2761}}}],"partialFingerprints":{"codehealthFindingId/v1":"9783bad61c15da33e908cd8733e462306b6fc55617a781160a6963c66bc63f51"}},{"ruleId":"D2","level":"warning","message":{"text":"Task.resolve_workflow (cognitive 19): Task.resolve_workflow has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 6, error handling 3 (6 pts), if/else 5 (6 pts), ternaries 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":"lib/hive/task.rb"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"9470a3edb0bbd66fb8281ff18f1bec3168d7549aa72e134c681801893d96a659"}},{"ruleId":"D2","level":"warning","message":{"text":"Diagnostic.marker_detail (cognitive 19): Diagnostic.marker_detail has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (17 pts), ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"lib/hive/task_action/diagnostic.rb"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"470bb9202b20c0736c3e9af98e6e5e435e424bbf125c021e83c6791f74c9150b"}},{"ruleId":"D2","level":"warning","message":{"text":"Validator.validate! (cognitive 19): Validator.validate! has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9, boolean chains 8, error handling 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_journal.rb"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"806b537474df147ea7f58bdc1ddaf62276a5de144b233d5996d8d4d923b1f5a9"}},{"ruleId":"D2","level":"warning","message":{"text":"Validator.validate_attempt! (cognitive 19): Validator.validate_attempt! has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 4, error handling 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, 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":"lib/hive/task_journal.rb"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df2aff214a6479a1e40ec13cda9f34fd3b0b0147e46b4cdad4ca840a0835665"}},{"ruleId":"D2","level":"warning","message":{"text":"Publication.read_pointer (cognitive 19): Publication.read_pointer has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 9, if/else 6, error handling 2 (3 pts), ternaries 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_workspace/publication.rb"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2866e7d92a4ee4ae9f7f599a72b7ce3fb4de3c675292844dc66ee4d88655ee9"}},{"ruleId":"D2","level":"warning","message":{"text":"UserService.lifecycle (cognitive 19): UserService.lifecycle has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 7, error handling 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/user_service.rb"},"region":{"startLine":1425}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8f099335ba0e13a928cbe1280d488825b7200355339b957a1cd49b073b32ec"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskDiff.call (cognitive 19): TaskDiff.call has cognitive complexity 19 (threshold 15). Drivers by points: error handling 4 (10 pts), if/else 5, boolean chains 2, ternaries 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/web/task_diff.rb"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"868e9652e7fb02ac6d3ac77b9f06865ec6db60914b054d05e955e0b2c0bf7c84"}},{"ruleId":"D2","level":"warning","message":{"text":"AuthoringLint.walk_yaml (cognitive 19): AuthoringLint.walk_yaml has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 2, ternaries 1 (2 pts), match/switch 1 (nesting depth added 9). 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":"lib/hive/workflow_package/authoring_lint.rb"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb36a1926fd1725755486b6ff3ba20ec9d1e1e775522225839967631ef29d92"}},{"ruleId":"D2","level":"warning","message":{"text":"AuthoringLint.scan_permissions (cognitive 19): AuthoringLint.scan_permissions has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 12, if/else 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":"lib/hive/workflow_package/authoring_lint.rb"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"a533d5f66d9734e56c283cc32b21c7618fc97058ccf8805ecf3274c4c453098f"}},{"ruleId":"D2","level":"warning","message":{"text":"AuthoringLint.security_extension (cognitive 19): AuthoringLint.security_extension has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 14, if/else 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":"lib/hive/workflow_package/authoring_lint.rb"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"4534b2e5778923b29cd086e1dd4fec5a1317062eba9f96ac6477b0936d8b2d3c"}},{"ruleId":"D2","level":"warning","message":{"text":"LintPolicy.validate! (cognitive 19): LintPolicy.validate! has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 15, if/else 4. 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":"lib/hive/workflow_package/lint_policy.rb"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ce0dbc62fbd05c37f8323bb5076f75fcd074d806d3f8feddc9268e6cc3f72c"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcessSupervisor.validate_launch! (cognitive 19): ProcessSupervisor.validate_launch! has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 16, if/else 2, error handling 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/live_agent_skills/workflow_creator_process_supervisor.rb"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f633dd03a026fabf0d92edde094666366644bb9dcc85bfe0a0352a52c739e0"}},{"ruleId":"D2","level":"warning","message":{"text":"ReleasePublicationVerifier.call (cognitive 19): ReleasePublicationVerifier.call has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, if/else 7, error handling 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":"packaging/release_candidate/release_selector.rb"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca83f4d988998098cd488433b75903e018600b04e43810cd96753416a985b1de"}},{"ruleId":"D2","level":"warning","message":{"text":"MessageExtractor.extract (cognitive 18): MessageExtractor.extract has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5, 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":"lib/hive/agent/message_extractor.rb"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"d08281ff75418a8ead424dd2fe8195c2a55772b7ab29e8f54405f3076b46f39d"}},{"ruleId":"D2","level":"warning","message":{"text":"Recovery.read (cognitive 18): Recovery.read has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, error handling 3 (6 pts), if/else 3 (nesting depth added 3). 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":"lib/hive/artifacts/outcome_evidence/recovery.rb"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"369a92c4d0c033de35595de0a4d183502558f80d5429d29728112cf352d561db"}},{"ruleId":"D2","level":"warning","message":{"text":"Dispatcher.dispatch_request (cognitive 18): Dispatcher.dispatch_request has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 6, ternaries 2, error handling 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":"lib/hive/attempts/dispatcher.rb"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca399dda3ed06c16a232dc0561a39e958772642a3c0035261c51ef052716ba35"}},{"ruleId":"D2","level":"warning","message":{"text":"CliArgvPolicy.extract_context (cognitive 18): CliArgvPolicy.extract_context has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/cli_argv_policy.rb"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3a437d08f6f2f046a09538a453b517364586109fe2d67daa53fd6e905e80a7"}},{"ruleId":"D2","level":"warning","message":{"text":"CommandReceiptStore.abort_pre_submission (cognitive 18): CommandReceiptStore.abort_pre_submission has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 6, error handling 1, ternaries 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":"lib/hive/command_receipt_store.rb"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"79687b6033e8b46518390adb1193704b6ee5bd15342587a1ec42196590734e64"}},{"ruleId":"D2","level":"warning","message":{"text":"CommandReceiptStore.allocate_successor (cognitive 18): CommandReceiptStore.allocate_successor has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 6, ternaries 3, error handling 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/command_receipt_store.rb"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e3a52f2a37d2d21dfaf5b99ea973a0acd736c8df9614f1004564660a8af07e"}},{"ruleId":"D2","level":"warning","message":{"text":"Pins.acquire_pin (cognitive 18): Pins.acquire_pin has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 2, error handling 1, ternaries 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":"lib/hive/command_receipt_store/pins.rb"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f5fa2f1785fd53bf4e5193a650d9496c3a75de19f48e6cd40258e2e3dd5806"}},{"ruleId":"D2","level":"warning","message":{"text":"Workflow.call! (cognitive 18): Workflow.call! has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 6, error handling 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/workflow.rb"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade7683469f293f5aa4ac03339291bab7a786e9ad349023a082f1b65b9d3ff88"}},{"ruleId":"D2","level":"warning","message":{"text":"Config.validate_artifact_evidence! (cognitive 18): Config.validate_artifact_evidence! has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, boolean chains 7. 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":"lib/hive/config.rb"},"region":{"startLine":2974}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0dbaf6f841c16c9c197db5a37a0d6d00ae0da8389180ba78afd64256e512a97"}},{"ruleId":"D2","level":"warning","message":{"text":"Dispatcher.process_dispatch_requests (cognitive 18): Dispatcher.process_dispatch_requests has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, error handling 3 (4 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":3679}}}],"partialFingerprints":{"codehealthFindingId/v1":"887db362763f6bf360e6b4b3c2efdf6a084535077c228328c7f27aab33437d5e"}},{"ruleId":"D2","level":"warning","message":{"text":"Dispatcher.reconcile_attempt_deliveries (cognitive 18): Dispatcher.reconcile_attempt_deliveries has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (15 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, 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":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":4757}}}],"partialFingerprints":{"codehealthFindingId/v1":"9211f657364c967cb11d6305fcbf30dd1d2960bd44ea3282d586a6b87f468b84"}},{"ruleId":"D2","level":"warning","message":{"text":"RecoveryCoordinator.receipt_for_request (cognitive 18): RecoveryCoordinator.receipt_for_request has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 4 (7 pts), boolean chains 4, if/else 4, 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":"lib/hive/daemon/recovery_coordinator.rb"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07408b2db59635b582f02cd2b55d4a559c763676383d46404b0221ef0e1fcfe"}},{"ruleId":"D2","level":"warning","message":{"text":"RefactorPatrolMergeReconciler.validate_page! (cognitive 18): RefactorPatrolMergeReconciler.validate_page! has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 8, error handling 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/refactor_patrol_merge_reconciler.rb"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bcbe600fc5d5056824ce0dc9180cf8e06d177e1fa5014fd7db0f1a8d652efdd"}},{"ruleId":"D2","level":"warning","message":{"text":"RefactorPatrolMergeReconciler.validate_progress_against_checkpoint! (cognitive 18): RefactorPatrolMergeReconciler.validate_progress_against_checkpoint! has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5, error handling 1, ternaries 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":"lib/hive/daemon/refactor_patrol_merge_reconciler.rb"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7aebc168c21aa628c6a95c3ca9819f722e6896eeab499155aeef885e245e44a"}},{"ruleId":"D2","level":"warning","message":{"text":"StaleAgentHealer.heal_attempt_losses (cognitive 18): StaleAgentHealer.heal_attempt_losses has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, boolean chains 5, error handling 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/stale_agent_healer.rb"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51720a4209980b5330c823514cc0e437adc32be45e0718ceb5a0e3d89b539f8"}},{"ruleId":"D2","level":"warning","message":{"text":"DraftPrReceipt.read (cognitive 18): DraftPrReceipt.read has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (7 pts), error handling 3 (6 pts), ternaries 2 (3 pts), boolean chains 2 (nesting depth added 5). 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":"lib/hive/draft_pr_receipt.rb"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"b229100c8f9f77f019d20ff20c305fa57af4f8a0ca8e33fa76f21056efbe8962"}},{"ruleId":"D2","level":"warning","message":{"text":"GitOps.run_git_with_timeout (cognitive 18): GitOps.run_git_with_timeout has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8, boolean chains 5, error handling 4 (5 pts) (nesting depth added 1). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/git_ops.rb"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe0d94faa956864fa0044dd5c7d99e52164c60c1c479b0bc55fe8346463b691"}},{"ruleId":"D2","level":"warning","message":{"text":"Configuration.validate! (cognitive 18): Configuration.validate! has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 14, if/else 4. 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":"lib/hive/module_package/configuration.rb"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e4652ef9b25ec7a8f8a920c56153d7a0e3adebb6c37c380d294705cc0991c0c"}},{"ruleId":"D2","level":"warning","message":{"text":"AdapterHarness.call (cognitive 18): AdapterHarness.call has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 3 (12 pts), error handling 3 (6 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":"lib/hive/one_shot/adapter_harness.rb"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"f262daab029a0747cfc70a69df76ea663ccc5962cc25cde4f0e471672207dd66"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcessExecutor.call (cognitive 18): ProcessExecutor.call has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 6, error handling 2 (3 pts) (nesting depth added 3). 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":"lib/hive/one_shot/process_executor.rb"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"038d8105756a2e7a3b5b1c8f31c9149a176733eec77402ca4f7ceee0dc395db7"}},{"ruleId":"D2","level":"warning","message":{"text":"SecretRework.validate_payload! (cognitive 18): SecretRework.validate_payload! has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 15, ternaries 2, if/else 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol_fix/secret_rework.rb"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"0827031847e6eb33f5bc15415cbde1cd0dacec1702e062bc8c710ef0101d8d4c"}},{"ruleId":"D2","level":"warning","message":{"text":"SuccessorMaterializer.validate_relation_document! (cognitive 18): SuccessorMaterializer.validate_relation_document! has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 15, if/else 3. 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":"lib/hive/patrol_fix/successor_materializer.rb"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"c993093d451a841326c74e810fe3f29287649439d3dcba9842eba684b538f20d"}},{"ruleId":"D2","level":"warning","message":{"text":"Orchestrator.advance_unlocked! (cognitive 18): Orchestrator.advance_unlocked! has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 7, error handling 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":"lib/hive/plan_review/orchestrator.rb"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a06b6a2446f0f2010ac79860f6ff53cecc1759a590f21bd6d17bc71c86473eb"}},{"ruleId":"D2","level":"warning","message":{"text":"Orchestrator.ensure_planner_revision (cognitive 18): Orchestrator.ensure_planner_revision has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, 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":"lib/hive/plan_review/orchestrator.rb"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cccd019ab10087e22c0e9e5b60cc6664a6ef1eb4728db9b26bfa93356fbb961"}},{"ruleId":"D2","level":"warning","message":{"text":"DecisionService.with_lifecycle_commit (cognitive 18): DecisionService.with_lifecycle_commit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), error handling 2 (4 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/proposals/decision_service.rb"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"090dac14e7007f9b734fdc99f82675b99ebe6f9bb591977e9abfd5010338ad15"}},{"ruleId":"D2","level":"warning","message":{"text":"JobStore.claim_discovery! (cognitive 18): JobStore.claim_discovery! has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 3, error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/job_store.rb"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c049aeac0bd1daacf0f92af411e60f993d7dfabf412203f245aa9c7f9a561f"}},{"ruleId":"D2","level":"warning","message":{"text":"TokenStore.valid_registry? (cognitive 18): TokenStore.valid_registry? has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 13, if/else 4, error handling 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/remote/token_store.rb"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d599809a9fd93ce4d061c7442a064147a768d17dc10be6880295b40784bae3"}},{"ruleId":"D2","level":"warning","message":{"text":"AdmissionTransition.claim_request! (cognitive 18): AdmissionTransition.claim_request! has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 8 (9 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/runtime_control_plane/admission_transition.rb"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7481505569351a3e422e0c63e43c87ac5d1f8add3dded9f84b9840095b0421"}},{"ruleId":"D2","level":"warning","message":{"text":"Fix.fix_authorization (cognitive 18): Fix.fix_authorization has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 12, if/else 4 (6 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/patrol_fix/fix.rb"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be19d84a0dd89ed271ca29f7f3c7462e876e55fee8a1b5e9d10e8a910a76bb6"}},{"ruleId":"D2","level":"warning","message":{"text":"Review.run_reviewer_spec (cognitive 18): Review.run_reviewer_spec has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, error handling 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":"lib/hive/stages/review.rb"},"region":{"startLine":2224}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3aa9fed775a06c7f535b400d9965ec1d3c290eb6579da55d54d59dc3553cdb"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyComponent.build_edges (cognitive 18): DependencyComponent.build_edges has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 1, error handling 1, ternaries 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":"lib/hive/task_workspace/dependency_component.rb"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"016dfddceac13fdbf2b13d7b1e10512eb462ee5d9e2a75c5050ca43e60cd1be0"}},{"ruleId":"D2","level":"warning","message":{"text":"NewIdeaProjectPicker.render (cognitive 18): NewIdeaProjectPicker.render has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 3 (8 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/tui/views/new_idea_project_picker.rb"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18d95feae468e0b416eef9beb73d6460490a0ff4d1fdcea36a82168815db628"}},{"ruleId":"D2","level":"warning","message":{"text":"UserService.apply (cognitive 18): UserService.apply has cognitive complexity 18 (threshold 15). Drivers by points: error handling 4 (10 pts), if/else 5 (7 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/user_service.rb"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"55db016f8bee5e2af9495a80830fd41bdad7e93a8556db0d2f46ab5149a88e8d"}},{"ruleId":"D2","level":"warning","message":{"text":"UserService.reconcile_pending (cognitive 18): UserService.reconcile_pending has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/user_service.rb"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"8490bc37aa43e35f1857bf3bfecc0edd4d6bf3330104d58f1304fcefa43ce769"}},{"ruleId":"D2","level":"warning","message":{"text":"TransactionJournal.validate_activation_process_identity! (cognitive 18): TransactionJournal.validate_activation_process_identity! has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 11, if/else 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":"lib/hive/user_service/transaction_journal.rb"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7632f2a4a51dc35e9c76d058e71ba484bc7317ec66e41eb2d73a49e889d894"}},{"ruleId":"D2","level":"warning","message":{"text":"Configuration.validate! (cognitive 18): Configuration.validate! has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 14, if/else 4. 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":"lib/hive/workflow_package/configuration.rb"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89419dab03d912d5f17494d40cf794ccb96f2a4000c6a5b0a2ec59c9613444b"}},{"ruleId":"D2","level":"warning","message":{"text":"PermissionProjection.normalize_scoped! (cognitive 18): PermissionProjection.normalize_scoped! has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 5, ternaries 1 (2 pts) (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":"lib/hive/workflow_package/permission_projection.rb"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"da77e54c756379cf3eef09ef559b33e8dbfffe7094d567db357d59e292773cc6"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowCreatorBundle.validate (cognitive 18): WorkflowCreatorBundle.validate has cognitive complexity 18 (threshold 15). Drivers by points: error handling 5 (15 pts), if/else 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":"packaging/live_agent_skills/workflow_creator_bundle.rb"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6bd243aa85ccbd10952c195a4ff00594eae18a0f4807f2d4b5f2d99718a39b"}},{"ruleId":"D2","level":"warning","message":{"text":"GateExecution.call (cognitive 18): GateExecution.call has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, error handling 1 (2 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/release_candidate/gate_execution.rb"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"d831b7ca39a6fcebc38077a86543820718e85bad225fe11a576c38da657a9757"}},{"ruleId":"D2","level":"warning","message":{"text":"HostedAggregate.valid_receipt? (cognitive 18): HostedAggregate.valid_receipt? has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 18. 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":"packaging/release_candidate/hosted_aggregate.rb"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3cbb55572402361409bddc9dc1afbcd22171053eba87dd3efe3c2f256f73f0f"}},{"ruleId":"D2","level":"warning","message":{"text":"HostedGate.verify_manifest (cognitive 18): HostedGate.verify_manifest has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 14, if/else 3, error handling 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/release_candidate/hosted_gate.rb"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17a4bfce7618f25c9e02da054a7c3ececdf7846d8706642ce6f97765a44485f"}},{"ruleId":"D2","level":"warning","message":{"text":"DirectoryPublisher.report (cognitive 17): DirectoryPublisher.report has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), error handling 3 (6 pts), boolean chains 2, ternaries 1 (nesting depth added 4). 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":"lib/hive/agent_skills/directory_publisher.rb"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc7c12a404ca98f8a2fea7c39dc84b1c474c791609012ab95d0aa38cbd79976"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime.executable (cognitive 17): Runtime.executable has cognitive complexity 17 (threshold 15). Drivers by points: error handling 3 (6 pts), boolean chains 5, if/else 4, ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/agent_support/codex/runtime.rb"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5eddd444d653268896eec3c01f6e6d72ef22764efc76bb8ab73809233e38d0"}},{"ruleId":"D2","level":"warning","message":{"text":"Skills.resolve (cognitive 17): Skills.resolve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, error handling 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":"lib/hive/agent_support/opencode/skills.rb"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ae1ae40541c689d7addc05cc8100d238ce5105b4faf2447303e1e9c25ab158"}},{"ruleId":"D2","level":"warning","message":{"text":"Record.validate_provider_evidence! (cognitive 17): Record.validate_provider_evidence! has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, boolean chains 5, error handling 1, ternaries 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/attempts/record.rb"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a2fc64dbc79d656736ab24273fd06b2ce630b8fa345504c903b19a5dd2a516"}},{"ruleId":"D2","level":"warning","message":{"text":"NotificationDispatcher.process_current (cognitive 17): NotificationDispatcher.process_current has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"lib/hive/bot/notification_dispatcher.rb"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e46010ecfdc371ce8302209468178374c63449757ac5127c51ed3d0a254947"}},{"ruleId":"D2","level":"warning","message":{"text":"BrainstormParser.parse_text (cognitive 17): BrainstormParser.parse_text has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 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":"lib/hive/brainstorm_parser.rb"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"0594b9bf5649a055de77e91ae300164658b191b1a17592cf321ae87825353a43"}},{"ruleId":"D2","level":"warning","message":{"text":"CliArgvPolicy.lift_new_options (cognitive 17): CliArgvPolicy.lift_new_options has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, loops 1, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"lib/hive/cli_argv_policy.rb"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c62860f00eb0eb7f55b92b314cbddef73929ab9968e5f9c7906d5c3505585db"}},{"ruleId":"D2","level":"warning","message":{"text":"DigestPrune.call! (cognitive 17): DigestPrune.call! has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 2 (4 pts), error handling 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/digest_prune.rb"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"883ab83093474b155f4937db387dcdab7e3c9b50c56dbcdce15d402919bca32f"}},{"ruleId":"D2","level":"warning","message":{"text":"New.perform_call! (cognitive 17): New.perform_call! has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, ternaries 1 (2 pts), error handling 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":"lib/hive/commands/new.rb"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"988789cbdb05ea96f0578e36c8a691cd431bd7b924544d5ac2b0a0643f6af28d"}},{"ruleId":"D2","level":"warning","message":{"text":"Token.call (cognitive 17): Token.call has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/token.rb"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e53b2b0b2834d190fc42b20a6021430d250c73691b95184fa68c0f3a222a09"}},{"ruleId":"D2","level":"warning","message":{"text":"Evidence.validate_types! (cognitive 17): Evidence.validate_types! has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 6, ternaries 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":"lib/hive/conditions/evidence.rb"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e758a8c257227fb7ff523c7f7c279aeac3f1d058dbc399eb41c7a92b4a232d6"}},{"ruleId":"D2","level":"warning","message":{"text":"Config.reachable_model_routing_calls (cognitive 17): Config.reachable_model_routing_calls has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 15, if/else 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":"lib/hive/config.rb"},"region":{"startLine":2708}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d03091d5b944890a433e3a513e34aeb0788c9a9ddea41720c3daf4ab86bc2ff"}},{"ruleId":"D2","level":"warning","message":{"text":"Config.validate_patrol! (cognitive 17): Config.validate_patrol! has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, boolean chains 7. 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":"lib/hive/config.rb"},"region":{"startLine":4236}}}],"partialFingerprints":{"codehealthFindingId/v1":"d138aef22975807967c4027397793aaa8e32e27401365d56b4ab07e0356289d9"}},{"ruleId":"D2","level":"warning","message":{"text":"RefactorPatrolMergeProgressStore.validate_item! (cognitive 17): RefactorPatrolMergeProgressStore.validate_item! has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 14, if/else 2, error handling 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/refactor_patrol_merge_progress_store.rb"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30b2d20ae56fa4324102d33b844e5fea892f583f001e3c157615f858abd85e9"}},{"ruleId":"D2","level":"warning","message":{"text":"Coverage.normalize_event (cognitive 17): Coverage.normalize_event has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5, match/switch 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":"lib/hive/daily_digest/coverage.rb"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb14d0135a874b190d70ad21e923fde9188fb64104ea553779a39ded87e79f5"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentWriter.write_day (cognitive 17): DocumentWriter.write_day has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (6 pts), boolean chains 4, if/else 4, error handling 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daily_digest/document_writer.rb"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eeb5d3f6706634fc267098b466c0fcc77b0d7954197f7330669742502d1fcb7"}},{"ruleId":"D2","level":"warning","message":{"text":"Controller.reconcile_push (cognitive 17): Controller.reconcile_push has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), error handling 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/github_publication.rb"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb85a065aa5c45ecdd8458a1182769c7bcf2472795f0d487de3b3b4aca615b35"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelPricing.validate_card! (cognitive 17): ModelPricing.validate_card! has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/model_pricing.rb"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"291476aa52d4c255ba5b2753ebea894e0ea2512c06f7db9cf0df9c4f812bc03b"}},{"ruleId":"D2","level":"warning","message":{"text":"TriggerEvaluator.evaluate (cognitive 17): TriggerEvaluator.evaluate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, boolean chains 4, error handling 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/modules/trigger_evaluator.rb"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f341b3f9eadaf58ba5edc33ef29c97d60747a8823b78699dc63ad5ed4b854e"}},{"ruleId":"D2","level":"warning","message":{"text":"Projection.validate_history! (cognitive 17): Projection.validate_history! has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 6 (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":"lib/hive/proposals/projection.rb"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2083d2b4a2c23e5ae493a26c1e0a9e468184a809b2b1e289252330fba418b59"}},{"ruleId":"D2","level":"warning","message":{"text":"JobRecordValidator.validate_actions! (cognitive 17): JobRecordValidator.validate_actions! has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/job_record_validator.rb"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"a88c7c4131a58b130248aff9cc0153341e736d0596cb11ca785af5cf0ba917b8"}},{"ruleId":"D2","level":"warning","message":{"text":"MergeClassifierRunner.call (cognitive 17): MergeClassifierRunner.call has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 7, if/else 4 (5 pts), ternaries 2 (4 pts), error handling 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":"lib/hive/refactor_patrol/merge_classifier_runner.rb"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa279c3151afba8ee6a375bc0c4bb713c2f70b572cca7732eebc3750c81075db"}},{"ruleId":"D2","level":"warning","message":{"text":"Client.parse (cognitive 17): Client.parse has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 7, if/else 5 (7 pts), ternaries 1 (2 pts), error handling 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":"lib/hive/remote/client.rb"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f41d24246b40683e888b74039e0043911de0cf005a067da31876e2e76bcdab0"}},{"ruleId":"D2","level":"warning","message":{"text":"QuestionHandles.read (cognitive 17): QuestionHandles.read has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 11, if/else 5, error handling 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/remote/question_handles.rb"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae695e033fa98cb604b7c9a9b1a488915d5b65f858a2eb9d1493330777ab3f66"}},{"ruleId":"D2","level":"warning","message":{"text":"AdmissionTransition.bind_command_context! (cognitive 17): AdmissionTransition.bind_command_context! has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 6 (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":"lib/hive/runtime_control_plane/admission_transition.rb"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"0204785683a2ef2d60d9b91f01fcd0597fda3c071b90005f09bbfbf641716b8d"}},{"ruleId":"D2","level":"warning","message":{"text":"Database.diagnostics_uncoordinated (cognitive 17): Database.diagnostics_uncoordinated has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), error handling 3 (4 pts), boolean chains 1, ternaries 1 (nesting depth added 3). 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":"lib/hive/runtime_control_plane/database.rb"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"4896a77f2b47156a51c65028d3229887197a73f0ae9b22c670c620df83e15bcc"}},{"ruleId":"D2","level":"warning","message":{"text":"Database.inspect_database (cognitive 17): Database.inspect_database has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), error handling 3 (4 pts), boolean chains 1, ternaries 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":"lib/hive/runtime_control_plane/database.rb"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed87b34cc11a030790859c4de6f06348d89d04bb7e86e98021432c486bf8d812"}},{"ruleId":"D2","level":"warning","message":{"text":"DispatchRepository.bind_command_context! (cognitive 17): DispatchRepository.bind_command_context! has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 5 (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":"lib/hive/runtime_control_plane/dispatch_repository.rb"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9e0cb2529ab110e02f4b9ffa874dd8cdc8834c2491d7b86431dbd4e6d267d5"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskAction.generic_action (cognitive 17): TaskAction.generic_action has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 3 (8 pts), if/else 5 (7 pts), boolean chains 1, match/switch 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":"lib/hive/task_action.rb"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d3e826f11416c57232df8edc3966e597f2770f41638c798c7042c5f76e0a68"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskAction.plan_review_action (cognitive 17): TaskAction.plan_review_action has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), ternaries 2 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"lib/hive/task_action.rb"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec20d572de96edc20a7e78b15813229c8b4c76f2f8b20e767b38b673ec5dfedf"}},{"ruleId":"D2","level":"warning","message":{"text":"TerminalOutcome.read_first_line (cognitive 17): TerminalOutcome.read_first_line has cognitive complexity 17 (threshold 15). Drivers by points: error handling 3 (6 pts), boolean chains 5, if/else 5, ternaries 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":"lib/hive/terminal_outcome.rb"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d76731eaeea59c01f8a46a70297463bfdd354fe719786dde6f3deb231e37f3"}},{"ruleId":"D2","level":"warning","message":{"text":"BubbleModel.handle_new_idea_paste (cognitive 17): BubbleModel.handle_new_idea_paste has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 3, ternaries 1 (2 pts), error handling 1, match/switch 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":"lib/hive/tui/bubble_model.rb"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"10edd417bd86808008fd07d64c898f9be74297d35fd245cac989e689f7319b14"}},{"ruleId":"D2","level":"warning","message":{"text":"UserService.prior_manager_endpoint? (cognitive 17): UserService.prior_manager_endpoint? has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, ternaries 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":"lib/hive/user_service.rb"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef7d3b22bd8029fab48d1caa29b94ba7a7218fa487ef01fc2480f4f1fbc8932"}},{"ruleId":"D2","level":"warning","message":{"text":"Manager.restore (cognitive 17): Manager.restore has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 2 (5 pts), boolean chains 1, match/switch 1 (nesting depth added 6). 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":"lib/hive/user_service/manager.rb"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"108a9d6fa1034dd141fec939704a5ebd38fbc6d5df8183b8c815a1efd5934e6f"}},{"ruleId":"D2","level":"warning","message":{"text":"TransactionJournal.validate_document! (cognitive 17): TransactionJournal.validate_document! has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, boolean chains 7. 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":"lib/hive/user_service/transaction_journal.rb"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff2d00c9e97a4cfba9b40fff06b57001c35f3a2589cd3d55fa6f40704ba3096"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectCaptureProvider.validate_artifacts! (cognitive 17): ProjectCaptureProvider.validate_artifacts! has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, boolean chains 6, error handling 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/web/project_capture_provider.rb"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b193f10e4812165fe34d5ea33cd3c85576c3dec59063eb0c04da7eb7ee214d1"}},{"ruleId":"D2","level":"warning","message":{"text":"AuthoringLint.extract_markdown (cognitive 17): AuthoringLint.extract_markdown has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, ternaries 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":"lib/hive/workflow_package/authoring_lint.rb"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"701b17b56d5f130e4f4dd9718f9f8ac4f3bcdf126fe8e9b054bef9d61fa50d87"}},{"ruleId":"D2","level":"warning","message":{"text":"Worktree.read_strict_pointer (cognitive 17): Worktree.read_strict_pointer has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), error handling 3 (6 pts), boolean chains 1 (nesting depth added 4). 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":"lib/hive/worktree.rb"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e362507c95b66a26470ba39aec24a7e4430ba4bdf9ecdbcf9be9194a19170c"}},{"ruleId":"D2","level":"warning","message":{"text":"BaselineCache.baseline_cache_attestation (cognitive 17): BaselineCache.baseline_cache_attestation has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 11, if/else 5, error handling 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/release_candidate/baseline_cache.rb"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eba7d00f7283e239ba29cc527c4a967074c6f395fe8c761fc5a3e87201c1108"}},{"ruleId":"D2","level":"warning","message":{"text":"restore (cognitive 17): restore has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). Of this number, 13 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/javascript/controllers/task_workspace_controller.js"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"5509bcff2347dbb0085d3143f96958ed2e0e4617721a240d35a1d6199a7c4330"}},{"ruleId":"D2","level":"warning","message":{"text":"PendingBookkeeping.verify_reference! (cognitive 16): PendingBookkeeping.verify_reference! has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 7, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/attempts/pending_bookkeeping.rb"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"786bab4c41724717694f71cfec89ba344c6ea6854ba926038d407eb61f42727b"}},{"ruleId":"D2","level":"warning","message":{"text":"Reconciler.reconcile_records (cognitive 16): Reconciler.reconcile_records has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, error handling 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":"lib/hive/attempts/reconciler.rb"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"f973e48d24bd88ec4cbde32c6df5ec005142df6e69d0f681b206875de1ce11a2"}},{"ruleId":"D2","level":"warning","message":{"text":"NotificationDispatcher.process_recoveries (cognitive 16): NotificationDispatcher.process_recoveries has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (16 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/bot/notification_dispatcher.rb"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3758c17c7f2a2822c458caf74bf60c9258e3af7a0b53170a754f401d2d9377"}},{"ruleId":"D2","level":"warning","message":{"text":"CommandReceiptMaintenance.validate_successful_reconciliation! (cognitive 16): CommandReceiptMaintenance.validate_successful_reconciliation! has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, if/else 5, error handling 1, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/command_receipt_maintenance.rb"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ed6f83cffbfe93f8bc547f78349f5268dd32684e3c3193983284eb6d435e30"}},{"ruleId":"D2","level":"warning","message":{"text":"Bot.stop_bot (cognitive 16): Bot.stop_bot has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 2 (3 pts), boolean chains 2, error handling 1, ternaries 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":"lib/hive/commands/bot.rb"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"cebac0ceed515853bf2c3fb0d0d31f389d4bcbaaa05f3f49b2b0f146c955dff1"}},{"ruleId":"D2","level":"warning","message":{"text":"Evidence.validate_arguments! (cognitive 16): Evidence.validate_arguments! has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (15 pts), ternaries 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":"lib/hive/commands/evidence.rb"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"66eaf529846b011788d838cff2c1c1aa08acb2e3b97da38ea8134a6e236e7958"}},{"ruleId":"D2","level":"warning","message":{"text":"RefactorPatrolScheduled.call (cognitive 16): RefactorPatrolScheduled.call has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 7, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/refactor_patrol_scheduled.rb"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc948f073786d472e50f79d553d48f04f937cc5fb0da714967d8167ffd640ac2"}},{"ruleId":"D2","level":"warning","message":{"text":"Run.log_rebase_outcome (cognitive 16): Run.log_rebase_outcome has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/run.rb"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd98d5094a20638ec61bed5d4dc32a3a7454104d9c772a25bb5222a230d80498"}},{"ruleId":"D2","level":"warning","message":{"text":"Run.commit_after (cognitive 16): Run.commit_after has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 6, error handling 1, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/run.rb"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"0072ec51a2de927713e3f11dd69c0ebb4f704f5e07fa57165d0529ffc2c38fa8"}},{"ruleId":"D2","level":"warning","message":{"text":"Status.complete_project_payload (cognitive 16): Status.complete_project_payload has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 3, ternaries 2 (3 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/status.rb"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"455a7931e809f0eaf11cf87c57aff1a3f4f9e9b2b701b0ac7dbc316b7397f505"}},{"ruleId":"D2","level":"warning","message":{"text":"Status.decorate (cognitive 16): Status.decorate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 2 (5 pts), boolean chains 4 (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":"lib/hive/commands/status.rb"},"region":{"startLine":2181}}}],"partialFingerprints":{"codehealthFindingId/v1":"704709105d05a4bd7c2a856b96b75ab049069f7802cccae61ea9cca203720d99"}},{"ruleId":"D2","level":"warning","message":{"text":"Worktree.validate_arguments! (cognitive 16): Worktree.validate_arguments! has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 7. 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":"lib/hive/commands/worktree.rb"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ece30cb4bf10da4735cb50e06e8cccfcae9548575e32cacc28090b252ca6d7"}},{"ruleId":"D2","level":"warning","message":{"text":"ConcurrencyController.restore_schedule_state (cognitive 16): ConcurrencyController.restore_schedule_state has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 5, error handling 2 (3 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/concurrency_controller.rb"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"8606c2fa2fc3cb2edafcb9c1fe17a780921247f5f76a3cd5acb4f47aabaabb2c"}},{"ruleId":"D2","level":"warning","message":{"text":"RecoveryCoordinator.request_markerless_failure (cognitive 16): RecoveryCoordinator.request_markerless_failure has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), error handling 2 (3 pts), ternaries 2 (3 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/recovery_coordinator.rb"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ccb3c97eacf8aa7f894da61a184f14d688a5509a58add43890dc02a015b29b2"}},{"ruleId":"D2","level":"warning","message":{"text":"RefactorPatrolMergeReconciler.tick (cognitive 16): RefactorPatrolMergeReconciler.tick has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, error handling 1, loops 1, ternaries 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":"lib/hive/daemon/refactor_patrol_merge_reconciler.rb"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ec72042a8cd2736845ba81873ff62f1805c53a2e79ca03514b4d6d93bae90d"}},{"ruleId":"D2","level":"warning","message":{"text":"RefactorPatrolScheduler.reserve_post_merge (cognitive 16): RefactorPatrolScheduler.reserve_post_merge has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), error handling 3 (6 pts), boolean chains 3 (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":"lib/hive/daemon/refactor_patrol_scheduler.rb"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7598a21f686d94fcad8967152e74d4c354c9b7ffbae6d0f5b5e8918635d8a8"}},{"ruleId":"D2","level":"warning","message":{"text":"StatusReport.quiescence_status (cognitive 16): StatusReport.quiescence_status has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (8 pts), boolean chains 5, if/else 2, error handling 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":"lib/hive/daemon/status_report.rb"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"6463222b14ff4729af439ccf762b5396291105d0142dd40ba1485aee6eefc93b"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader.read_view (cognitive 16): Reader.read_view has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 5, ternaries 2, error handling 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daily_digest/reader.rb"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1419fdeccb92262ae5b2302510d66f0676a2e12b7137f94b5cb156f8f45e8f6"}},{"ruleId":"D2","level":"warning","message":{"text":"ManagedDirectory.entry_type (cognitive 16): ManagedDirectory.entry_type has cognitive complexity 16 (threshold 15). Drivers by points: error handling 5 (11 pts), if/else 2 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/managed_directory.rb"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8be8c2112914d3787dd205f0c76e421537145d3c4e2099535c13c6f49631a0"}},{"ruleId":"D2","level":"warning","message":{"text":"ManagedDirectory.atomic_write (cognitive 16): ManagedDirectory.atomic_write has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 4, error handling 2 (3 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/managed_directory.rb"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3cc22c0de23d62732a08226d55433e93f6e4997bb482b288f14b6a55a0b30a0"}},{"ruleId":"D2","level":"warning","message":{"text":"ManagedGit.capture3_bounded (cognitive 16): ManagedGit.capture3_bounded has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/managed_git.rb"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff2c1f5857166b040660514f0348005a3b7063e43e8dc33a2881b43139a1cda"}},{"ruleId":"D2","level":"warning","message":{"text":"OperationalStatus.review_grant_payload (cognitive 16): OperationalStatus.review_grant_payload has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 10, if/else 5, error handling 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/operational_status.rb"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ac3d8c18a2764a16a6ef92247cbfbac212c7d568ee4da5059e4bda9021aad7"}},{"ruleId":"D2","level":"warning","message":{"text":"Orchestrator.ensure_leg (cognitive 16): Orchestrator.ensure_leg has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/plan_review/orchestrator.rb"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0dbb7cc019cbf67fedbac5573de5b5d27b1e6433af98ae4aa2dcc10ae6a6ab"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectIdentity.resolve_read_only (cognitive 16): ProjectIdentity.resolve_read_only has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 7 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/project_identity.rb"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b83fc9a9509f3832fc926b2fd35fa441e2fa056503c1d03ac0735e96b0e77a"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.safe_read (cognitive 16): Store.safe_read has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, error handling 3 (6 pts), boolean chains 3 (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":"lib/hive/proposals/store.rb"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"5995ec42abf64f595bd7309daef2651a17c3244ff3fb5a1b85768b215341e304"}},{"ruleId":"D2","level":"warning","message":{"text":"JobRecordValidator.validate_disposition! (cognitive 16): JobRecordValidator.validate_disposition! has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/job_record_validator.rb"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4ee9c26686e37eb12051e53b312f8a6b3e9e78acf5f98603d852c17ef05152"}},{"ruleId":"D2","level":"warning","message":{"text":"PrManifest.validate! (cognitive 16): PrManifest.validate! has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, if/else 5, error handling 1, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/pr_manifest.rb"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"612d29fbbe256bd05ed556b3f36547466cf28498643c0402b1983b81edb33904"}},{"ruleId":"D2","level":"warning","message":{"text":"Client.request (cognitive 16): Client.request has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, error handling 3 (6 pts), boolean chains 1, ternaries 1 (nesting depth added 3). 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":"lib/hive/remote/client.rb"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"4536ed44580e3f1064738912b094f2e3c2bf59a8ffe6560b6a6fbe2570e0aeb8"}},{"ruleId":"D2","level":"warning","message":{"text":"RequestBoundary.process (cognitive 16): RequestBoundary.process has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), error handling 2 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/remote/request_boundary.rb"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aeb64dc476d5b2867daefdf1b7343cf9ddc309a12c551329ed9dde9c0506f57"}},{"ruleId":"D2","level":"warning","message":{"text":"RunningStatus.each_active_lease_row (cognitive 16): RunningStatus.each_active_lease_row has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6, error handling 4 (5 pts), boolean chains 4, ternaries 1 (nesting depth added 1). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/running_status.rb"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c4c72accc9f788340401993b73a51811b0df6807512e27c25252de2cbc609c"}},{"ruleId":"D2","level":"warning","message":{"text":"CommandRegistration.start! (cognitive 16): CommandRegistration.start! has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), error handling 3 (5 pts), boolean chains 3 (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":"lib/hive/runtime_control_plane/command_registration.rb"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"836bea2071b09aba9d3284597e304f9552068759db05a04596315d9e5bf2a7db"}},{"ruleId":"D2","level":"warning","message":{"text":"Agent.run! (cognitive 16): Agent.run! has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 6, ternaries 2, error handling 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/agent.rb"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24510be27b81b6523221f5f53ac6a9fc4ce542eb5eae47ab8ce4e59243f87c3"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentReport.validate_repository! (cognitive 16): AgentReport.validate_repository! has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), error handling 2 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/agent_report.rb"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"747c95871c04bc19bce6a9cb9d7b01c16414b7f1fabd1fb741ab4ae1ae971309"}},{"ruleId":"D2","level":"warning","message":{"text":"Base.with_stage_events (cognitive 16): Base.with_stage_events has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (6 pts), boolean chains 4, error handling 2 (3 pts), ternaries 1 (3 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":"lib/hive/stages/base.rb"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f356c4831eb9a7e84d32d1923b5be7519caea3838b962ccedcc5ff2f465ef7"}},{"ruleId":"D2","level":"warning","message":{"text":"ManagedAgentCustody.launch_agent (cognitive 16): ManagedAgentCustody.launch_agent has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (12 pts), ternaries 3, boolean chains 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/managed_agent_custody.rb"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb1a5cc0a0c5faac54ff1672cb4fed64dd2e78e64194dcccc083d9f05c2496b"}},{"ruleId":"D2","level":"warning","message":{"text":"Triage.run! (cognitive 16): Triage.run! has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/review/triage.rb"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"272612ac1db2e69845a3c436771d56190b9acb45873cd0a1c10e72f2a8c56719"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskAction.universal_action (cognitive 16): TaskAction.universal_action has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 4, ternaries 1 (2 pts) (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":"lib/hive/task_action.rb"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"20072b95211e3d8fd540162d5ca6c32a03e2af78d3f141bc48cb29eae0c4c037"}},{"ruleId":"D2","level":"warning","message":{"text":"Diagnostic.suggested_next_action_payload (cognitive 16): Diagnostic.suggested_next_action_payload has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 6, ternaries 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_action/diagnostic.rb"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3bbe76d673a867c4e53a073ddfac2b8fe0b8cbef4f28efb5aaa8d7d05dfaf05"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyComponent.connected_selection (cognitive 16): DependencyComponent.connected_selection has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 1 (2 pts), boolean chains 1, 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":"lib/hive/task_workspace/dependency_component.rb"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"9779721199134ba1f101dc50994167db392c332147eafd0b502875f846757873"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyComponent.enforce_bytes (cognitive 16): DependencyComponent.enforce_bytes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_workspace/dependency_component.rb"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f50bd384eef816312aa975b4645350028ffbe329cba20a23766cafd5c1dd4f0"}},{"ruleId":"D2","level":"warning","message":{"text":"PublicationCache.refresh (cognitive 16): PublicationCache.refresh has cognitive complexity 16 (threshold 15). Drivers by points: error handling 5, if/else 4 (5 pts), boolean chains 4, ternaries 1 (2 pts) (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":"lib/hive/task_workspace/publication_cache.rb"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"7153716e581fc46a29a39401fa008208ce28f1f3d4b3e4c9911f60d2edc26518"}},{"ruleId":"D2","level":"warning","message":{"text":"BubbleModel.review_waiting_editor_path (cognitive 16): BubbleModel.review_waiting_editor_path has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, ternaries 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":"lib/hive/tui/bubble_model.rb"},"region":{"startLine":1843}}}],"partialFingerprints":{"codehealthFindingId/v1":"e919f4bd7524120ea1e4d80d0ca8263654987aba20d161a4c071b75d86a95bdc"}},{"ruleId":"D2","level":"warning","message":{"text":"UserService.activation_effect (cognitive 16): UserService.activation_effect has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 6, ternaries 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/user_service.rb"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"38363778d52120cb45efd9be35920cbd7d606a04edb038819edfdafa13760f07"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction.with_holder_lock (cognitive 16): Transaction.with_holder_lock has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (6 pts), error handling 3 (4 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/user_service/transaction.rb"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"503df0686b8b85fe693f32f9e64985022a221ecbcac2527247630a556bb21b57"}},{"ruleId":"D2","level":"warning","message":{"text":"TransactionJournal.observed_target_digest (cognitive 16): TransactionJournal.observed_target_digest has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, if/else 4, error handling 2 (3 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/user_service/transaction_journal.rb"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa7104787e28b2cba16267e86c4bdec7cb8d2cbcfeb15753db8825a74fae9eb"}},{"ruleId":"D2","level":"warning","message":{"text":"StatusSnapshotStore.valid_page_data? (cognitive 16): StatusSnapshotStore.valid_page_data? has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 15, if/else 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/web/status_snapshot_store.rb"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc48392db4856bb12e5ca2e1a0baff4a3007cfbabc30272b36509a7e0ab39e0"}},{"ruleId":"D2","level":"warning","message":{"text":"PermissionProjection.normalize_scope_path (cognitive 16): PermissionProjection.normalize_scope_path has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 6, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/workflow_package/permission_projection.rb"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f516a697390f11dff3e1abeca5b31f4b0d42e01f3226e7dae8242798dc9958"}},{"ruleId":"D2","level":"warning","message":{"text":"RegistryClient.resolve_catalog (cognitive 16): RegistryClient.resolve_catalog has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 5, ternaries 1 (2 pts), error handling 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":"lib/hive/workflow_package/registry_client.rb"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f5d1d28713eea1271bbcaa99e03200fcfaeda4706e4871ed2743cdeb5a4b81c"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimePolicy.compile_portable_actor (cognitive 16): RuntimePolicy.compile_portable_actor has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 4, error handling 2 (3 pts), ternaries 1 (nesting depth added 2). 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":"lib/hive/workflow_package/runtime_policy.rb"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"b332ff22eef4af9a1c73d5820de34d15e2f6a24ce9f6bb2753d2c8d96ca89714"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskMigrator.apply_prepared (cognitive 16): TaskMigrator.apply_prepared has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, error handling 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":"lib/hive/workflow_package/task_migrator.rb"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a49cc62f182c6008ffc7cd0ce9e63f76336875e9abf0a9c05d538ae27f1ddff"}},{"ruleId":"D2","level":"warning","message":{"text":"Validator.validate (cognitive 16): Validator.validate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, boolean chains 6, error handling 2 (3 pts) (nesting depth added 1). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/workflow_package/validator.rb"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85b5f65a78f7572612daecdce4711f1a3db2df0348297fdad60450cd618af6b"}},{"ruleId":"D2","level":"warning","message":{"text":"Aggregate.valid_job? (cognitive 16): Aggregate.valid_job? has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 12, if/else 4. 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":"packaging/release_candidate/aggregate.rb"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb17317f21d9f119f21745752c693c50dd114c5c0c3a3cd0f44e50c4258452d"}},{"ruleId":"D2","level":"warning","message":{"text":"ReleaseSelector.validate_evidence! (cognitive 16): ReleaseSelector.validate_evidence! has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 14, if/else 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":"packaging/release_candidate/release_selector.rb"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae77f35a7fd9a1bf0ba1dfd6eb065f16805dd77011ba584df63fae1edfae213"}},{"ruleId":"D2","level":"warning","message":{"text":"ReleaseSelector.validate_effective_gates! (cognitive 16): ReleaseSelector.validate_effective_gates! has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 14, if/else 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":"packaging/release_candidate/release_selector.rb"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d4db5174b3e640efc3fffa1f3b587c722a8e5e1be0ca27ac36d49f7b1d1e8b"}},{"ruleId":"D2","level":"warning","message":{"text":"ReleaseSelector.validate_provenance! (cognitive 16): ReleaseSelector.validate_provenance! has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 10, if/else 6. 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":"packaging/release_candidate/release_selector.rb"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb468db43995acf8c3892b3c7f63c1343b860f94c25bf025050ea926eccf7c03"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteWorkflow.collect (cognitive 16): RemoteWorkflow.collect has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/release_candidate/remote_workflow.rb"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9acb9424bff24463343151380604a3244d61413f11a4dfc3fc9bdee611ae371"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: daemon/dispatcher.rb: FileTooLong \u2014 4061 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3561 over it, 8.12\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":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e693eb9e05d8fa95e45643fc755db85b7511082705710ac13cb3bbdea36b71"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Dispatcher: TooManyMethods \u2014 220 methods. The bar is 30 methods; this is 190 over it, 7.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c59e89d5e8c45d222b3f38cfcab9344077eff463a648d04cc942cf268ed7c86"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hive/config.rb: FileTooLong \u2014 3470 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2970 over it, 6.94\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":"lib/hive/config.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f76904d4b042cbc0024e1dee03e44c7c7219e4bd20af4d55e55fc9329bb5193c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Config: TooManyMethods \u2014 195 methods. The bar is 30 methods; this is 165 over it, 6.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/config.rb"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ebc69b8d1790ca48b9216f40ef66be8c76b4337ee1aded79b1462713132fcc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BubbleModel: TooManyMethods \u2014 163 methods. The bar is 30 methods; this is 133 over it, 5.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/tui/bubble_model.rb"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"897c0e2520f1df212da3dcc27ea1d5c186ee803d55288e11d3958ed0adc03198"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hive/cli.rb: FileTooLong \u2014 2479 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1979 over it, 4.96\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":"lib/hive/cli.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ffe8b93794358d248f775284de9670654a3397c759970f26e1f3d4824d3633d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stages/review.rb: FileTooLong \u2014 2090 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1590 over it, 4.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/review.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7c9ef8c7781402ee6a5e190cbf89c66de2a158e9b389dff65973b2a6fff41e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JobStore: TooManyMethods \u2014 122 methods. The bar is 30 methods; this is 92 over it, 4.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/job_store.rb"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7840b95ee35496d4abb2361853e38136dcf01ae205b0956d6ca007239587495"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: refactor_patrol/job_store.rb: FileTooLong \u2014 2033 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1533 over it, 4.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":"lib/hive/refactor_patrol/job_store.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac574b55b019204bebc8d68d37d61f5943101182cf5c8ac0f24d389c2a46ab07"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Status: TooManyMethods \u2014 120 methods. The bar is 30 methods; this is 90 over it, 4.00\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/status.rb"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"924d9bfc9d14d20955dabecceb2d0fd7d39c62e2798410641c7ce8028ae024e4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Review: TooManyMethods \u2014 119 methods. The bar is 30 methods; this is 89 over it, 3.97\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/review.rb"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"4248f84465c07181bc995ab052758244381250c79e25934df69784787b2cc050"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/status.rb: FileTooLong \u2014 1941 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1441 over it, 3.88\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":"lib/hive/commands/status.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09643a46cf610a43aba56d913bb2813b33b7365773119f244bf2f6f0e5a722e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Supervisor: TooManyMethods \u2014 113 methods. The bar is 30 methods; this is 83 over it, 3.77\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/bot/supervisor.rb"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af4a07642a9f175919a0a86d8572611054ba381a3ab10e8f1ba2ad9b988770b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: daemon/recovery_coordinator.rb: FileTooLong \u2014 1882 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1382 over it, 3.76\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":"lib/hive/daemon/recovery_coordinator.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"895f2c1b0251ae4b8d2bbb726398f2dd667b4574a647e9ee60a682845e88ce6c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tui/bubble_model.rb: FileTooLong \u2014 1764 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1264 over it, 3.53\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":"lib/hive/tui/bubble_model.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8fc5fceddc79352eb25056582b570e651805a427abbfe2259f88aba2335f76d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hive/user_service.rb: FileTooLong \u2014 1659 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1159 over it, 3.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/user_service.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79aad5766ac8a6df767e1b9463712106da134ec2753dd0cda1c148980e5beda2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RecoveryCoordinator: TooManyMethods \u2014 95 methods. The bar is 30 methods; this is 65 over it, 3.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/recovery_coordinator.rb"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e77f1dd3bdca7523aa9653b24414fbe9d4de2243606ea064ea8155fb1a3084"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Database: TooManyMethods \u2014 90 methods. The bar is 30 methods; this is 60 over it, 3.00\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/runtime_control_plane/database.rb"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"765d196354af45ae89a6d2c8ffab243eb90b3b7036814968804da62ba826a24a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Init: TooManyMethods \u2014 85 methods. The bar is 30 methods; this is 55 over it, 2.83\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/init.rb"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c2043b2b7057ca16ef6541325c090f0c7cfe78d445db9edbcf29aa2b689abb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bot/supervisor.rb: FileTooLong \u2014 1357 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 857 over it, 2.71\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":"lib/hive/bot/supervisor.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da120dca55f63d18554e67077463a4b70f4075ebbbae7c8623d3a2cbb7980e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hive/task_closure.rb: FileTooLong \u2014 1352 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 852 over it, 2.70\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":"lib/hive/task_closure.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c887b00afeecc816cdec20fecfb702db6faae9dee77434d62fcb59704e8c60dc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UserService: TooManyMethods \u2014 79 methods. The bar is 30 methods; this is 49 over it, 2.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/user_service.rb"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"3422b5c395a0c22c4bd80f1243e18cc85ec3306854c004ea3916ef97a0fb4cc2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Orchestrator: TooManyMethods \u2014 77 methods. The bar is 30 methods; this is 47 over it, 2.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/plan_review/orchestrator.rb"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"163cfeaad3b9802ea9b0e869d61c9fc79dbdace2d82010c0d82dbf6384939496"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RefactorPatrol: TooManyMethods \u2014 76 methods. The bar is 30 methods; this is 46 over it, 2.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/refactor_patrol.rb"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"4186c8d91cf44f97b6cb5070d92215f6f7da1de97133368de64f082d4e567a7e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Update: TooManyMethods \u2014 76 methods. The bar is 30 methods; this is 46 over it, 2.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/tui/update.rb"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab75fc1235e7fa4430ac6af80f96a95dc7741e2b5d2c2d8b12dadd5c1af67d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hive/agent.rb: FileTooLong \u2014 1247 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 747 over it, 2.49\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":"lib/hive/agent.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34998932d66f072d09a2f85767c7a30ab126a6f56ed19d147917167dd936c99d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plan_review/orchestrator.rb: FileTooLong \u2014 1218 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 718 over it, 2.44\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":"lib/hive/plan_review/orchestrator.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"504e3ee5d8033f6c3344a1607176f4b0225bc04fbec63ccfa91b865de9b9224c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Base: TooManyMethods \u2014 72 methods. The bar is 30 methods; this is 42 over it, 2.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/base.rb"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"3125805266f474a1268ec6d5b28ccdeeb935dfa43567d262d6fdc45ae7b5a7bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/init.rb: FileTooLong \u2014 1184 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 684 over it, 2.37\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":"lib/hive/commands/init.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05028d20d29ca7046140ad24596e6bbbc31990840e9473019355ad058475cac7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AdmissionStore: TooManyMethods \u2014 71 methods. The bar is 30 methods; this is 41 over it, 2.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol_fix/admission_store.rb"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"a70643b19d844701fa7843d728f524a46ff755f4d5694b435e085fe534e5d849"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TaskClosure: TooManyMethods \u2014 71 methods. The bar is 30 methods; this is 41 over it, 2.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_closure.rb"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"67dc659bf9d86e31a68efcdd0a5da814be7ac63c6bb3f209162e407cf807c67e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hive/operational_status.rb: FileTooLong \u2014 1178 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 678 over it, 2.36\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":"lib/hive/operational_status.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4578d2751941bf59636d1208eb5adb28a2990d03f0922da704e5fc7926157e45"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime_control_plane/database.rb: FileTooLong \u2014 1169 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 669 over it, 2.34\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":"lib/hive/runtime_control_plane/database.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0e27ad1bec7a31b9744df6f059de42b1084d7f1b765e05bd682db3f395419b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Agent: TooManyMethods \u2014 70 methods. The bar is 30 methods; this is 40 over it, 2.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/agent.rb"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a350505cda8433c74f590e61e72974e37b6cf351058e262b42afa15612d8b232"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OperationalStatus: TooManyMethods \u2014 70 methods. The bar is 30 methods; this is 40 over it, 2.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/operational_status.rb"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"99647f698349abc8a97655044d46c4c90a89741ee3cdc6339b60bdd9a3364a62"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DispatchRepository: TooManyMethods \u2014 70 methods. The bar is 30 methods; this is 40 over it, 2.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/runtime_control_plane/dispatch_repository.rb"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a1d032855127fb1d5881047554df24e437b6fff8c73c7d274b61c96842370e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/refactor_patrol.rb: FileTooLong \u2014 1162 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 662 over it, 2.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/refactor_patrol.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ef6a76d3fa216a415777e69d9a8a04db21c2a03db5e9d67c2078d8bb52f4c9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ArchitectureMapper: TooManyMethods \u2014 69 methods. The bar is 30 methods; this is 39 over it, 2.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol/architecture_mapper.rb"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"4416b5b080d3076b2e157c7f43efc47b70e32265f0b08318b2409d51a9e84f15"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CLI: TooManyMethods \u2014 68 methods. The bar is 30 methods; this is 38 over it, 2.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/cli.rb"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26a1db40f0ea3b8cf74e4191a2ff0ae303f284936e456b1233a6f4bb0b25f66"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TaskAction: TooManyMethods \u2014 66 methods. The bar is 30 methods; this is 36 over it, 2.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_action.rb"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccdcb84b94b969b125259b9425353f85a8d97d3193ababfb815c4ced6affd545"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: refactor_patrol/job_record_validator.rb: FileTooLong \u2014 1090 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 590 over it, 2.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/job_record_validator.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ffea74f22ae9b1b1856c12c6815b3f033d07854bcef55d16d3ce682b54ceb86"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stages/base.rb: FileTooLong \u2014 1086 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 586 over it, 2.17\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":"lib/hive/stages/base.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fcd575b5ba08f6f92b00e200d3d87e74e311e5da5e65d597f905ba9c08fa7b9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Builder: TooManyMethods \u2014 63 methods. The bar is 30 methods; this is 33 over it, 2.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_workspace/builder.rb"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b80abb502eb5b1e10f76b301839fcf8400f5effe8ada6e5aab8a0a5e6be5848"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/daemon.rb: FileTooLong \u2014 1025 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 525 over it, 2.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":"lib/hive/commands/daemon.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca3a4fedb14e1711e25fb02608471d58995b33a6624cce5782c8d06288b25f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: web/task_capture.rb: FileTooLong \u2014 1021 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 521 over it, 2.04\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":"lib/hive/web/task_capture.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"196c1b29583b16b549959c262e48c26dbea60c209748eb6f07d9650872903dbd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Store: TooManyMethods \u2014 60 methods. The bar is 30 methods; this is 30 over it, 2.00\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/artifacts/outcome_evidence/store.rb"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81246cc6da3827be36d18678d141961d76d5d003439cf07d4dfa14b489a41d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hive/github_publication.rb: FileTooLong \u2014 996 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 496 over it, 1.99\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":"lib/hive/github_publication.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"374298612157b9b003c61e3c4190f36ec3d400ee2a9bc96529fc4e8da1518829"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: web/project_capture_provider.rb: FileTooLong \u2014 990 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 490 over it, 1.98\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":"lib/hive/web/project_capture_provider.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"833d2dbfcf83cc91be87df5f2dec2efed8f48c2d81c7a00250c09c33784b60f6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Approve: TooManyMethods \u2014 59 methods. The bar is 30 methods; this is 29 over it, 1.97\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/approve.rb"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"12084f31ed601ed17de5f56155c57a00cc914e6425116a99a4925b38c01edbcc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ManagedStore: TooManyMethods \u2014 59 methods. The bar is 30 methods; this is 29 over it, 1.97\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/module_package/managed_store.rb"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"113ffb7ff3108e9588a48c7ae5f5f916dc1b70724d533e5427a2acf05cc946b5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ProjectCaptureProvider: TooManyMethods \u2014 59 methods. The bar is 30 methods; this is 29 over it, 1.97\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/web/project_capture_provider.rb"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d039a4d0ef4f6238b704d9db87a77da43a8784bd10c4ccf028d160d072514878"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: patrol_fix/admission_store.rb: FileTooLong \u2014 982 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 482 over it, 1.96\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":"lib/hive/patrol_fix/admission_store.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3249438c0ada2ea4676c0ad23b3aa0d25c2389166744972a4ffd9192315a2ec7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: daemon/refactor_patrol_scheduler.rb: FileTooLong \u2014 961 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 461 over it, 1.92\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":"lib/hive/daemon/refactor_patrol_scheduler.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86ecdcaca0e1cc27df271ba4d0e34337a94b8be8ac9ab57ad57624c6f130828"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NotificationBuilders: TooManyMethods \u2014 57 methods. The bar is 30 methods; this is 27 over it, 1.90\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/bot/notification_builders.rb"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd612927b327d5ca2f3c66c156d618957a403c5fac1d762a6e6dc6abc572e9c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: outcome_evidence/store.rb: FileTooLong \u2014 938 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 438 over it, 1.88\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":"lib/hive/artifacts/outcome_evidence/store.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ff0595e4549a438e19b7d81f2e2caac4fc5a45bf856886fa932e5d31f57762"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Repository: TooManyMethods \u2014 56 methods. The bar is 30 methods; this is 26 over it, 1.87\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/attempts/repository.rb"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9cc4ee4393ef972082741095ef436ab8adfa4534cdc9aa30912dfd5a877108"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MergeClassifier: TooManyMethods \u2014 55 methods. The bar is 30 methods; this is 25 over it, 1.83\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/merge_classifier.rb"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cff92b0276b99b54b930a4deb0dfdcacd7b793a522ed3798adfd4edff6167be"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Diagnostic: TooManyMethods \u2014 52 methods. The bar is 30 methods; this is 22 over it, 1.73\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_action/diagnostic.rb"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae8c5ffe2b950b2379a236c0af151cd6cf18066d05d77db5b582ce59ee092d8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DescriptorParser: TooManyMethods \u2014 52 methods. The bar is 30 methods; this is 22 over it, 1.73\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/workflows/descriptor_parser.rb"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec5d43623b7043c8e04de0d423d6d5be44d250937023c615be8cc737b8b455e9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Daemon: TooManyMethods \u2014 51 methods. The bar is 30 methods; this is 21 over it, 1.70\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/daemon.rb"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeed481563ae078aa29299bbc59498178e9085fe6842d40d4e05c93a532a6134"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RefactorPatrolMergeReconciler: TooManyMethods \u2014 51 methods. The bar is 30 methods; this is 21 over it, 1.70\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/refactor_patrol_merge_reconciler.rb"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"4454d2543097372e90de7f24912292146e0d088ebed3dfaf3817369356ea3d8d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Gh: TooManyMethods \u2014 50 methods. The bar is 30 methods; this is 20 over it, 1.67\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/gh.rb"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"fabd8053d1914dae2302802ca5d4ab60f6bef28f5ad0b449c7b8de4a06f4c76c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: attempts/supervisor.rb: FileTooLong \u2014 829 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 329 over it, 1.66\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":"lib/hive/attempts/supervisor.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57ccf5cf9660d3e4437817a69a319f2ada27296330b0d73e40b36b65b04b509"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: live_agent_skills/workflow_creator_live_setup.rb: FileTooLong \u2014 822 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 322 over it, 1.64\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":"packaging/live_agent_skills/workflow_creator_live_setup.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8145efb5568f6ab4cab010f9c4e88473f79b3cab0cad5f2a86443967bd7be570"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime_control_plane/dispatch_repository.rb: FileTooLong \u2014 821 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 321 over it, 1.64\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":"lib/hive/runtime_control_plane/dispatch_repository.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b840ee5a15f22c30f9928e4289e235b21ebb857a763febc02df1d58af1b744d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Record: TooManyMethods \u2014 49 methods. The bar is 30 methods; this is 19 over it, 1.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/attempts/record.rb"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf90b0947e07d158cbcb1e0a3369705d7b21aafb8facff2f6971d6de5578af7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GitOps: TooManyMethods \u2014 49 methods. The bar is 30 methods; this is 19 over it, 1.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/git_ops.rb"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04ecd340c245c12768405f786e0f106ccd2664830bb41585aa5ca354cacce4a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Manager: TooManyMethods \u2014 49 methods. The bar is 30 methods; this is 19 over it, 1.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/user_service/manager.rb"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16ef698cb3d137f7564cacc3d3453ad51bc5e27608b805967d556e4f4e5de0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stages/artifacts.rb: FileTooLong \u2014 812 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 312 over it, 1.62\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":"lib/hive/stages/artifacts.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ebba6929b1f801431558d9e4706b7ccb646f2e4457ed5fd2dabb87bf96eec45"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tui/update.rb: FileTooLong \u2014 811 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 311 over it, 1.62\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":"lib/hive/tui/update.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d96ecea90aaf5e570e07ab3b026d3b7c1c4b5d7da79f8462d8cb2cf66981b60"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: daemon/refactor_patrol_merge_reconciler.rb: FileTooLong \u2014 807 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 307 over it, 1.61\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":"lib/hive/daemon/refactor_patrol_merge_reconciler.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d63342989205c21f977196befc7caa305858be11cdb7762818669cc02cdfe56"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hive/gh.rb: FileTooLong \u2014 804 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 304 over it, 1.61\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":"lib/hive/gh.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7b1a9d9c5b11bad9590435c85e6e727829d66ead6db23dae990e3abbc242f4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ReviewBudget: TooManyMethods \u2014 48 methods. The bar is 30 methods; this is 18 over it, 1.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/review_budget.rb"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ab76482a8fae31b5571d420287e8f9e7b57f36b04086ec19c2778207ac8617"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Task: TooManyMethods \u2014 48 methods. The bar is 30 methods; this is 18 over it, 1.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/models/task.rb"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b8920902c9e2d7fe6c1e74329cfa56d51a1c6fd2ae85194c367c9ad1ef2414"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hive/task_action.rb: FileTooLong \u2014 797 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 297 over it, 1.59\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":"lib/hive/task_action.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6ef74d517b994d48c2e46dee84723a802e248be57e9d2b231ffb0f334f2f28"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Dispatcher: TooManyMethods \u2014 47 methods. The bar is 30 methods; this is 17 over it, 1.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/attempts/dispatcher.rb"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6b1ae81471ebc4c4dae3f3f2cf8f00040985cabff8dd232f79125ad2c2b1fd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: New: TooManyMethods \u2014 47 methods. The bar is 30 methods; this is 17 over it, 1.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/new.rb"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bdd8814bd86e89689670dd410794bae8a466465a9c52295c58d9e04bd9ff9e2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ProjectSource: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daily_digest/project_source.rb"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb072af0ac1b98a9d4485a38750312dbc72caa5da3e2100d31ca147db3b8ff6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Controller: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/github_publication.rb"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff2fd66d008250b0de78bb55eb324da328378f4884611390b7781981199f2b1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WorkflowCreatorLiveRunner: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/live_agent_skills/workflow_creator_live_runner.rb"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"109f055d8f079de417fb51ab02e37fb422cc2bf5c582bbe3fe7d7204e4ba8815"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/approve.rb: FileTooLong \u2014 765 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 265 over it, 1.53\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":"lib/hive/commands/approve.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8ddf34a70bd0ee0340047e20bdcf7289757e9011066bf6e47a1660609c086c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: task_workspace/builder.rb: FileTooLong \u2014 764 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 264 over it, 1.53\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":"lib/hive/task_workspace/builder.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76641638454f2164f184285251766f11ce22ddfcf800c79ce5f0e62d2b48f9ca"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Answer: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/answer.rb"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28516375907fc66b1608340f079dc1a7fb650e83b2aac94ee06686718bb9883"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SourceEventStore: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/proposals/source_event_store.rb"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17c6dd1b86ba9fda374d0ec6954bba219c058febea562a294174293eafbf6b0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AuthoringLint: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/workflow_package/authoring_lint.rb"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc1ec0e271035f8587cac3d014bc2b2d8bc7e338984d2ebbe4f071c66bbf2ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hive/agent_git_gate.rb: FileTooLong \u2014 750 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 250 over it, 1.50\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":"lib/hive/agent_git_gate.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9fc94c3432d739d436ca184dce5f2ece6f7683a781a07c6a7d9aa70483ee0d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: refactor_patrol/merge_classifier.rb: FileTooLong \u2014 750 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 250 over it, 1.50\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":"lib/hive/refactor_patrol/merge_classifier.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e394a268be77c5e080a34bb31bcceedfbc0f51f60a1f71c9529d48f3105c8f5e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hive/dependency_snapshot.rb: FileTooLong \u2014 737 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 237 over it, 1.47\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":"lib/hive/dependency_snapshot.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be74e1e039a1cd886f38505b0ae56bb11ee69762bed13c9dd821e21bf71f1ac8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Base: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/service_installer/base.rb"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"abee28e7164f864fc4450bca6949cbfa6819d424f62c5d595eb37e0f9c167856"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RefactorPatrolScheduler: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/refactor_patrol_scheduler.rb"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"d266264d8fe7c0ee05a76c1faac53cf81edc6e67f7379eb34eab665c281beaaf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Store: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/proposals/store.rb"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"591ddd88d9da4dd74e702e77f5c6d56a0b053f0430cafafed673ff34bfb13d97"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Worktree: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/worktree.rb"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff20c21ecb4ed67d47af6aa9f2997333d145de0df8ce14ee1b451f065225a92"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hive/managed_directory.rb: FileTooLong \u2014 726 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 226 over it, 1.45\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":"lib/hive/managed_directory.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e390ad6e9db8391d3d4797bd05cf5888363a334f13ca35ea1c0eaa028c8b2cd1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: workflow_package/authoring_lint.rb: FileTooLong \u2014 723 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 223 over it, 1.45\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":"lib/hive/workflow_package/authoring_lint.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be965d24c318423b3ea69fe99932e3b99b4c4d5bea167b941c6dd99cd70e881a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: workflow_package/runtime_policy.rb: FileTooLong \u2014 718 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 218 over it, 1.44\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":"lib/hive/workflow_package/runtime_policy.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1f72f2b2112b6e139a0aaf3f504a08ae82b439bae8490a080210720cf29021"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Run: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/run.rb"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc23df237dccfe1e2dd086be15e8904ef8bb74083230fea123b95e928ea0061"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Watch: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/watch.rb"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"be521523777d71443d52e64aa0b9ae78ff695eb6b39afe10664ea41db45b87cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/run.rb: FileTooLong \u2014 713 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 213 over it, 1.43\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":"lib/hive/commands/run.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c5af36e6dcb06510e8549d4d2df0bcdae7606a2106ab16427ca75ba1bb96aec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: patrol/architecture_mapper.rb: FileTooLong \u2014 709 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 209 over it, 1.42\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":"lib/hive/patrol/architecture_mapper.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fdf16abe702f0842d30e4cce7ccb5216de6b55d58310e3d747d35270af4d25c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ChildSupervisor: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/child_supervisor.rb"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9958405d278f857f387974761ffb087fd29da01f1633c017e7c5b4c9dc5fed9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JobRecordValidator: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/job_record_validator.rb"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ec576bf462a5e6bbbd7eb1a61787171931f876610d08cdd987733e5b01395f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TaskCapture: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/web/task_capture.rb"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd991cbf8fc8f7abf8891b5adac068bcaea46cb3e83b487e9fe8d65a1ecdc3b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: attempts/dispatcher.rb: FileTooLong \u2014 699 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 199 over it, 1.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/attempts/dispatcher.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afca4c99b774fda135e0ab165f3530164d51271d83034ca72aeed5a07c3d24a5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/new.rb: FileTooLong \u2014 687 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 187 over it, 1.37\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":"lib/hive/commands/new.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6684d418a9901fe76d2ab4e7989c1279958516b3bcb260fd7a10a81bb88ce82c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Supervisor: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/attempts/supervisor.rb"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c5dc32d62ab55c4822571fc8dd563363b59ad6ab1de110161cdb79d320f182"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Workflow: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/workflow.rb"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4418860ebee71c4d8a5a1f7cc6f83af8d6dd222e93a6951c3c3211185386f5b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UsageDb: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/usage_db.rb"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7491175e6945b0c6deb96a9f56114dbdcb716e6c08bc34ebdc3bf722ca0012"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: outcome_evidence/proof.rb: FileTooLong \u2014 679 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 179 over it, 1.36\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":"lib/hive/artifacts/outcome_evidence/proof.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d781df02f9ee3cb34ef02c480bb87e87b2cfa42f65c5f8b5a560edf39021414b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: live_agent_skills/workflow_creator_live_runner.rb: FileTooLong \u2014 672 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 172 over it, 1.34\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":"packaging/live_agent_skills/workflow_creator_live_runner.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b92a53ff150a33baf865a656ad75e04e228f98ca27cfa86178234746bd1ed2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: StaleAgentHealer: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/stale_agent_healer.rb"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"14158c856fceb13a1a9d181184850edbb496a2120708de53c8477257a46b200f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Store: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daily_digest/store.rb"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b668c7fe49a6321a0e51b7e9827d2fd70e675f1eea9a52d968dd0c393f44bd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Context: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/dependency_admission.rb"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb83d8ba52ff082d1a4907de411f2eca3d633dd613db0e300d65f6a8917397fb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DependencySnapshot: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/dependency_snapshot.rb"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b20b449c19ceb4a650163f436fb24c2e75a4d842f800745ada461d7c8025164"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ManagedStore: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/workflow_package/managed_store.rb"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7960e14026a3d566030d48e342f2a70a1b1b88d8c517c289503a2253d11db9a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: artifacts/capture_toolkit.rb: FileTooLong \u2014 662 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 162 over it, 1.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/artifacts/capture_toolkit.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e964f20c6282a368cf205f76ec8c99d5f3ea4bea1d85b662fe7f772c9a6fdf0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hive/task_activity.rb: FileTooLong \u2014 657 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 157 over it, 1.31\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":"lib/hive/task_activity.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f990bac1d49324953cd2ad97263de2faeb1c30dcd7fe3955daaa375f7f3d02"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/watch.rb: FileTooLong \u2014 653 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 153 over it, 1.31\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":"lib/hive/commands/watch.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1c4a51df4ba8836660c58ef9c1db88c11d17bb263044ba2836af4597222f86"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Proposal: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/proposal.rb"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5af4cb257505fb32640abd8fce8a28433d70f60abd5cfd3eed0626f0a806edd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Execute: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/execute.rb"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6543f1fb1bbe160e1142d4d3e3adba8117fe1d80e2b5ed83b0efef20bdbedd0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hive/agent_profile.rb: FileTooLong \u2014 641 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 141 over it, 1.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/agent_profile.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c5d962300961a6d3597a8ab1a867aa75b2330e03476e4c62ebdbff3603e5d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: workflows/descriptor_parser.rb: FileTooLong \u2014 637 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 137 over it, 1.27\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":"lib/hive/workflows/descriptor_parser.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8a6191fd912b0d7a875502258e0487f06c55ab281b4b30957f0b24c52c8372"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DirectoryPublisher: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/agent_skills/directory_publisher.rb"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"282130302b7b5b0e6bd99345720741eca379ac9fb6a4b87badac6a2c788c3a3e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Drop: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/drop.rb"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"159e276b81e4cb211ec3cfb4af1e4767883be4259bc144c4e5bdd45b2f1bc425"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Prompts: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/init/prompts.rb"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a6fb6d94f8aaedf3a4f82346c8a61c5b8c05253d1425411ae81ebbed3a1dd4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ManagedDirectory: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/managed_directory.rb"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"c191fcc138238e9d56802486178854a0c8a308c9338d77c51d0573421ea49cd0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hive/artifact_firewall.rb: FileTooLong \u2014 632 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 132 over it, 1.26\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":"lib/hive/artifact_firewall.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3dcf621c50d6f13c1e53af92cdc73b802224a9b9051c963bfa532e3d48a35d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stages/execute.rb: FileTooLong \u2014 627 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 127 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/execute.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"535b6d0980610a422584e614d0e6f33963a2ded0603207fc717f7a7f09f013e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/answer.rb: FileTooLong \u2014 622 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 122 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/answer.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5047e7fa1f2c8e06fe3ff475eab489bceceb9b7a8eaeac9a157fd3a787e6e6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AgentProfile: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/agent_profile.rb"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe276bc86c8d2c9eeee0690bdd44e1fc64af4962f1ec5cf5cc73c71a4d45d69"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PublicationCache: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_workspace/publication_cache.rb"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ceadf74254fe0992f4a9a25961fa8fa89d9ea1830a11feedd3fcf8726596196"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ProcessSupervisor: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/live_agent_skills/workflow_creator_process_supervisor.rb"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fac78560bacd6dae311e2e164a9e90779989350b12d0ea8c428dcfa9950c694"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: daemon/quiescence.rb: FileTooLong \u2014 614 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 114 over it, 1.23\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":"lib/hive/daemon/quiescence.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"adecfbab7f1420d1aa9fbc22861f8837e67fb01b0022e05a24b66cc4bd0c4950"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: attempts/repository.rb: FileTooLong \u2014 613 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 113 over it, 1.23\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":"lib/hive/attempts/repository.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"207950e19a6858de9087eecd89fd989aa176bdec69b79327f87ea7044bfcc119"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hive/review_budget.rb: FileTooLong \u2014 613 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 113 over it, 1.23\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":"lib/hive/review_budget.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1268ebbe489ac857c6ba2d86ee8ce5d24660591003f8ef68306b6b87e948955"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/proposal.rb: 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":"lib/hive/commands/proposal.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1f4c3551a99c4774b2de4cce45259bb39c77aea3ff90f6ff5b7d12b795cbde"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: release_candidate/release_selector.rb: FileTooLong \u2014 607 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 107 over it, 1.21\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":"packaging/release_candidate/release_selector.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"831e5b513eeccfc607a1fb603b03555f529bb74c6104b9a720c99cb18f14843d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hive/command_receipt_store.rb: FileTooLong \u2014 605 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 105 over it, 1.21\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":"lib/hive/command_receipt_store.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9889afd76f40ec7b3beae9fd962e282b96bcf7f84db36652edb6c7e1fa473deb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/decide.rb: FileTooLong \u2014 603 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 103 over it, 1.21\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":"lib/hive/commands/decide.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a27a7b77a372d7d06992d3b7e08bd7bbcf6df1c73ba505caaaa9e51178f374"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PrFixer: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/babysitter/pr_fixer.rb"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"e242add98fc8838b970299fe4437b8662f079816b9d8e6426063da354fa339db"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CommandOperation: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/command_operation.rb"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"af606b3e4e262711b40b95c981d07ced0a458eb0dae2b612ead083dd04a87581"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AdhocReview: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/adhoc_review.rb"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8dadeb0a7126849ea5e1beda7f10916ae9cb4cf3291e69bfa7d3f021a11a01"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TaskProjection: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_projection.rb"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"12114e66321dfb9fabd94aeb0de836d054745fb31026e10bb502413405fdf7b7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DailyDigest: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/models/daily_digest.rb"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f34802835833077ebe88097ba78bd8689fcbe07fdc8993171a8e3437518cb2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hive/command_receipt_pruner.rb: FileTooLong \u2014 598 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 98 over it, 1.20\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":"lib/hive/command_receipt_pruner.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"925efe2f59408ef7a171086e67e6da96f54bcdda39600d8475582fa1756fa4cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hive/command_operation.rb: FileTooLong \u2014 597 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 97 over it, 1.19\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":"lib/hive/command_operation.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"289089323f7ec875619e60c818d5312d53124993968e8d23331a24a11e34bb68"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agent_skills/inspector.rb: FileTooLong \u2014 592 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 92 over it, 1.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/agent_skills/inspector.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9576f5b10c509b7526c2587d75b1b68678e6abb7fbd41b6a9de49f8ab8d1a5e0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: task_workspace/publication.rb: FileTooLong \u2014 592 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 92 over it, 1.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_workspace/publication.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0c01a85b383a1a384c1758e2b61677bcbc823fba6030696712049734d2cd97"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agent_cli_runtime/values.rb: FileTooLong \u2014 590 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 90 over it, 1.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"components/agent-cli-runtime/lib/agent_cli_runtime/values.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3a6a1b317a37bc924f64f8a94e527cd8ca1f5fb7981de185d25c2bc28e3b77"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: attempts/record.rb: FileTooLong \u2014 586 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 86 over it, 1.17\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":"lib/hive/attempts/record.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c060c89da067bd5d537f52d0435ac5aa6cfdf7898eee7afcae64b4cb87c105b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stages/draft_pr_handoff.rb: FileTooLong \u2014 586 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 86 over it, 1.17\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":"lib/hive/stages/draft_pr_handoff.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f5d74253a8576c187251e9ff43419a5990fcb77648d3749d76f18cec775f17"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Inspector: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/agent_skills/inspector.rb"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"54389c749f97fdaf7883f0b594f05a52ffa08e0d47f470660ed4914f6b98a641"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Decide: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/decide.rb"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"32bf83c97876ff67865770260d1d0bcabbec5755e425e8babc8903ce39da2acd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Mapper: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol/mapper.rb"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"f906e69248c1274f2d9ad40c2920cc619d58dea16d5224f04f11d8f37c41c14b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RuntimePolicy: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/workflow_package/runtime_policy.rb"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c6a88bc844d951b7ec8a45291cd74a2d8937c1a5d11636b49dfab39764b124"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hive/task_meta.rb: FileTooLong \u2014 580 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 80 over it, 1.16\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":"lib/hive/task_meta.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6816df30ca9cb6737f4ef6b562ccb7bf050fc6fa6ce77fe033a69d3041a7cee"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hive/worktree.rb: FileTooLong \u2014 578 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 78 over it, 1.16\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":"lib/hive/worktree.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4681ad817872ade6bcab3b4156bd6de12ae0cc3760a7856ce609b5b196b6b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: daemon/operational_snapshot.rb: FileTooLong \u2014 571 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 71 over it, 1.14\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":"lib/hive/daemon/operational_snapshot.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5668eda3b7c43ba3f9859aaf622abc582969f53e06a8c12e9f5cf5ef9235c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hive/command_receipt_maintenance.rb: FileTooLong \u2014 570 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 70 over it, 1.14\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":"lib/hive/command_receipt_maintenance.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9968b0b0493df7fa42e92097dcf4382503d6dc0c471a789b30994396aeb3ddd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: daily_digest/project_source.rb: FileTooLong \u2014 567 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 67 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daily_digest/project_source.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6256b43265e50b4ae9d55bf47565891b441c3bebe80532cc59e6c69b0fce729d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NotificationDispatcher: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/bot/notification_dispatcher.rb"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f282eb26ee7befa03f0ffafa6912406fdb74796997456caa4c83a6445bc056"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CommandReceiptMaintenance: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/command_receipt_maintenance.rb"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ef7e3f6985afb587be2316f9751fadf09e5297bc64b175ca6918959641bad9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Babysit: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/babysit.rb"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0c4c0344490415b7e1642e55cfe287a2070655c3492512982e9ce943c9dc22"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DeliveryLedger: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daily_digest/delivery_ledger.rb"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e122a916b5df4dafdffede52fb6b61f2692439944553a89aac4025cc08887f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TaskMaterializer: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol_fix/task_materializer.rb"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f4dc09924242c025ced5883d9d210fbe84c59e8de2a6ea75fb2c29463a084d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JobQueryIndex: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/job_query_index.rb"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"245e50889e9cb6671515a8e22079486f2857031d4a9d0fe32d1a90569a3737b2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Artifacts: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/artifacts.rb"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f825263c826dbc8b66f795b3e8db6baa8805d54d41a3826b2b85c08841b573"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DraftPrHandoff: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/draft_pr_handoff.rb"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47aadaca69e60eb76bad903f9f4e76c6d2227ce78131f53ee641c468b968dcd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TaskMeta: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_meta.rb"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3dff42f31e88372891c479a546b5e305d919d3c91e88d37ac67e72429f16844"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Subprocess: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/tui/subprocess.rb"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d932b4773dedd278e3579db76a0418a6654bdd4edae37b5f3fca00b95b0a65"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hive/dependency_admission.rb: FileTooLong \u2014 566 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 66 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/dependency_admission.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5311433a5a336ef9eb8ecd0d13152b49863fbf8a9d81fcaa58b56419c6197806"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: user_service/manager.rb: FileTooLong \u2014 562 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 62 over it, 1.12\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":"lib/hive/user_service/manager.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ecdf2c42555ffac4b05d061e096e0bc8f6d46c06f0979b27deb84447a8a54b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/setup.rb: FileTooLong \u2014 561 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 61 over it, 1.12\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":"lib/hive/commands/setup.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"220fcd6d7f63876ffc16a7f0ac89aee1e21caa29e6e6be11c59d1af19c5ca1eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: proposals/store.rb: FileTooLong \u2014 561 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 61 over it, 1.12\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":"lib/hive/proposals/store.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ad92151872f8841f1361a6ac543b5c7a05851c19560308125602c086bd9d1e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hive/git_ops.rb: FileTooLong \u2014 558 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 58 over it, 1.12\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":"lib/hive/git_ops.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"033ddd6e2ee2fbb571e125058d98dedcaf4c6b0596af162edd1260e75545e810"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: module_package/managed_store.rb: FileTooLong \u2014 554 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 54 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/module_package/managed_store.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1b801f3908bcedfe144815acd3eb12bf4ccdbd39c81a1ac2a1545e234585f4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Profile: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"components/agent-cli-runtime/lib/agent_cli_runtime/profile.rb"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cfbfec1a173be87bf8e1b9ae064b0d0c1e1fdca08ea98fb61ad125e259ace1d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AgentGitGate: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/agent_git_gate.rb"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4b1a2a05bcbe745b3beaa532ff85d883c147d55641209c5d4a8a27f03c17cf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AgentObservation: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/agent_observation.rb"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a4307b0f7e23e0ab374289c27ba95bde6a6e84ba0714a9c7977448fabd7213"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: IdeaDraftStore: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/bot/idea_draft_store.rb"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fef281ed1d1e35ab49a50cfb35dab56d9fd604d0e85a6b6f05d9b1a73615469"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Setup: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/setup.rb"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c70152cbf7de885f68a43aaf2b44a2155c8f924c096d6eaf9d2d1d0f9cb1620"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PayloadStore: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/runtime_control_plane/payload_store.rb"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"470505043401350d502b9697ba4b42abffa246c94602b5c6079f34a38c4102b5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Publication: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_workspace/publication.rb"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fec717309b94d0654517b88bd1a578629d17e6f69d771e9b1d7fb4f18ae0b8d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: models/task.rb: FileTooLong \u2014 541 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 41 over it, 1.08\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":"web/app/models/task.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3165b372afc309c036f1c226d30307032bda257485b16919d75710dadc561949"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: init/prompts.rb: FileTooLong \u2014 538 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 38 over it, 1.08\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":"lib/hive/commands/init/prompts.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4426e7a197d6f224c0e39b585a02303f1260635bcd36cff79a3f55650bf9064"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: task_workspace/dependency_component.rb: FileTooLong \u2014 538 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 38 over it, 1.08\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":"lib/hive/task_workspace/dependency_component.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"641dc014b83e9725c2ed774124b36cecb22ff62b09cfbe6c67c07797b9ff1afb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Reviewer: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/agent_support/codex/reviewer.rb"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec5d1ab42ffb20e4747e149e203085567b4dea531b81a352688073d4080880f4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CaptureToolkit: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/artifacts/capture_toolkit.rb"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c728a2a3547788d8c323c95eb6d7db25bef7d9546d64b8f0a844ba8be25327df"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SlashHandlers: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/bot/handlers/slash_handlers.rb"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"93693468b2c5de733cf839a269fb7a3cdbd154fe2f65374945e047d08cbfd4f6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Lifecycle: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/module/lifecycle.rb"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3435b0c59890dd9bad9d3aa1b555c2d4afd076586153f6e1ac026ceb5150ad"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ContextProvenance: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/context_provenance.rb"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"0515566405b5c41033b59463620090ee9e97c8fb0f79918d387eca90664fe0bf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ConcurrencyController: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/concurrency_controller.rb"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9447221074c229d5fb97ae585eba2db1d12a548e09c47105503713578babd4c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Dispatcher: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/modules/dispatcher.rb"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0f054525764d372b0a1dfa4e32a579d204fda04b1fe68baae5fe8ac1d0039a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PostMergeBatchStore: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/post_merge_batch_store.rb"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09de8c517f4b446c988d199342ce2ea688622bc7aefb1473e8f216c20a77371"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Task: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task.rb"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"506e9ae7bea8d8d9b0b37ab7415568e0f5561a514616cd2a8e0fea58d9cd6160"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Timeline: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_workspace/timeline.rb"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"4804deadad93cedf42f3e012495b171eff76eef8ad43f25b428594e9914afbce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: user_service/transaction_journal.rb: FileTooLong \u2014 520 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 20 over it, 1.04\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":"lib/hive/user_service/transaction_journal.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df4ca0ecfc82a6189df9f9f9e4121a0c99ad67a8629066bb789bf45e6af452e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Proof: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/artifacts/outcome_evidence/proof.rb"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f4c9482f45cef0c9ffd33e0f6cd2a8ec1864bee9361772bb82ba78193816ce"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AlertStore: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/bot/alert_store.rb"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7f752f918b25cf32a6c6f933c0fe55ee583e1f15be6bd97145c704a9fabfd4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CommandReceiptStore: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/command_receipt_store.rb"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e888456851b6581f2400ba2d4cd3d66a5bdee6afe61d8220d26dcf6b5e953417"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Assembler: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/operational_snapshot.rb"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2672ca528ede898763fd92b23a68457c25c0f44fb03ce010984ccdcae221494"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PatrolScheduler: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/patrol_scheduler.rb"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe105f2c8e52d17e5c95953073ac0de88266e0cfe7d67eb60bc0a1a4424277b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Manifest: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/module_package/manifest.rb"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe1cf78cf66316b879d7a1302e51aef95652193df12651447dd02aacf9c8724"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Configuration: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/provider_routing/configuration.rb"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a3d2bf48b7699345785c13fe30cf4520f5f759adfc03e6977029713aa92b6d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: StateSource: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/tui/state_source.rb"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8915bf899abe04fd26f3778d302fb603b4364a5e146d089701b6c87af8afef31"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AppBundle: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/web/app_bundle.rb"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf5d4dc984817aef8c157df85b34342ee04389cfc418f2d8f010788b31d09aa"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: StatusFeed: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/web/status_feed.rb"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb282c732cd255a39636adcd6251e6d2f55f9c3cb16486e62d7262e1679b573"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RegistryGateway: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/workflow_package/registry_gateway.rb"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa4c9dc1690165d953a8c0ef58fcca42adfda67d2a5ce903042f7d8e171a1e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agent_skills/directory_publisher.rb: FileTooLong \u2014 515 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 15 over it, 1.03\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":"lib/hive/agent_skills/directory_publisher.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d3ce4fc95f20e3575fb85a8e7819a1e2808c562bd6476835d9a5d06efe5ac1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hive/proposals.rb: 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":"lib/hive/proposals.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97cb448dde3326feafe5ba3fe844b2832b2b663fd853f4095bc9792d494d50e0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: module/lifecycle.rb: FileTooLong \u2014 504 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 4 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":"lib/hive/commands/module/lifecycle.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c00fa693289e04557dbab6f17e6e42682fc7846ea817af5a2b8bbd32d622c7c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stages/finalize.rb: FileTooLong \u2014 503 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3 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":"lib/hive/stages/finalize.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7283f44fa7acb04ccd6e442c398cd37e0da49130692eb85e72c277cc04844d74"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (78 shared lines): web/script/record_box_demo_real.rb:25-300 | web/script/record_box_demo_real_resume.rb:36-183 \u2014 These two members are variants of one another: 78 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/script/record_box_demo_real.rb"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1be10513d1836911cbf88653b7d1fe979574f119a70e13dc39bde32c14f9c22"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): lib/hive/daemon/recovery_coordinator.rb:1870-1881 | lib/hive/runtime_control_plane/dispatch_repository.rb:98-140 | lib/hive/user_service/status.rb:22-74 | templates/builtins/bench/runtime/harness/profiles/candidates.rb:54-62 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/recovery_coordinator.rb"},"region":{"startLine":1870}}}],"partialFingerprints":{"codehealthFindingId/v1":"961d20d39838ca389f6d561d9cc0092730cbec5dc6c318e0d68da26ce2a3236c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): lib/hive/daemon/patrol_fix_semantic_decision_runner.rb:45-100 | lib/hive/refactor_patrol/merge_classifier_runner.rb:40-89 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/patrol_fix_semantic_decision_runner.rb"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a545f28972ca6a114bf75813a5617a6271e432afc5b31a3478be3fb3705c4ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): lib/hive/command_receipt_store/effects.rb:94-129 | lib/hive/command_receipt_store/effects.rb:134-170 \u2014 These two members are one piece of code written twice and then edited apart: 36 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":"lib/hive/command_receipt_store/effects.rb"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"17bcf708f0c7a28c77bae4b690db16b32f305e3c4dfcb3d731d16e9d44dedcea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (72 corresponding lines): lib/hive/web/project_capture_provider.rb:226-297 | lib/hive/web/project_capture_provider.rb:306-392 \u2014 These two members are one piece of code written twice and then edited apart: 72 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":"lib/hive/web/project_capture_provider.rb"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"949a2d4f3fec5d069ec01dcf37bf28471185efe584b4fe0813a7ca83f13983f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): lib/hive/patrol/reviewer.rb:319-371 | lib/hive/refactor_patrol/review_agent_runner.rb:38-92 \u2014 These two members are one piece of code written twice and then edited apart: 53 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":"lib/hive/patrol/reviewer.rb"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"e936a20df3f3566edb0f0166ee728b1f40838ceffa21db4e950f5c12b61bc25a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 39\u002B corresponding lines): lib/hive/proposals/decision_service.rb:31-69 | lib/hive/proposals/decision_service.rb:75-114 | lib/hive/proposals/decision_service.rb:120-162 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 39 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/proposals/decision_service.rb"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"af06132c5db81d6efb86e438d848c9f838195db747d5facf481d34394b0693df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): lib/hive/stages/council/reviewer.rb:74-111 | lib/hive/stages/council/revise.rb:53-89 \u2014 These two members are one piece of code written twice and then edited apart: 37 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":"lib/hive/stages/council/reviewer.rb"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b61a2fbb8e28b084f2c2358522182a1d6bfc2318585e18ef7d0cac5a086ab15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): lib/hive/workflows/descriptor_parser.rb:591-613 | lib/hive/workflows/descriptor_parser.rb:668-688 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/workflows/descriptor_parser.rb"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d7773c16c60086c0f6760946aec5ffca5767735fbfd2d20e92863e964b49b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): lib/hive/agent_support/claude/skills.rb:52-77 | lib/hive/agent_support/codex/skills.rb:59-85 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/agent_support/claude/skills.rb"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"bafba3a90fa7084f67dc1eba4aba386de1e065a56c351bd33b055f24ecf16c8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): lib/hive/daemon/quiescence.rb:49-87 | lib/hive/daemon/quiescence.rb:384-415 \u2014 These two members are one piece of code written twice and then edited apart: 32 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":"lib/hive/daemon/quiescence.rb"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f601a1b40c7bc24baa425c9cc09f7970234ea55814cedcae571a144db1cc2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): lib/hive/stages/brainstorm.rb:22-60 | lib/hive/stages/brainstorm.rb:64-88 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \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":"lib/hive/stages/brainstorm.rb"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca81b6dbe539f441041459f96b82978d04ee6f6012fca93dfe8d42ee193b7c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): packaging/live_agent_skills/workflow_creator_values.rb:141-163 | packaging/live_agent_skills/workflow_creator_values.rb:180-199 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/live_agent_skills/workflow_creator_values.rb"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba8182d274b968f568db577a350ef626be8e7cfa72fd94d1864fb42a755e9c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): lib/hive/stages/finalize.rb:186-210 | lib/hive/stages/plan.rb:193-216 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/finalize.rb"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e010b20b6255090792621d341f42c5dc773605f735476399dd5c87496e5153"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): lib/hive/refactor_patrol/job_query_index.rb:92-124 | lib/hive/refactor_patrol/job_query_index.rb:130-157 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/job_query_index.rb"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f87c6f839918492a31508ba74f0445347865d1d0960fd790d7555a0dc6ac61"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): lib/hive/refactor_patrol/merge_classifier.rb:709-730 | lib/hive/refactor_patrol/scheduled_slice_producer.rb:297-319 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/merge_classifier.rb"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"3372e798669546e5097d127c0dfaa9e1fdee0cbb9bfb7e1d4c2fa560223b0677"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): lib/hive/stages/auto_commit.rb:213-231 | lib/hive/stages/auto_commit.rb:235-253 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/auto_commit.rb"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba7d97b2112638f24a2f7b23b7876b4eb2ace1f0c9cc25f448fc943bea31c66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/hive/module_package/validator.rb:75-86 | lib/hive/workflow_package/validator.rb:113-130 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/module_package/validator.rb"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d283bfa1adfc95886fe764f4778d17398f9bb97be1936503b1228b1144e6b72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): lib/hive/commands/new.rb:595-610 | lib/hive/task_capture.rb:278-293 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \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":"lib/hive/commands/new.rb"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c8a1675a57379d4ee157c090ae9572ee58af2816888cf792933e958a8f1eb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): lib/hive/bot/handlers/callback_handlers.rb:515-538 | lib/hive/bot/handlers/slash_handlers.rb:513-538 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/bot/handlers/callback_handlers.rb"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"8089570fd34c6e54aabb352be15fa598908fad1dd804a6ea945d133b97f46c13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): lib/hive/daemon/stale_agent_healer.rb:498-536 | lib/hive/daemon/stale_agent_healer.rb:553-579 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/stale_agent_healer.rb"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"2018183b63d3a6ad5c4ed407cfa553dd0e918297d9251870a161b3f4ec4ded18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): lib/hive/plan_review/transition_guard.rb:108-136 | lib/hive/plan_review/transition_guard.rb:149-172 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/plan_review/transition_guard.rb"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"1984e94a21540676ea6a6bd4b3e933ccf8e986757b34f2d19c7f3bc6bce2068b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): lib/hive/stages/patrol_fix/inbox.rb:108-125 | lib/hive/stages/patrol_fix/review.rb:170-188 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/patrol_fix/inbox.rb"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"4527a46d5ef2eb2685808f0030372d5a2e3c324cb6b4d7f467e4471ebf9c9c6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): lib/hive/artifacts/outcome_evidence/store.rb:987-1009 | lib/hive/artifacts/outcome_evidence/store.rb:1032-1051 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/artifacts/outcome_evidence/store.rb"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2fbca34ed6e950b29e8d57908639f924a60f79c88a0f96593387e5c200b77d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): lib/hive/artifacts/outcome_evidence/proof.rb:670-685 | lib/hive/artifacts/outcome_evidence/proof.rb:690-705 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \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":"lib/hive/artifacts/outcome_evidence/proof.rb"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa8b6441372bfd8ae638b5f766547c2164d67cff6b54aa19c8ae7735aa123d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): lib/hive/git_ops.rb:46-63 | lib/hive/git_ops.rb:82-103 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/git_ops.rb"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77a66f0f4ae395d28ccdd23151d34cb7489e22d6c6313ce7108b1ad9e8ed530"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): lib/hive/rebase.rb:561-583 | lib/hive/rebase.rb:587-622 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/rebase.rb"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0fb4c4f5434c93bc075c42083f54e0da9b8e02d259107274a5b39290685812"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/hive/bot/handlers/free_text_handler.rb:74-84 | lib/hive/bot/router.rb:297-308 \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":"lib/hive/bot/handlers/free_text_handler.rb"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"db916683188c9cb4e51ee1e506140bf725afdf7cbf7f3451b6a681be8476909c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lib/hive/patrol/reviewer.rb:85-101 | lib/hive/refactor_patrol/reviewer.rb:100-121 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol/reviewer.rb"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"b451aace63afe53918529a27e15fd479b7ba33c3daa894cd4fae1c2be707d642"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): lib/hive/babysitter/logger.rb:78-112 | lib/hive/bot/logger.rb:168-189 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/babysitter/logger.rb"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"119b097ffd43376964553f81368a36e6604227d9470ce22f5a04e64e8d2e4ac4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): lib/hive/commands/approve.rb:693-711 | lib/hive/commands/decide.rb:47-75 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/approve.rb"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"0402f7abb5d01ee490ec741c266275d1c899dc5a97ddad1aaeeb20ed8c2c8565"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lib/hive/daemon/dispatcher.rb:5023-5039 | lib/hive/daemon/dispatcher.rb:5049-5066 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":5023}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a551746a9f1952a48d07112dca47a91725ef48f851e235e0404772f63f15620"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): lib/hive/module_package/catalog_client.rb:115-130 | lib/hive/workflow_package/registry_client.rb:155-172 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \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":"lib/hive/module_package/catalog_client.rb"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"010a26fbcc54c7eb78793f5759e9a855e94faf69ccfc6a632a93181b2ef19406"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): lib/hive/refactor_patrol/job_store.rb:1289-1314 | lib/hive/refactor_patrol/job_store.rb:1323-1346 | lib/hive/refactor_patrol/job_store.rb:1355-1376 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/job_store.rb"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e03ada62c3379edb3e8567b2c954a56226a34191a99fe75bd06fd3b21ad6a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/hive/stages/artifacts.rb:801-810 | lib/hive/stages/artifacts.rb:815-832 \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":"lib/hive/stages/artifacts.rb"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc742045e6c749e045f5f5e008aca0e39cf4f0e5926e724ec41ca73d0b9ae962"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): packaging/live_agent_skills/workflow_creator_installation.rb:105-117 | packaging/live_agent_skills/workflow_creator_openclaw_runtime.rb:131-145 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/live_agent_skills/workflow_creator_installation.rb"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21dc41908e38e1aba82710ba87a9ba4438b8900e90fe18f1da879d862895d70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/hive/runtime_control_plane/task_lease_repository.rb:77-89 | lib/hive/runtime_control_plane/task_lease_repository.rb:93-109 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/runtime_control_plane/task_lease_repository.rb"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d43a4d67234bb85afa3dc09c943d75894bd3a9c4dc1042770e83cf46b68df92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/hive/commands/approve.rb:729-742 | lib/hive/commands/decide.rb:591-606 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/approve.rb"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6510fc100470c0f77652527343bffb5c3469ce2f751b67efcb53b119712d80a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): lib/hive/connection_contexts.rb:212-228 | lib/hive/remote/token_store.rb:154-169 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \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":"lib/hive/connection_contexts.rb"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"678766eda2b36fde64bc6dff32665aaf88e296a28717fab9a06836fe8104c062"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/hive/agent_skills/adapters/openclaw.rb:244-255 | lib/hive/agent_skills/inspector.rb:597-609 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/agent_skills/adapters/openclaw.rb"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3cc7d5d7ce7de255e3b0b341ad63ace7a80927e36821dd1949c0472c66704c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/hive/daemon/status_report.rb:209-219 | lib/hive/runtime_control_plane/lifecycle_repository.rb:185-193 \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":"lib/hive/daemon/status_report.rb"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb096a83db29cd24404f1633efe7b743f9d4a21a96ca7bf2700b244918b65bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): lib/hive/commands/approve.rb:136-158 | lib/hive/commands/stage_action.rb:91-111 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/approve.rb"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"223ed34f4810954458469bfc6859db48510449ce3558960038df32d1e73fc7eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): lib/hive/connection_contexts.rb:194-208 | lib/hive/remote/question_handles.rb:156-171 | lib/hive/remote/token_store.rb:135-150 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/connection_contexts.rb"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4de49522243dde8177293b76b175e7e57ab2942dc149642db5505744442ef06"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/hive/modules/daemon_runtime.rb:34-45 | lib/hive/modules/daemon_runtime.rb:53-65 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/modules/daemon_runtime.rb"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f9c39695c5c95f51e682d877f43bc27c48b6020321316874bdc43a4b0f9fbfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): lib/hive/workflow_package/runtime_policy.rb:287-307 | lib/hive/workflow_package/runtime_policy.rb:407-428 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/workflow_package/runtime_policy.rb"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"2803e1ccef4d362e3ceec09882d054d9ab561caea6b7e42655ea7f9538d4d5d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/hive/commands/init.rb:328-342 | lib/hive/commands/init.rb:440-456 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/init.rb"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"5832df924f299677b80e5ea3f65099a6f0f75e2d7fc49b12485f9629d8a9e9ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/hive/refactor_patrol/job_store.rb:1924-1938 | lib/hive/refactor_patrol/job_store.rb:2146-2158 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/job_store.rb"},"region":{"startLine":1924}}}],"partialFingerprints":{"codehealthFindingId/v1":"43bdf5ea4f7909d2d06d5ddcf7a208a3f025ee00752539aa64562c8b6fc711d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): lib/hive/agent_support/claude/skills.rb:10-20 | lib/hive/agent_support/codex/skills.rb:11-22 | lib/hive/agent_support/grok/skills.rb:10-22 | lib/hive/agent_support/muse/skills.rb:16-30 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/agent_support/claude/skills.rb"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85dba65ca9e86fde18c67ef718a93300f347524b0a4df95f72ff98ca9244631"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/hive/agent_support/muse/skills.rb:34-43 | lib/hive/agent_support/opencode/skills.rb:68-81 \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":"lib/hive/agent_support/muse/skills.rb"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"4528380d3e612b38403993d89f4ae3f6b1e79531fdb4c40f7be06b112c65febe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): lib/hive/pid_file.rb:196-214 | lib/hive/running_status.rb:212-230 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/pid_file.rb"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e65d4c84eb1a1a63a58c2c6f53d0903314ea7055c264f5ac9697eade88a61c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): lib/hive/runtime_control_plane/codec.rb:50-73 | lib/hive/workflow_package/canonical_json.rb:18-38 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/runtime_control_plane/codec.rb"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"226d45b6ac2e54e7e08d988ea42e1c981c6851c4c0d85333477603b0b7b968b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/hive/daemon/dispatch_baselines.rb:179-191 | lib/hive/update_check/state.rb:230-248 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/dispatch_baselines.rb"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"2626d86c6ae6eb76ca58d67a402770c43c2196359dae65d470d5495d7c5d3323"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): lib/hive/bot/alert_store.rb:310-325 | lib/hive/update_check/state.rb:252-270 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \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":"lib/hive/bot/alert_store.rb"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"1810b292fd2a2ab602ba6033c5d36ea472cc251f95b51be2decd85408fd4aae0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/hive/daemon/refactor_patrol_merge_reconciler.rb:356-366 | lib/hive/daemon/refactor_patrol_scheduler.rb:643-656 \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":"lib/hive/daemon/refactor_patrol_merge_reconciler.rb"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"09aef70cc8dad0cec4a8c5a1a8e0ea9de644b386d103ac0281ba5b058eccfac0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/hive/atomic_file.rb:19-33 | lib/hive/atomic_file.rb:41-58 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/atomic_file.rb"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eaad34443d746568a67d9c56a6127d97fa76cab9657b56b848ebca661cfd4ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/hive/attempts/reconciler.rb:414-425 | lib/hive/conditions/attempt_observer.rb:161-174 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/attempts/reconciler.rb"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"893f4a8f7aa38e8a7e20c1b8a913e47263576b234b16a064107114841989e87b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): lib/hive/daemon/refactor_patrol_merge_progress_store.rb:135-157 | lib/hive/daemon/refactor_patrol_merge_reconciler.rb:777-801 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/refactor_patrol_merge_progress_store.rb"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b1cafd00a5b87593e529835e070a0f87fca97c072235947e4d15868bdd33ec2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): lib/hive/refactor_patrol/claim_transitions.rb:12-31 | lib/hive/refactor_patrol/claim_transitions.rb:36-54 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/claim_transitions.rb"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4885ab8f78ccb38a6d3ae403a6c933f27a37915cdfc23f9310c6d134975ef7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/hive/refactor_patrol/merge_classifier.rb:177-189 | lib/hive/refactor_patrol/post_merge_batch_store.rb:197-207 \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":"lib/hive/refactor_patrol/merge_classifier.rb"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"06197d47a3d3aa64652ed3b2b34fe14a1f5fae24d0c86cb8926eb26a271a5292"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): lib/hive/stages/council/reviewer.rb:131-148 | lib/hive/stages/council/revise.rb:108-123 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \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":"lib/hive/stages/council/reviewer.rb"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"27cb90d1b840dc8d0a95949d6dc7d3fb4865b6646aaaa2ba97bd5f061eaed341"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/hive/stages/review.rb:2555-2568 | lib/hive/stages/review/ci_fix.rb:456-469 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/review.rb"},"region":{"startLine":2555}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba7703f319b73405ad7baea40ff039b9a1e6a8c14aae77ff732dc8204d1dc28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): packaging/live_agent_skills/release_selector.rb:86-101 | packaging/release_candidate/release_selector.rb:141-160 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \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":"packaging/live_agent_skills/release_selector.rb"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f223f9261802df44004d5b64b9ce796006f9ef4e7264cccfb41937942e1fee5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/hive/artifacts/capture_mailbox.rb:130-141 | lib/hive/commands/evidence.rb:200-211 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/artifacts/capture_mailbox.rb"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a1af1b9ac14f4d1163caf1e26667928b0403c4928d58048e84bf920b10f2e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/hive/command_operation.rb:65-72 | lib/hive/command_operation.rb:76-87 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/command_operation.rb"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"59861b0ad3a6ae4fbcbc5df06ef12aaa9d2b402a5167c20a8bb11771d6d9ed66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/hive/proposals/producer.rb:77-90 | lib/hive/proposals/producer.rb:95-109 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/proposals/producer.rb"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b1fa5b5161c3cb188db7ffa10b8a2015a2ca9d1034eb3afd4d4be52853767a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/hive/module_package/catalog_client.rb:272-283 | lib/hive/workflow_package/registry_client.rb:315-329 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/module_package/catalog_client.rb"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fbe0c9c074442b3c099cc0448114ae7d5b0c1bbddde61b881a8b4842636d064"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/hive/daily_digest/delivery_ledger.rb:305-318 | lib/hive/daily_digest/store.rb:424-442 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daily_digest/delivery_ledger.rb"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d0c4c9fc4eb9cf7a8f4618e11682231ce667fbba46f7b64439dcf20fb85628"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/hive/daemon/child_supervisor.rb:149-176 | lib/hive/daemon/child_supervisor.rb:195-202 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/child_supervisor.rb"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"151ce658ffbea20e835468b127c9e2da4d25bc25aa8fe0d13bc9e11764a7abb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/hive/stages/finalize.rb:554-567 | lib/hive/stages/open_pr.rb:242-256 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/finalize.rb"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c81709ed83e99a7965913a36876291030be27a43a2cd4287c74dac46550066f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/hive/task_action.rb:1152-1161 | lib/hive/task_action/diagnostic.rb:456-470 \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":"lib/hive/task_action.rb"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ab019803d453f93a3710732ba56ad6a36303a8cf790dc353197cd35b8906a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/hive/tui/clipboard.rb:129-143 | lib/hive/tui/clipboard.rb:147-161 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/tui/clipboard.rb"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"901715a78cd1c011a9414b81cc909a952e2e31ce1390ab495ef58ab33267cc84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/hive/daemon/patrol_fix_semantic_decision_runner.rb:137-143 | lib/hive/refactor_patrol/merge_classifier_runner.rb:95-102 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/patrol_fix_semantic_decision_runner.rb"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"8562bf3879536d7d51535c94cb28db0b8fa42ed7b443c0ba4d423390533a3398"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/hive/implementation_identity/resolver.rb:307-324 | lib/hive/refactor_patrol/agent_identity.rb:107-121 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/implementation_identity/resolver.rb"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6072f682590f2e33796098f37072d7cd40b8b8414765bb7a0dd815518b75576"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/hive/babysitter/gh_ops.rb:180-190 | lib/hive/babysitter/gh_ops.rb:199-215 \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":"lib/hive/babysitter/gh_ops.rb"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"639739f86de8b5f9e65ce5c3c12f37271d6ffcf049eccd8838a7ed0cea9e0cb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): lib/hive/web/status_feed.rb:200-223 | lib/hive/web/status_feed.rb:428-448 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/web/status_feed.rb"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9bba14cde01ff748325d19bb947d823a9d8d255d54fd4e4638b65e8edfe4c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lib/hive/refactor_patrol/pr_manifest_resolver.rb:47-63 | lib/hive/refactor_patrol/pr_manifest_resolver.rb:67-85 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/pr_manifest_resolver.rb"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5d3f05d2cb54a003d696dab04ad59d76042d6d6518123eda5115179824e6da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/hive/task_workspace/dependency_component.rb:559-570 | lib/hive/task_workspace/dependency_component.rb:574-584 \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":"lib/hive/task_workspace/dependency_component.rb"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf9bdf55cf0b13ee176ef76726a062eaf69c89d7cf0d975116858658b1dc2f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): lib/hive/completion_time.rb:117-135 | lib/hive/task_meta.rb:651-676 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/completion_time.rb"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9a33cc99653b4e04bd8917e9fa8b071f571ca186a8c6f67f2ec230e379c8f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/hive/proposals/source_event_store.rb:534-544 | lib/hive/proposals/store.rb:600-616 \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":"lib/hive/proposals/source_event_store.rb"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"585b1f52b4391e614dde9c3b8c456772ee5321c7d59948b534c83d024fce3ef4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/hive/daemon/finalization_proof.rb:95-105 | lib/hive/runtime_control_plane/quiescence_upgrade.rb:126-136 \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":"lib/hive/daemon/finalization_proof.rb"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b451118fdcad4dc4cc97bd0901f8baf333c6ea3c484319422d3f71149943b01"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): lib/hive/user_service/applied_receipt.rb:32-42 | lib/hive/user_service/transaction_journal.rb:86-97 | lib/hive/user_service/transaction_journal.rb:239-255 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/user_service/applied_receipt.rb"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17908649c1ca2c2cf50ed332cd7b2a8dc0d725abe8cf10ba283cda537fbc14e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lib/hive/web/project_capture_provider.rb:396-415 | lib/hive/web/project_capture_provider.rb:490-506 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/web/project_capture_provider.rb"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e8200705e920597b4b5fb3a4d330947df834d198820b310f7f3d8684c54ff9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): lib/hive/babysitter/logger.rb:40-64 | lib/hive/daemon/logger.rb:136-156 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/babysitter/logger.rb"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"019cea452d902692668945bc5fe3a2fbc311efedef5744e7c43879b8c0b4d968"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): lib/hive/bot/handlers/slash_handlers.rb:262-270 | lib/hive/bot/handlers/slash_handlers.rb:274-282 | lib/hive/bot/handlers/slash_handlers.rb:354-360 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/bot/handlers/slash_handlers.rb"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"29edfb80ca96050eb5c1ab01e889991dd7cde8f6aa82bd315652e86fff236660"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): components/agent-cli-runtime/lib/agent_cli_runtime/opencode/overlay.rb:379-390 | components/agent-cli-runtime/lib/agent_cli_runtime/opencode/overlay.rb:395-406 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"components/agent-cli-runtime/lib/agent_cli_runtime/opencode/overlay.rb"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"802cec35f491385385d94a645c48b96e5f6ac3af6e145aa439681053e6921953"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): lib/hive/commands/digest.rb:40-62 | lib/hive/commands/digest_send.rb:23-40 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/digest.rb"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee165669dcbcc465bc0f609d76d8fe653b88dd1185c318a5c06fc991454e67a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lib/hive/commands/watch.rb:639-655 | lib/hive/commands/watch.rb:659-675 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/watch.rb"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1a56a208edf929fa8aaaf186e044762c15d5308931794d32ae88de8b4d0656"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): packaging/live_agent_skills/workflow_creator_live_runner.rb:688-694 | packaging/live_agent_skills/workflow_creator_live_setup.rb:440-449 | packaging/live_agent_skills/workflow_creator_live_setup.rb:667-673 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/live_agent_skills/workflow_creator_live_runner.rb"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1c288736034ff3118d8662cc4f0a81071328da96255087f0d1ea10651e9fae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/hive/bot/child_supervisor.rb:206-215 | lib/hive/daemon/child_supervisor.rb:605-618 \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":"lib/hive/bot/child_supervisor.rb"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67e41a91ced5845e7f36a756ed7191f152fb8fee0a9eb380c50b14394dd55bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): lib/hive/conditions/execute_boundary.rb:22-34 | lib/hive/implementation_identity/reconstructor.rb:14-24 | lib/hive/implementation_identity/store.rb:17-28 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/conditions/execute_boundary.rb"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"584778f348f7b7525bb8b9f20af709f0537acc6c5a07e13ca3f6cbe8094a435b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): lib/hive/canonical_json.rb:18-32 | lib/hive/config.rb:2176-2184 | lib/hive/daemon/operational_snapshot.rb:582-591 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/canonical_json.rb"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b132acfb8a57754bcdabd2df4e20672d8ca226eccd2644a315474162cc2b577"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/hive/stages/draft_pr_handoff.rb:599-607 | lib/hive/stages/draft_pr_handoff.rb:628-635 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/draft_pr_handoff.rb"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"aebf0aaf64086c93c21f36b5af91300f4618579218c1a8f1b649b482621f87df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): lib/hive/tui/bubble_model.rb:1305-1325 | lib/hive/tui/bubble_model.rb:1682-1700 | lib/hive/tui/bubble_model.rb:1722-1753 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/tui/bubble_model.rb"},"region":{"startLine":1305}}}],"partialFingerprints":{"codehealthFindingId/v1":"32541f970c6b412942b23847b5f58dee1595985e7e7b7252694086c4e62934be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/hive/stages/base.rb:744-758 | lib/hive/stages/review.rb:3279-3291 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/base.rb"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b7311124444787593e25890f831e05fdf73f5e63b70e6be90d572476c57bba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/hive/artifacts/outcome_evidence/store.rb:383-394 | lib/hive/artifacts/outcome_evidence/store.rb:589-601 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/artifacts/outcome_evidence/store.rb"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b0595fae0754d2467445acf40421140304279ea980286eaee746e98f2f6549"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lib/hive/cli.rb:1953-1958 | lib/hive/cli.rb:1976-1981 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/cli.rb"},"region":{"startLine":1953}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3142f2dabcc1e4ff9cecc8433f5ca91f272053fb24ce412d28b7fb48dff7b82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): lib/hive/gh.rb:351-361 | lib/hive/gh.rb:489-517 | lib/hive/gh.rb:596-609 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/gh.rb"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f654889b2cd5981579078dafad09446977470f5df22aa49a1a705896eac2d14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lib/hive/stages/council.rb:152-158 | lib/hive/stages/council.rb:165-168 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/council.rb"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"4059b9133636b450c7a04daead26df20ccc7e2ecac2db4b9135a49bdd63ae39e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/hive/artifacts/capture_policy.rb:298-308 | lib/hive/web/capture_runtime.rb:399-408 \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":"lib/hive/artifacts/capture_policy.rb"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"e54f9730c7173e36e64638c6502288cf7d5568a143fee61d9969391ac6e5d63a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): lib/hive/cli_usage_contracts.rb:148-167 | lib/hive/cli_usage_contracts.rb:171-193 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/cli_usage_contracts.rb"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c0affe3a725c6456dfff592e8d080083a406704ff60bcabc2a7cf7f301b39d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/hive/command_dispatch_lifecycle.rb:101-113 | lib/hive/command_dispatch_lifecycle.rb:117-126 \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":"lib/hive/command_dispatch_lifecycle.rb"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"333106b538cec3c98c58563fe657050db5af1f0b2cf1076240007636a4ba80ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/hive/commands/setup.rb:303-312 | lib/hive/commands/setup.rb:345-357 \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":"lib/hive/commands/setup.rb"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"c782779f6feea1c8a21cd95ea4a51f84be80a5c52d62a3cd79ee13be95108c41"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/hive/tui/update.rb:712-720 | lib/hive/tui/update.rb:724-732 \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":"lib/hive/tui/update.rb"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dae7fd5e5679270f59d2ce8c7bba65cf8f4096d31bf7a0b3067cf9434c1ecf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lib/hive/web/project_capture_provider.rb:888-902 | packaging/live_agent_skills/workflow_creator_process_supervisor.rb:268-273 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/web/project_capture_provider.rb"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d3454d236de0bea2c80ef2cb8b5ad335ff61efab7c84e2cc1a4e87308a708c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 14\u002B corresponding lines): lib/hive/config.rb:1578-1595 | lib/hive/config.rb:1603-1616 | lib/hive/config.rb:1625-1639 | lib/hive/config.rb:1677-1690 | lib/hive/config.rb:1694-1708 | lib/hive/config.rb:1747-1761 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/config.rb"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb30b53949f225afb190412deecc11fab7b43dd4db78a451e9876a2bb4835419"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): lib/hive/stages/patrol_fix/fix.rb:215-222 | lib/hive/stages/patrol_fix/inbox.rb:150-160 | lib/hive/stages/patrol_fix/review.rb:233-243 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/patrol_fix/fix.rb"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e36f93b4ab96ddae1403ca0fcdccfda471858ae28dee357a9b68948b2ed67b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/hive/bot/waiting_rows.rb:115-127 | lib/hive/bot/waiting_rows.rb:131-142 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/bot/waiting_rows.rb"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"916ab094c2cc82ba40a5bbe86a9c2ce27e3b326c9b6eee9bad63fb2287f20819"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): lib/hive/commands/receipt.rb:24-44 | lib/hive/task_workspace/builder.rb:42-63 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/receipt.rb"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"420785ab91c5373e8c0791f9a338c6e2d2ca39729e0da059bcfaa2cb4857b701"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/hive/proposals/store.rb:160-171 | lib/hive/proposals/store.rb:175-185 \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":"lib/hive/proposals/store.rb"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c555ac70ab6ffbfea828be4ef86a57cf63c65234d7d6d5791f276cb462ca7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/hive/runtime_control_plane/dispatch_repository.rb:251-257 | lib/hive/runtime_control_plane/dispatch_repository.rb:374-380 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/runtime_control_plane/dispatch_repository.rb"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"5169c1c86552383e8ab648a01048b1b994d12dfd39f82fccfcb72857f4c83488"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): packaging/live_agent_skills/build.rb:8-19 | packaging/live_agent_skills/verify_candidate.rb:9-22 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/live_agent_skills/build.rb"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"11952837b90d9ea18cfba0838286073f7b7c2567517d938b8528dba991b354fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/hive/bot/supervisor.rb:485-500 | lib/hive/bot/supervisor.rb:1028-1035 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/bot/supervisor.rb"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e1f1f43866c59c6d7879d1e5c61fe44945b40d493ffe9f21699e0c9f4d7515"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/hive/commands/run.rb:198-207 | lib/hive/stages/base.rb:567-576 \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":"lib/hive/commands/run.rb"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c38df715cef2c1ed31c2b23a1d6e8df9a21b0aa3844a52c123258ff14dbd04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/hive/llm_wiki_bootstrap.rb:216-225 | lib/hive/llm_wiki_bootstrap/scheduler.rb:280-292 \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":"lib/hive/llm_wiki_bootstrap.rb"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"20967b7c98d345e96a437e4106217f4e38e09d1c4b30c7557fdaa1191f7cb80c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/hive/stages/auto_commit.rb:98-104 | lib/hive/stages/auto_commit.rb:114-121 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/auto_commit.rb"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b43395429ef726fd17b86289189dfc18186bac82eb685d795e6cc600bff4a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/hive/bot/handlers/callback_handlers.rb:341-349 | lib/hive/bot/handlers/slash_handlers.rb:454-465 \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":"lib/hive/bot/handlers/callback_handlers.rb"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9268985fe9e9d275ccbbf50f1847dd0107f45fbf4a4c04f5f3fdb92f2383fc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/hive/commands/patrol.rb:65-74 | lib/hive/commands/refactor_patrol.rb:202-214 \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":"lib/hive/commands/patrol.rb"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"808c9d0e0d1b92307e310e243e8cb6de61451b6ad5bd29a62f7f707bc5602bc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/hive/gh.rb:1032-1044 | lib/hive/task_workspace/publication.rb:607-619 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/gh.rb"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce4ea78e3e9b3ea1ad8e171dba3ba9f2972745be063815b0d69769d5921e0f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/hive/github_publication.rb:286-293 | lib/hive/patrol_fix/publication_receipt.rb:112-120 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/github_publication.rb"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a0f950bbfbd253440aef6e96d7131e88502abee574b91d8f452bdae0b6e22e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/hive/proposals/config_validator.rb:38-48 | lib/hive/proposals/config_validator.rb:52-62 \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":"lib/hive/proposals/config_validator.rb"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"0962367f0b1f0b695e3865a65c5e97dc653ab09a04af23b0bbfe0f70c248e86f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/hive/workflow_package/managed_store.rb:140-152 | lib/hive/workflow_package/managed_store.rb:163-173 \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":"lib/hive/workflow_package/managed_store.rb"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"49faf56521b1951a6418fb5815b90e4d526e15739c22a43de232e0cd86e7fc5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/hive/daemon/refactor_patrol_merge_reconciler.rb:834-840 | lib/hive/daemon/refactor_patrol_merge_reconciler.rb:844-850 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/refactor_patrol_merge_reconciler.rb"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"04367c48469deadd7182b78d5d81c823fe603cfbe5aa639df07d5f995088f7eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lib/hive/module_package/manifest.rb:245-250 | lib/hive/workflow_package/registry_manifest.rb:125-133 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/module_package/manifest.rb"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"149a43680f43fc3fd44f7df757cd37896d0f13bbec0d8a71f1daeec5dc1a8095"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/hive/modules/decision_journal.rb:184-191 | lib/hive/modules/event_ledger.rb:311-319 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/modules/decision_journal.rb"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b87bda954084b4d23427b613c0883df9b29d3f8b1e1f4677c9ba39b790dc7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): lib/hive/patrol_fix/receipt_store.rb:340-343 | lib/hive/patrol_fix/source_snapshot.rb:193-196 | lib/hive/patrol_fix/task_manifest.rb:235-239 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol_fix/receipt_store.rb"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3181ea939628f12b1c54b47fc2cb502cba85606e75065e5d558094e9267b16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/hive/artifacts/capture_toolkit.rb:589-603 | lib/hive/artifacts/outcome_evidence/proof.rb:418-431 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/artifacts/capture_toolkit.rb"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"77108fbbd2bae4df6aa461dbd2ed7b3b47f9d02c40ec2655ac8e6fcb078039a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/hive/commands/module/lifecycle.rb:263-275 | lib/hive/commands/module/state_change.rb:116-126 \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":"lib/hive/commands/module/lifecycle.rb"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f18abb4e358e61683598fc1cda496802fe5d629f210487dffb751eb8bcf231"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): lib/hive/babysitter/logger.rb:26-36 | lib/hive/bot/logger.rb:97-107 | lib/hive/daemon/logger.rb:121-132 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/babysitter/logger.rb"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d663347fbe4b7dca8e69ea8f4ff342d4156b9b9706da7dc8b37c54a4871456"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/hive/commands/answer_digest.rb:410-424 | lib/hive/commands/pairing.rb:272-281 \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":"lib/hive/commands/answer_digest.rb"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"52fc30f435a02130dfb55d65cda4493110807dac0474c69e6b0323accfc20b2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/hive/commands/daemon.rb:1497-1510 | lib/hive/commands/runtime.rb:118-127 \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":"lib/hive/commands/daemon.rb"},"region":{"startLine":1497}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1dbbef526106b46d23c7d9d862541763b36f47f7a1d359ee6b762c32e52832"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/hive/commands/init/prompts.rb:421-435 | lib/hive/commands/init/prompts.rb:447-461 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/init/prompts.rb"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc751042a3cca1960f26c22cab7c1fc7e82230820c8681ecd958906407b34d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/hive/module_package/manifest.rb:103-109 | lib/hive/workflow_package/registry_manifest.rb:82-88 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/module_package/manifest.rb"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ebd6201c89d801d8e9dbcb15a0046939a5b7b63241088fe3ac73cf692a631d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/hive/module_package/semantic_diff.rb:92-98 | lib/hive/workflow_package/semantic_diff.rb:119-123 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/module_package/semantic_diff.rb"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f4d36775a4a7cb6ad5a1a5a56d5dc76689050b80b07f98ceb827e6c8bee54c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): lib/hive/patrol_fix/admission_store.rb:187-197 | lib/hive/patrol_fix/admission_store.rb:201-214 | lib/hive/patrol_fix/admission_store.rb:218-231 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol_fix/admission_store.rb"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"f365594f57c6c47c9d2435e26ade42af912300b394650ca85dafe29a150711d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/hive/tui/bubble_model.rb:903-907 | lib/hive/tui/bubble_model.rb:1054-1058 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/tui/bubble_model.rb"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"d116d6f717ec8a0e443be5e13d5abbaf9e38ea74636f4ad3577bb5599077680a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/hive/user_service/transaction.rb:330-340 | lib/hive/user_service/transaction.rb:344-351 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/user_service/transaction.rb"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"feded5de3bd6c38a068c9f35f181e5c51ff1d0809fe7d8b6079e6a3782737d17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/hive/modules/event_ledger.rb:100-111 | lib/hive/modules/event_ledger.rb:117-127 \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":"lib/hive/modules/event_ledger.rb"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"113d423a614c7e31581692513252d8e984348cfa37bfb560eddb1a8bc2e9bc24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 5\u002B corresponding lines): lib/hive/daemon/operational_snapshot.rb:559-563 | lib/hive/daemon/recovery_coordinator.rb:137-142 | lib/hive/daemon/recovery_coordinator.rb:1885-1890 | lib/hive/recovery/api.rb:179-184 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/operational_snapshot.rb"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcad34bc09883da3bacb1ec87ec0ddd96fdd7dd9b7a8b115e930c58eebe34f10"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/hive/git_ops.rb:489-493 | lib/hive/stages/review/fix_guardrail.rb:109-122 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/git_ops.rb"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a282248d79349293032ba21382a3c6798f455c19f159570bca38685cf527c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/hive/github_publication.rb:662-670 | lib/hive/github_publication.rb:856-862 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/github_publication.rb"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d619ba6ad8f9339819900257f8e6ec03e25aa693007c415bf93f122dd32ad2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/hive/plan_review/transition_guard.rb:237-246 | lib/hive/plan_review/orchestrator.rb:1503-1510 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/plan_review/transition_guard.rb"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ae858fe2349d49f72ebd7aba228fc37e88031670c85ecbf7bd961c5376cdc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/hive/stages/agent_report.rb:220-227 | lib/hive/stages/draft_pr_handoff.rb:680-688 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/agent_report.rb"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa0cfa28c47def36d62c9bae66f5c1a083327547fcddc706c50beb1fbadca70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lib/hive/task_capture.rb:256-265 | lib/hive/commands/new.rb:575-580 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_capture.rb"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8d178eec0ee7de289c64180467e819ccccca9e1477a19ae7c28785c5a51904"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/hive/artifacts/managed_project_server.rb:176-182 | lib/hive/commands/web/capture_server.rb:175-184 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/artifacts/managed_project_server.rb"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de126f8a53c4a97059f5cdfd5d27450af55732de66115f7deaea47f49eba17e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/hive/runtime_control_plane/lifecycle_repository.rb:67-78 | lib/hive/runtime_control_plane/lifecycle_repository.rb:101-113 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/runtime_control_plane/lifecycle_repository.rb"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"7709cd1f0bac0ac1a01efb4d9d37db68d42c00625dae7ae9a3ecec187e73265f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/hive/task_workspace/bounded_reader.rb:124-131 | lib/hive/task_workspace/jsonl_reader.rb:158-165 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_workspace/bounded_reader.rb"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6800ddfd99ee827dec4631e271852bdf24565f8dce0e89a980edefec046a6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): components/agent-cli-runtime/lib/agent_cli_runtime/profile.rb:489-495 | lib/hive/agent_skills/command_runner.rb:90-96 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"components/agent-cli-runtime/lib/agent_cli_runtime/profile.rb"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27048c0e93961b94de03e73cbf5f5a836adbdcce3dc3e0e0db1ca50587dda77"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lib/hive/artifacts/runtime_residue_recovery.rb:221-226 | packaging/release_candidate/baseline_cache_materializer.rb:211-216 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/artifacts/runtime_residue_recovery.rb"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6ec27a018625283dce519c5ca6842d5dd5162af204597012def2604b45203d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/hive/refactor_patrol/checkout_guard.rb:75-89 | lib/hive/stages/managed_agent_custody.rb:351-357 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/checkout_guard.rb"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78af4af38df32e74a74bb977dde94e66ae9ae68407923a9a4606e436a968c58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): packaging/release_candidate/local_attempt.rb:30-40 | packaging/release_candidate/local_attempt.rb:44-52 \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":"packaging/release_candidate/local_attempt.rb"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a380756845354c9445c3dcfe6d1f727b1da7be255cd25e33089d6c38d91c8a02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lib/hive/patrol/state_store.rb:209-214 | lib/hive/stages/patrol_fix/publish.rb:282-285 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol/state_store.rb"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"163bfca7c1ad30458e971066a1c50e9c4564a57c1a60d9bb6cc51637aa50c3d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): lib/hive/stages/review/remote_ci.rb:492-501 | templates/builtins/bench/runtime/harness/lib/hive_driver.rb:543-545 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/review/remote_ci.rb"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"086b21b5f02521129210fba1199933eb2e70ffbe098a3a38c93280a3718c8e4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/hive/diagnostic_evidence.rb:157-174 | lib/hive/task_action/diagnostic.rb:291-295 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/diagnostic_evidence.rb"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"58cdfe6cbc0c2e99140b870a37622066dbc84b6043a1ae267bf60f85b44277db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/hive/commands/workflow/update.rb:17-25 | lib/hive/commands/workflow/install.rb:15-24 \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":"lib/hive/commands/workflow/update.rb"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6679049a4f3c1beaf5e9e62a14e49c06185dd3692705b43c292b01e8135f5f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): lib/hive/module_package/manifest.rb:260-264 | lib/hive/workflow_package/authoring_metadata.rb:137-145 | lib/hive/workflow_package/registry_manifest.rb:142-146 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/module_package/manifest.rb"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"55906c25c956cb09d5c66d8924b9e6db6f43927f725fd10307bd67aa73aab283"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): lib/hive/attempts/dispatcher.rb:881-890 | lib/hive/bot/dispatch_request_writer.rb:234-238 | lib/hive/daemon/dispatcher.rb:4486-4492 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/attempts/dispatcher.rb"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82202e09bf6c95d0f6d7150b017dadf3d108f8585e5f949225f12f67128c24b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/hive/daemon/patrol_fix_semantic_decision_runner.rb:32-41 | lib/hive/refactor_patrol/review_agent_runner.rb:26-34 \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":"lib/hive/daemon/patrol_fix_semantic_decision_runner.rb"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3bbea726b09aecf280ab95b67ecb877579f20ecbb0306c3bba457b3c3172e70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/hive/tui/bubble_model.rb:2717-2731 | lib/hive/tui/update.rb:750-762 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/tui/bubble_model.rb"},"region":{"startLine":2717}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e2c912d1cc65a00ef3b5efd16d1cf826209b91213de4aaa5898aa08ca86aad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): packaging/release_candidate/installed_target.rb:68-75 | packaging/release_candidate/process_teardown.rb:120-127 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/release_candidate/installed_target.rb"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8814372a2327686d680698545dbb423acf3e0949a786e42c7624d40f0c8ed9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): lib/hive/context_provenance/context_receipt.rb:204-207 | lib/hive/task_journal.rb:173-175 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/context_provenance/context_receipt.rb"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"c691bc06c58b3abdb2ddcc12d61977e140ba227d5f7dd833dad57bc262c85be4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lib/hive/plan_review/finding.rb:109-115 | lib/hive/plan_review/orchestrator.rb:1531-1536 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/plan_review/finding.rb"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"900b3fad2ed51552b6e4aac8fcdfc48009ce283131d36773b470667543e9e397"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/hive/babysitter/dry_run_env.rb:208-212 | lib/hive/llm_wiki_bootstrap/scheduler.rb:360-364 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/babysitter/dry_run_env.rb"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"712a89c0f9e1c9fe57a1db035733e6d358f93b3444cf78a1ed93aeb4e9dad14c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/hive/commands/act.rb:187-196 | lib/hive/operational_action.rb:401-407 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/act.rb"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"550562ff57bde58b5d287f9286a252789004a7230b5caa6c072f0509f41b4fb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lib/hive/daemon/patrol_scheduler.rb:375-381 | lib/hive/daemon/scheduled_architecture_scheduler.rb:111-114 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/patrol_scheduler.rb"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"13fbc54897ee990835703010c0b002636f644403e522aa40854de893e281c343"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/hive/web/browser_bundle.rb:88-94 | lib/hive/web/source_bundle.rb:78-86 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/web/browser_bundle.rb"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b9d06317eeb4141906324b2c3cbcf531ee24df1713cd71eddfdf8b698fb2350"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/hive/artifacts/capture_toolkit.rb:526-537 | lib/hive/artifacts/project_command_sandbox.rb:43-56 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/artifacts/capture_toolkit.rb"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c284697c204fcc958a8b8d6d843b12a866f878b9d30c196aac681eff2f20e2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): lib/hive/attempts/log_archive.rb:237-240 | lib/hive/attempts/repository.rb:708-710 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/attempts/log_archive.rb"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fab670c0f63ec3662d0ee3edcf4827e81224a932bb9e56588d493a1109a6290"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/hive/modules/decision_journal.rb:30-39 | lib/hive/modules/event_ledger.rb:33-40 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/modules/decision_journal.rb"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4507da4134e3704739f87980beb9fdb3409998235bb594a3e49f1754a0ce7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/hive/refactor_patrol/github_gateway.rb:281-286 | lib/hive/refactor_patrol/merge_classifier.rb:843-847 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/github_gateway.rb"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"583cfbf96fb49790fa0d0159f8d5359795835b9455594d7f7129ab75d405ee6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): lib/hive/agent_support/claude.rb:24-27 | lib/hive/agent_support/grok.rb:27-31 | lib/hive/agent_support/muse.rb:39-44 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/agent_support/claude.rb"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f208e6a6fe8bf53f9d9f33004f1c379b996d11514c131e1e6e77d4599333e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/hive/commands/module/base.rb:78-87 | lib/hive/commands/module/dry_run.rb:47-54 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/module/base.rb"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b089f697ba134f18775419c26f4682f62ad9e9248055c4e02ba043d5a43db8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lib/hive/daemon/patrol_fix_semantic_decision_runner.rb:106-111 | lib/hive/stages/patrol_fix/inbox.rb:66-71 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/patrol_fix_semantic_decision_runner.rb"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4611e6a8cb0f187d8de9d9170e89714cea584b858e184fb4b987d088aa5808"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): lib/hive/diagnostic_evidence.rb:368-372 | lib/hive/task_action/diagnostic.rb:641-643 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/diagnostic_evidence.rb"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f74790684ca0b9d06b2adae15e5a639b99d0b66c72d77c09eaa4b092f483d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): lib/hive/runtime_control_plane/command_schema.rb:57-59 | lib/hive/runtime_control_plane/database.rb:1168-1170 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/runtime_control_plane/command_schema.rb"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"3279ada591e5defd31dfb81a6fb1ba43461686a6963d1f1c0e90a9b4cd103083"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/hive/attempts/finalization_maintenance.rb:312-316 | lib/hive/attempts/pending_bookkeeping.rb:219-223 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/attempts/finalization_maintenance.rb"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"635a70f8ac1970e8a10b97b690984526b2f3e050b0532ed323abf410b8b60e3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): lib/hive/refactor_patrol/job_record_validator.rb:1234-1241 | lib/hive/refactor_patrol/merge_classifier.rb:864-868 | packaging/release_candidate/evidence.rb:307-314 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/job_record_validator.rb"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a3b2700389940da11ddcb45da9c64ad3ef40e4415743e871eea043c2c3c306"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/hive/refactor_patrol/reviewer.rb:134-146 | lib/hive/patrol/reviewer.rb:123-133 \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":"lib/hive/refactor_patrol/reviewer.rb"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1238df312b55ba9391b08dfe909612dfdf926b8755a425b2c2d6afa5cb3d94"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): lib/hive/attempts/pending_bookkeeping.rb:214-215 | lib/hive/runtime_control_plane/payload_store.rb:312-313 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"lib/hive/attempts/pending_bookkeeping.rb"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f3063a2dc75f10791363b87200eaeb89deddf00abf995b15bc24f080ef6a27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 1\u002B corresponding lines): lib/hive/commands/module/base.rb:203-203 | lib/hive/commands/workflow/publish.rb:203-204 | lib/hive/module_package/manifest.rb:282-283 | lib/hive/module_package/preview.rb:140-140 | lib/hive/module_package/validator.rb:115-115 | lib/hive/workflow_package/lint_policy.rb:123-124 | lib/hive/workflow_package/publish_store.rb:274-275 | lib/hive/workflow_package/registry_manifest.rb:150-151 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/module/base.rb"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"cacbd1900b6db36f7252154b66ad57fe38856ff148da6ff7ffc4de9cc6085ead"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): packaging/release_candidate/baseline_cache_materializer.rb:134-146 | packaging/release_candidate/hosted_stage.rb:366-373 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/release_candidate/baseline_cache_materializer.rb"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0105bd1b76493c194ba885a80d899f27ce598eeb32fad96b21a92be877ecf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/hive/agent_skills/provisioner.rb:229-233 | lib/hive/context_provenance.rb:460-464 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/agent_skills/provisioner.rb"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"366143f1675aa63a7dbb796fc4c4026ad4d71e82bbc08b419f24373fa6c52eda"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lib/hive/attempts/coordination.rb:147-152 | lib/hive/patrol_fix/attempt_diagnostic.rb:343-348 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/attempts/coordination.rb"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36d806d60f4edadcc6ffafb2c4e4a2ce32ab2937113e89ead43cf4e027a7785"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/hive/commands/digest_prune.rb:66-75 | lib/hive/commands/digest_refresh.rb:49-59 \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":"lib/hive/commands/digest_prune.rb"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b699084110ece1f4af36f94102b5fa5ee5185aba4f9880fbac1150eb307544d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lib/hive/commands/status.rb:1503-1508 | lib/hive/tui/views/tasks_pane.rb:248-253 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/status.rb"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"243afdab8ed5ca602e2c881c2c6886220153a73ebf72d1bc9c7e382108112d16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lib/hive/context_provenance.rb:453-456 | lib/hive/task_workspace/provenance.rb:365-369 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/context_provenance.rb"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6bf4c872434d97c52702974147046053debf1016d86af5df4b04639d6d061c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): packaging/live_agent_skills/workflow_creator_gateway.rb:292-296 | packaging/live_agent_skills/workflow_creator_live_setup.rb:453-457 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/live_agent_skills/workflow_creator_gateway.rb"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c62345d970ec695412f0dfee81db4de365185d8295885655f974913f033917f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): packaging/live_agent_skills/workflow_creator_live_runner.rb:698-701 | packaging/release_candidate/artifacts.rb:442-447 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/live_agent_skills/workflow_creator_live_runner.rb"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"75535d42e9f6312962c7cd4fe6db26b15cf59e0db58088b9ada9dc470f04e023"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 5\u002B corresponding lines): lib/hive/artifacts/outcome_evidence/contract.rb:207-211 | lib/hive/artifacts/outcome_evidence/proof.rb:778-782 | lib/hive/web/project_capture_provider.rb:1132-1137 | lib/hive/web/task_capture.rb:1083-1087 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/artifacts/outcome_evidence/contract.rb"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8348e8dafd074fc76040804067a117095fa3f7f89aa499f7685127a61661f88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lib/hive/daemon/child_supervisor.rb:639-644 | lib/hive/plan_review/decision_service.rb:132-137 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/child_supervisor.rb"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d05aa5f80a84421fac733d12aac51b8444f5ca1f7c94c94f429d63923310d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 3\u002B corresponding lines): lib/hive/daemon/recovery_coordinator.rb:2331-2335 | lib/hive/operational_action.rb:298-301 | lib/hive/patrol_fix/secret_rework.rb:430-434 | lib/hive/workflow_package/validator.rb:444-446 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/recovery_coordinator.rb"},"region":{"startLine":2331}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8ac61fc553e02b2a1066a32f843435195cadf2db1f0e2dcae9bc567ed700f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lib/hive/patrol_fix/source_snapshot.rb:143-146 | lib/hive/patrol_fix/task_manifest.rb:135-139 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol_fix/source_snapshot.rb"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"a503488baeadd56a81ea23c8da5daedc15cafb732a5794ebbb3a081e4d65c051"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): lib/hive/stages/patrol_fix/fix.rb:153-153 | lib/hive/stages/patrol_fix/validate.rb:157-157 \u2014 These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \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":"lib/hive/stages/patrol_fix/fix.rb"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea4db636e4eb3562030cd9dc7524e8fa4186a27affee8a6ea7d890a4e3c906e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/hive/web/browser_bundle.rb:322-332 | lib/hive/web/source_bundle.rb:214-223 \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":"lib/hive/web/browser_bundle.rb"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f6a11cc89d8343ffe13fd472480d82a627b9e79639fe94f97063ab372db0eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): lib/hive/daemon/recovery_coordinator.rb:1894-1896 | lib/hive/recovery/api.rb:188-190 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/recovery_coordinator.rb"},"region":{"startLine":1894}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9fbf867b5a3441f33a3559dd356ddee1f0af677aff15909b77c0a834bf98afa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/hive/findings.rb:71-75 | lib/hive/stages/review/suppression.rb:516-520 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/findings.rb"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e360d2a3e666dca13d77a75b1729da27a6c1ef9eaab05933c761a4263804f5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): lib/hive/llm_wiki_bootstrap.rb:120-125 | lib/hive/patrol/base_state_store.rb:84-89 | lib/hive/refactor_patrol/collisions.rb:67-73 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/llm_wiki_bootstrap.rb"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1e69c1bd3fff7e85baf8fffca15c63eac737e78ad9a7acf9aa0c58b097afb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/hive/module_package/managed_store.rb:613-617 | lib/hive/workflow_package/managed_store.rb:413-417 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/module_package/managed_store.rb"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e85930b7ef466bebee9710895921c4fc18b798ea577b42b255fc3cc8d087fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/hive/patrol/fix_admission_adapter.rb:124-130 | lib/hive/refactor_patrol/fix_admission_adapter.rb:37-45 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol/fix_admission_adapter.rb"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"334abc00e3c68fca87d885356611d13b681f0bca53243e29d25a06fd3544965f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lib/hive/setup/qmd_probe.rb:41-46 | lib/hive/web/app_bundle.rb:445-451 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/setup/qmd_probe.rb"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47c50733cf8bcea08c9745a07c04f7fa383f6ce1a8a319d1943f78939b9663e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lib/hive/commands/patrol_fix_semantic_decision.rb:59-64 | lib/hive/daily_digest/task_creation_receipt.rb:108-113 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/patrol_fix_semantic_decision.rb"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d22effee368c8b5b01d714f20d778a7803dcfc673d1731d8c3581ce227556f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lib/hive/module_package/configuration.rb:65-70 | lib/hive/workflow_package/configuration.rb:87-92 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/module_package/configuration.rb"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb5437f4fba4f67106d630d0333997f84ff1de30a38149a21db94e387c95121"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): lib/hive/patrol/fix_admission_adapter.rb:94-95 | lib/hive/refactor_patrol/fix_admission_adapter.rb:115-116 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"lib/hive/patrol/fix_admission_adapter.rb"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd6781f62707cf2cb4a90def8002c1d26d1abcbfe553bbc2d7e4ce0ba157b8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lib/hive/web/browser_bundle.rb:361-364 | lib/hive/web/source_bundle.rb:253-256 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/web/browser_bundle.rb"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a750dabeba00e11565da71a88144ee3878eda265cf7f7587591f5fa1030f794"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): lib/hive/attempts/lost_outcome.rb:281-284 | lib/hive/daemon/stale_agent_healer.rb:379-380 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"lib/hive/attempts/lost_outcome.rb"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb64b2b485072574f7878d3dc8043d340525ae7cef4c9dfce2092295c7fbae8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): lib/hive/commands/connect.rb:67-69 | lib/hive/commands/digest.rb:316-318 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/connect.rb"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"96eb2c9a4ed19e42440a28cd2e6502e5406783e091542ed334653c8e188eb1ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/hive/commands/module_hook.rb:33-42 | lib/hive/commands/stage_action.rb:45-57 \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":"lib/hive/commands/module_hook.rb"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e1e3e8a1e268174b3b492b8d2cb8a98218923fef9cf4ccf89ed92d5e960592"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lib/hive/patrol/fix_admission_adapter.rb:79-82 | lib/hive/refactor_patrol/fix_admission_adapter.rb:100-103 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol/fix_admission_adapter.rb"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"f164954987d9b981f28d598b8c47358d6763b9caa0d964be4acbbcc0799e25ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): lib/hive/remote/command_service.rb:124-126 | lib/hive/remote/read_service.rb:97-99 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/remote/command_service.rb"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03f7251f7de70a34f7e493c09dabee8ae3000243ee58d2c955b1ba165446cc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/hive/agent_profile.rb:669-677 | lib/hive/model_routing.rb:311-322 \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":"lib/hive/agent_profile.rb"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b6ee6ff6da81cb9d512d0c46301190b97716831f33f82e1abd895b7aaa7c18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): lib/hive/cli_argv_policy.rb:77-77 | lib/hive/one_shot/result.rb:25-25 \u2014 These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \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":"lib/hive/cli_argv_policy.rb"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"308bc9ed33ee5a5e3a2a2eeeb7279c991bc53607bc820b41ca24476bbb73aae1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 1\u002B corresponding lines): lib/hive/patrol/architecture_mapper.rb:765-765 | lib/hive/patrol/fingerprint.rb:199-200 | lib/hive/patrol/mapper.rb:400-401 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol/architecture_mapper.rb"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08548723fcd2d4eea273e266624c9719a8d3b3efe80dfb4524bae4534b0609e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): lib/hive/patrol/fingerprint.rb:243-243 | lib/hive/refactor_patrol/fingerprint.rb:77-77 \u2014 These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \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":"lib/hive/patrol/fingerprint.rb"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f8a6e4f85ed2a3fdedc25b633bc8bf67adf3a62c9e8e7f8bb6f7001b5c9ec0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): lib/hive/patrol_fix/successor_materializer.rb:111-113 | lib/hive/patrol_fix/task_materializer.rb:195-197 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol_fix/successor_materializer.rb"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"686060dbf210801556fdbb776518d9ed5117df5ce33765b2ca2bf44697174b48"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lib/hive/task_projection/reader.rb:269-273 | lib/hive/web/task_capture.rb:570-573 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_projection/reader.rb"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"9104656deb8a03d00d24aee23efaba59a08c2f12b78106abeca0a6b9a3c0368d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/hive/agent_support/muse.rb:51-55 | lib/hive/agent_support/opencode.rb:99-103 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/agent_support/muse.rb"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c8988bacf339730a1c7f688609ae0caab103e2c8ac20e396f5b01baadca34a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lib/hive/artifacts/outcome_evidence/rework.rb:282-285 | lib/hive/draft_pr_receipt.rb:313-316 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/artifacts/outcome_evidence/rework.rb"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d66b304f8a7547723206f02087e1144440cf259d832298830d5606d1de91475"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/hive/commands/answer_digest.rb:144-154 | lib/hive/daily_digest/delivery.rb:39-48 \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":"lib/hive/commands/answer_digest.rb"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"698b8aef93f4462cea53c3b18b33438aa0d703d9851602baec6dfb00e282f931"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/hive/commands/module/base.rb:22-31 | lib/hive/commands/workflow.rb:373-387 \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":"lib/hive/commands/module/base.rb"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3670bdf7f3064a90b9b26710b437be1a227bad1f0dc40594238f8cacbe1e25"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/hive/conditions/evidence.rb:72-76 | lib/hive/workflow_package/publish_receipt.rb:297-301 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/conditions/evidence.rb"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c17d161ca8e853f9a437ce7c57cc186df6c9d54381340ebf9176c36d5ab6133"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): lib/hive/conditions/transition_guard.rb:148-150 | lib/hive/stages/execute.rb:866-868 | lib/hive/task_action.rb:688-690 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/conditions/transition_guard.rb"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"812ceef0aaf7687fcba0ead7ac6a9b12e75d8771413648d2486d783c208db495"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): lib/hive/patrol/fix_admission_adapter.rb:14-16 | lib/hive/refactor_patrol/fix_admission_adapter.rb:13-15 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol/fix_admission_adapter.rb"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c84bcecb1575ce12f742fe69a06b8c90e9dc147b658a643b1cc4e95ff6fb65"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lib/hive/patrol/reviewer.rb:116-119 | lib/hive/refactor_patrol/reviewer.rb:219-224 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol/reviewer.rb"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"097e279921b7bc235f13010f17396ad00c218670d100c9b718eb159d58062217"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/hive/agent.rb:698-704 | lib/hive/diagnosis_agent.rb:536-543 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/agent.rb"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e1a7eb6cf1809e746b3975e9fd9157b2ed87611108ef1ec848baa23adb878f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): lib/hive/agent_skills/adapters/base.rb:255-257 | lib/hive/agent_skills/inspector.rb:667-669 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/agent_skills/adapters/base.rb"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2b03c36d17e0630ae98f658b5de87439676971f7bbad3b913234cc588c2eaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/hive/attempts/diagnostic_channel.rb:18-22 | lib/hive/attempts/evidence_channel.rb:19-23 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/attempts/diagnostic_channel.rb"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c1d81573c4acec6fbebd7f167ccfb76649d88fc71fae4e093c39c4d7148d1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/hive/attempts/evidence_channel.rb:182-189 | lib/hive/provider_routing.rb:174-183 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/attempts/evidence_channel.rb"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"00709b2b00fb1ec014aeb10bae353bf7140d66e06723556363c33456ad264b4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lib/hive/patrol_fix/attempt_diagnostic.rb:385-388 | lib/hive/task_activity.rb:413-416 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol_fix/attempt_diagnostic.rb"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"bace8f9d97880cf62f1ddb1c8710f1bd99da4fd852308a12ebee0502d9a43961"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): lib/hive/atomic_file.rb:65-67 | packaging/release_candidate/paths.rb:250-252 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/atomic_file.rb"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc047b9502e56d75427296308fd77a3d257a3f1d10419309817fec678432a649"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): lib/hive/bot/supervisor.rb:1851-1853 | lib/hive/daemon/dispatcher.rb:5594-5596 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/bot/supervisor.rb"},"region":{"startLine":1851}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca3b616c6e71dcedbff3f3c4b5d14a108c018c8585a504baa1b65798ea3287c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): lib/hive/commands/act.rb:162-172 | lib/hive/commands/bot.rb:298-305 | lib/hive/commands/daemon.rb:1478-1486 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/act.rb"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f69bc8e1aa87cdd78d6b0d56ac7807b5bafd67df94bd567511d3dff49ae19ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): lib/hive/config.rb:2188-2190 | lib/hive/daily_digest/task_creation_receipt.rb:101-103 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/config.rb"},"region":{"startLine":2188}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1e80097d662c2b657169e4a3c8e6fa9232d237f524fe10804e53a57b14ab78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): lib/hive/daemon/refactor_patrol_merge_reconciler.rb:657-659 | lib/hive/daemon/scheduled_architecture_scheduler.rb:105-107 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/refactor_patrol_merge_reconciler.rb"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c0ba3d7a1b83f33e6d5ebe922287a88f7ddf9f7ec4f6f7288d685409eef7ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lib/hive/daily_digest/task_links.rb:75-78 | web/app/models/daily_digest.rb:152-158 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daily_digest/task_links.rb"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"301d6c76096923e6aef5daa45bb198f35d9f08e1d48da78882b45c2bfb7aab09"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/hive/patrol_fix/inbox_report.rb:20-27 | lib/hive/patrol_fix/review_receipt.rb:23-30 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol_fix/inbox_report.rb"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"3699136e07373217c6712d1c9e0d97393a066a9afaa5443af58d0edede67dff7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/hive/patrol_fix/inbox_report.rb:31-38 | lib/hive/patrol_fix/review_receipt.rb:34-41 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol_fix/inbox_report.rb"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae8b4d3cee2f717b3f84a4080a44a8b527c6d8102399507604049e59dc0e1d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): lib/hive/patrol_fix/receipt_store.rb:334-336 | lib/hive/patrol_fix/source_snapshot.rb:187-189 | lib/hive/patrol_fix/task_manifest.rb:229-231 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol_fix/receipt_store.rb"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"510c295d225b287993f4381fe337aed2ea717de3bcdeaff1f463b8d6b5877b8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): lib/hive/task_workspace/dependency_component.rb:522-523 | web/app/models/github_api.rb:210-211 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"lib/hive/task_workspace/dependency_component.rb"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86faa80e4344fa85362b23be8fc5b04b9a3dcdbd7e7210b73d6a23570e601bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lib/hive/attempts/log_archive.rb:188-191 | lib/hive/attempts/publication.rb:226-229 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/attempts/log_archive.rb"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"e83f41e4e59c3f8c258e8c7a660fbf10f3cf850fa009f4295958ffa0fcc49590"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/hive/commands/answer.rb:66-77 | lib/hive/commands/worktree.rb:29-38 \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":"lib/hive/commands/answer.rb"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d076a41ed1e1093743eb58323ac7206456947dccca6b482e8bb3b44625a8b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): lib/hive/commands/drop.rb:276-277 | lib/hive/commands/run.rb:855-856 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"lib/hive/commands/drop.rb"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae53ec68ac4a1bf9b4bc0e9886ac5acd6ec0c870ff7259975bab65c87583c1f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/hive/commands/module/base.rb:100-107 | lib/hive/commands/workflow/base.rb:96-103 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/module/base.rb"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f1999d953ad402635b3192c1fa1959a100a3ccb05fcaf266ae1fcb7609adec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): lib/hive/commands/new.rb:614-616 | lib/hive/task_capture.rb:297-299 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/new.rb"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a77ca882356a40f968e0d49b85fec866b2bb5ebfe1d4ad9676b68d3d469fa5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): lib/hive/daily_digest/collector.rb:76-78 | lib/hive/daily_digest/task_creation_receipt.rb:118-120 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daily_digest/collector.rb"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a492099f20bed9b50e5580e4dcd12cb8c890a537fdebbf59cc797fdda53522"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 4\u002B corresponding lines): lib/hive/daily_digest/delivery_ledger.rb:369-372 | lib/hive/daily_digest/store.rb:492-495 | lib/hive/modules/decision_journal.rb:195-198 | lib/hive/modules/dry_run.rb:93-96 | lib/hive/modules/event_ledger.rb:329-332 | lib/hive/proposals.rb:306-309 | lib/hive/provider_routing/decision.rb:175-178 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daily_digest/delivery_ledger.rb"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7722ee04f11471c98dc14664108d967dfe32f203795afcd5177a937262d2d31"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lib/hive/dependencies.rb:238-249 | lib/hive/task_meta.rb:604-609 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/dependencies.rb"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a3faa13a12b4dbf4f5b80336a339c02885b905709fc4b7ec1d7d4253acfb4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/hive/gh.rb:1048-1055 | lib/hive/refactor_patrol/github_gateway.rb:290-299 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/gh.rb"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2503d92b4418c6e5cded4b58d4d3db0c2bdefdcf33b238a8921819f0081db23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): lib/hive/patrol_fix/receipt_store.rb:327-330 | lib/hive/patrol_fix/source_snapshot.rb:180-183 | lib/hive/patrol_fix/task_manifest.rb:222-225 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol_fix/receipt_store.rb"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86010c648e55c9c6b2cdb5be1873051ad2f1bc30c6a39e57a1725b237c2867f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): lib/hive/web/status_feed.rb:525-527 | lib/hive/web/task_diff.rb:218-220 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/web/status_feed.rb"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc1d3f3151c60e086329abdf2cd0df388ba5dba11b7be426e68a1ca21c635d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): packaging/release_candidate/evidence.rb:258-262 | packaging/release_candidate/release_selector.rb:420-423 | packaging/release_candidate/remote_identity.rb:153-156 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/release_candidate/evidence.rb"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8726e24463814579eb79db38ba3f871d66e5443448fe72261d32bc336e513d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): components/agent-cli-runtime/lib/agent_cli_runtime/runtime.rb:322-323 | lib/hive/permission_scope.rb:246-249 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"components/agent-cli-runtime/lib/agent_cli_runtime/runtime.rb"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca70e27c13b40b37ab38e3db6fe31450f9a5c6d94dae3e75bee742c50ebef773"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 1\u002B corresponding lines): lib/hive/artifacts/capture_policy.rb:312-312 | lib/hive/artifacts/outcome_evidence/recovery.rb:130-130 | lib/hive/artifacts/outcome_evidence/rework.rb:301-301 | lib/hive/artifacts/outcome_evidence/store.rb:1112-1112 | lib/hive/web/capture_runtime.rb:395-395 | lib/hive/web/status_feed.rb:531-531 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/artifacts/capture_policy.rb"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"def45f4276e6248a0c85f1cc464feb89077df0b497d62cb830faf6f1bde7f67e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lib/hive/commands/doctor.rb:371-380 | lib/hive/mcp/doctor_check.rb:104-107 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/doctor.rb"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e862a97e3acef957a7c00086181eef4df1a70ee81c74b9a854ff9bbe7b181c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): lib/hive/daemon/patrol_arbiter.rb:82-84 | lib/hive/daemon/refactor_patrol_scheduler.rb:1147-1149 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/patrol_arbiter.rb"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bcf225fb951838071c5f8d73efab625029c8e2fadd4eb1e8f4f062d843cfa81"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): lib/hive/daily_digest/coordinator.rb:421-422 | lib/hive/daily_digest/projector.rb:161-162 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"lib/hive/daily_digest/coordinator.rb"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced94f459390157d926f33c91215db11d6028d192707bc316f809f293dc35c0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/hive/patrol_fix/successor_materializer.rb:148-152 | lib/hive/patrol_fix/task_materializer.rb:389-393 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol_fix/successor_materializer.rb"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"2001bcc6b9a9b6b7247ce3d2e377236985514cda5c2e5fd2772f54484e41318d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): lib/hive/task_workspace/bounded_reader.rb:135-136 | lib/hive/task_workspace/jsonl_reader.rb:169-170 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"lib/hive/task_workspace/bounded_reader.rb"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ccd106eebd528f243faa3a3613b36b225b20cbd7a398b1818ad11c341eab2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): components/agent-cli-runtime/lib/agent_cli_runtime/opencode/result_parser.rb:413-417 | lib/hive/task_workspace/bounded_reader.rb:140-142 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"components/agent-cli-runtime/lib/agent_cli_runtime/opencode/result_parser.rb"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"770b9c880404a95d9caf41a188ad45e6e6a84b8d68411d45cdd206aea48840c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 2\u002B corresponding lines): lib/hive/commands/guarded_archive.rb:20-28 | lib/hive/modules/event_ledger.rb:60-64 | lib/hive/stages/council/revise.rb:9-10 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/guarded_archive.rb"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c874fd6e2ed3f4f11a49a573a2ea3a4e1f756c1d1b59cbb6e81135ad7c34e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): lib/hive/daily_digest/materiality.rb:282-283 | lib/hive/daily_digest/project_source.rb:550-551 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"lib/hive/daily_digest/materiality.rb"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"318a3848011c98dc4085fccf799e27b8ea911e21dec7acd9f7a109e3edb7fc3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 2\u002B corresponding lines): lib/hive/module_package/configuration.rb:84-85 | lib/hive/module_package/preview.rb:128-129 | lib/hive/workflow_package/configuration.rb:335-336 | lib/hive/workflow_package/runtime_policy.rb:845-847 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/module_package/configuration.rb"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e595cd1d953a6fa88d737adf960ab65550d4a096cba142f4328c109bb5b63636"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): lib/hive/patrol_fix/source_snapshot.rb:204-205 | lib/hive/patrol_fix/task_manifest.rb:247-248 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"lib/hive/patrol_fix/source_snapshot.rb"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5216de61327bd3ee6f43676b375e8f10b45442f85795a87916d46987dabb70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/hive/commands/workflow/publish.rb:192-199 | lib/hive/workflow_package/publish_resolver.rb:168-172 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/workflow/publish.rb"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a008811b751206e9aee8e4a409bde8f703af459a08a1fec376f770e7fcb428"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/hive/workflow_package/source_snapshot.rb:37-42 | web/script/support/capture_server.rb:31-35 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/workflow_package/source_snapshot.rb"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b31253c6ae969b5e53883a398275758d21e32ca04036dddcba57bf470506a60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): lib/hive/stages/council/reviewer.rb:74-101 | lib/hive/stages/council/revise.rb:53-80 \u2014 before extracting anything, compare \u0060lib/hive/stages/council/reviewer.rb\u0060 and \u0060lib/hive/stages/council/revise.rb\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/hive/stages/council/reviewer.rb:74\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/council/reviewer.rb"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6986d885dac7f60a3f4056d51d3c3a939670bbff279f768c5932283306bdc3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201328 lines \u00D7 2): web/script/record_box_demo_real.rb:241-268 | web/script/record_box_demo_real_resume.rb:125-150 \u2014 before extracting anything, compare \u0060web/script/record_box_demo_real.rb\u0060 and \u0060web/script/record_box_demo_real_resume.rb\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 80 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/script/record_box_demo_real.rb"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86c94e8d8773eab4fbeb4c94f7cfa55c9c59864929a5fd9d7c35be3360fedbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): lib/hive/stages/finalize.rb:53-78 | lib/hive/stages/finalize.rb:136-161 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/hive/stages/finalize.rb:53\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/finalize.rb"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f11559f618da912e9f309d4015370884b3ab2b7b781609c52243056f2a570ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201324 lines \u00D7 2): lib/hive/daemon/refactor_patrol_merge_progress_store.rb:193-214 | lib/hive/daemon/refactor_patrol_merge_reconciler.rb:884-907 \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":"lib/hive/daemon/refactor_patrol_merge_progress_store.rb"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"3115a072d7f8fe68a1bb5bd2c3893a570593a87bfb364798c3fc83c3831ba660"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): lib/hive/commands/bot.rb:230-247 | lib/hive/commands/daemon.rb:896-915 \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":"lib/hive/commands/bot.rb"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fbfcbf1e05ae31221cada36edd6a22f1ebf3adf2f16dc9f16b8fc518cf947d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): components/agent-cli-runtime/lib/agent_cli_runtime/runtime.rb:340-357 | lib/hive/agent_runtime.rb:509-527 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"components/agent-cli-runtime/lib/agent_cli_runtime/runtime.rb"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"0420ea10e2903df739734c660adc0e3b9e87eccf5e5be6024eb58fa85fdf736f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): lib/hive/daemon/patrol_fix_semantic_decision_runner.rb:54-71 | lib/hive/refactor_patrol/merge_classifier_runner.rb:40-57 \u2014 before extracting anything, compare \u0060lib/hive/daemon/patrol_fix_semantic_decision_runner.rb\u0060 and \u0060lib/hive/refactor_patrol/merge_classifier_runner.rb\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/hive/daemon/patrol_fix_semantic_decision_runner.rb:54\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/patrol_fix_semantic_decision_runner.rb"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"deece22bfcdc4990e0ddb1033e815bb1b821289b9981d48c5cf094a9ffcce4d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): web/script/record_box_demo_real.rb:135-152 | web/script/record_box_demo_real_resume.rb:86-103 \u2014 before extracting anything, compare \u0060web/script/record_box_demo_real.rb\u0060 and \u0060web/script/record_box_demo_real_resume.rb\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 80 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/script/record_box_demo_real.rb"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ea6e8df120108afc8ce7a09d0e139d29d713a3b16a29f4451629cb2dd27082"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): lib/hive/artifacts/outcome_evidence/recovery.rb:90-105 | lib/hive/artifacts/outcome_evidence/rework.rb:165-181 \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":"lib/hive/artifacts/outcome_evidence/recovery.rb"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18bd7ab75ac662c0423f2326b15903bab1360bad994c25142814a6a8b273241"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): lib/hive/artifacts/outcome_evidence/store.rb:989-1004 | lib/hive/artifacts/outcome_evidence/store.rb:1034-1048 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/hive/artifacts/outcome_evidence/store.rb:989\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/artifacts/outcome_evidence/store.rb"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9d876393ca367fa99499bc95ec384baaa516b5293f37195c30e407439f41ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/hive/config.rb:4330-4345 | lib/hive/config.rb:4460-4475 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/config.rb"},"region":{"startLine":4330}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f53b76ee6fa351e23ed68752258408b8e773fcdb710fc445c8d9363a80c89e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): lib/hive/refactor_patrol/job_store.rb:255-270 | lib/hive/refactor_patrol/job_store.rb:1506-1520 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/hive/refactor_patrol/job_store.rb:255\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/job_store.rb"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"04859a74934be050517ec620b349ea3c13dd2d3358fa7a2c5b506c2e906313a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/hive/refactor_patrol/job_store.rb:436-451 | lib/hive/refactor_patrol/job_store.rb:620-635 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/hive/refactor_patrol/job_store.rb:436\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/job_store.rb"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"a709944994a9b0108d59494e83907b7ee6bd5adc0b0fb808dbc60c9ccc8a9f8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/hive/refactor_patrol/job_store.rb:1331-1346 | lib/hive/refactor_patrol/job_store.rb:1361-1376 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/hive/refactor_patrol/job_store.rb:1331\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/job_store.rb"},"region":{"startLine":1331}}}],"partialFingerprints":{"codehealthFindingId/v1":"5728550614721b4cdaf7bc6b5f9c212e1a73f614c0c3273a7c753855f86c8f54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/hive/runtime_control_plane/codec.rb:58-73 | lib/hive/workflow_package/canonical_json.rb:23-38 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/runtime_control_plane/codec.rb"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be3c482a474f0caf75b1f9ea53670e6a3fef2b6577c3fac88652e332985dadc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lib/hive/commands/decide.rb:307-321 | lib/hive/commands/decide.rb:493-507 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/decide.rb"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4232bf0582cd4d1fedfc6a467bb588405bff95525f791e28457ce59a4b56ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lib/hive/daemon/patrol_fix_semantic_decision_runner.rb:73-87 | lib/hive/refactor_patrol/merge_classifier_runner.rb:59-73 \u2014 before extracting anything, compare \u0060lib/hive/daemon/patrol_fix_semantic_decision_runner.rb\u0060 and \u0060lib/hive/refactor_patrol/merge_classifier_runner.rb\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/hive/daemon/patrol_fix_semantic_decision_runner.rb:73\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/patrol_fix_semantic_decision_runner.rb"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"1815f1fc48892a0a05a84261ac37c962b56f7c0c34933259ed60031538bcb09b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): lib/hive/setup/qmd_probe.rb:23-37 | lib/hive/web/app_bundle.rb:428-441 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/setup/qmd_probe.rb"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"609b708b1e0c292be6b48c72dd2f56cb2055b67c88ef36487e0129af26bbb3ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 2): lib/hive/bot/child_supervisor.rb:43-52 | lib/hive/daemon/child_supervisor.rb:241-254 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/hive/bot/child_supervisor.rb:43\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/bot/child_supervisor.rb"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a6011cac82e7b1cb80203754b65a662a6024a7b8675b1a796a819f47604f08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): lib/hive/bot/logger.rb:171-181 | lib/hive/daemon/logger.rb:173-186 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/bot/logger.rb"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"38073713716e806b85a1989d7f1af9586d4043a3af265c9c9f4961de22956dfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): lib/hive/daemon/dispatch_baselines.rb:179-189 | lib/hive/update_check/state.rb:230-243 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/dispatch_baselines.rb"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"f09e297407962e357aebedf9ef62ba25dc9e7fdf29c9584fdf1783af86c47529"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201314 lines \u00D7 2): lib/hive/stages/brainstorm.rb:45-58 | lib/hive/stages/plan.rb:202-210 \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":"lib/hive/stages/brainstorm.rb"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"0510b43ab333e141cb1ff3f4dca804b8fe54de8aac57eb187a76a59596e72673"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): lib/hive/web/browser_bundle.rb:147-159 | lib/hive/web/source_bundle.rb:101-114 \u2014 before extracting anything, compare \u0060lib/hive/web/browser_bundle.rb\u0060 and \u0060lib/hive/web/source_bundle.rb\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/web/browser_bundle.rb"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16ad0045c1e02c36d9041109f7226de8fed7f66e2f33ccf5c7c5637f10a158e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/hive/web/project_capture_provider.rb:244-257 | lib/hive/web/project_capture_provider.rb:333-346 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/hive/web/project_capture_provider.rb:244\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/web/project_capture_provider.rb"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bef5fad2b05f2205bbd50e84d344c13a9e5454e8ac339baefb0fef6455fb6fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): web/script/record_box_demo_real.rb:270-283 | web/script/record_box_demo_real_resume.rb:152-165 \u2014 before extracting anything, compare \u0060web/script/record_box_demo_real.rb\u0060 and \u0060web/script/record_box_demo_real_resume.rb\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 80 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/script/record_box_demo_real.rb"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"314a3e67a344ee81efefd78124534d7043aa1922fa0978aafe4ea6cf800aac8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/hive/agent_skills/inspector.rb:126-138 | lib/hive/agent_skills/inspector.rb:179-191 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/hive/agent_skills/inspector.rb:126\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/agent_skills/inspector.rb"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2c97e1d54071d4007edb727232f2a410bd67e1d33f82c1d4b8b4a301f8002a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): lib/hive/commands/module/base.rb:132-143 | lib/hive/commands/workflow/base.rb:111-123 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/module/base.rb"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada8d7370fb4fb5cc3b81a0fabf82200a18c7481e7f36ef84d3e1ded30e1ce63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/hive/commands/new.rb:595-607 | lib/hive/task_capture.rb:278-290 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/new.rb"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1eb4a862a4f887d85560c4adb00c63e6f078c364c42864192f8ca74102c3be3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): lib/hive/daemon/quiescence.rb:49-61 | lib/hive/daemon/quiescence.rb:384-395 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/quiescence.rb"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"d033e27ba7376f1f3f9a6401c2a481ce785176f29aad9a1f4fe1ad4015767933"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/hive/github_publication.rb:722-734 | lib/hive/github_publication.rb:770-782 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060lib/hive/github_publication.rb:719\u0060 calls \u0060fetch\u0060 and \u0060lib/hive/github_publication.rb:769\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/github_publication.rb"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b5835ab76e5eadb1ae6aee6460de598328ef5945f4afd9ded1e3e616a9c2a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): lib/hive/stages/council/reviewer.rb:115-127 | lib/hive/stages/council/revise.rb:93-104 \u2014 before extracting anything, compare \u0060lib/hive/stages/council/reviewer.rb\u0060 and \u0060lib/hive/stages/council/revise.rb\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/council/reviewer.rb"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"efecfff5a2cabc3dcfccca43595d1a58a1936e96dc3e368d271542585b096fb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/hive/stages/finalize.rb:198-210 | lib/hive/stages/plan.rb:204-216 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/hive/stages/finalize.rb:198\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/finalize.rb"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"51807eb91e19a6b36d40accedef9e326a9b20679503de19bedd18289939868ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): lib/hive/stages/patrol_fix/inbox.rb:113-125 | lib/hive/stages/patrol_fix/review.rb:178-188 \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":"lib/hive/stages/patrol_fix/inbox.rb"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0a3dec42e5128da0cb349349c19d283fbd513523177d54c9f4f82e1e8d7a86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): lib/hive/user_service.rb:586-597 | lib/hive/user_service.rb:620-632 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/hive/user_service.rb:586\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/user_service.rb"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21ac65de93351c70b80f49d8d722d1c4ee6917b5dd45cca598636fdf6efac4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): lib/hive/commands/status.rb:835-844 | lib/hive/commands/status.rb:1288-1299 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/hive/commands/status.rb:835\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/status.rb"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc7df24e368b35454b11bcf5e381bf1afc36631f9caf05d857450319a7f677d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/hive/daemon/dispatcher.rb:4243-4254 | lib/hive/daemon/dispatcher.rb:4257-4268 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":4243}}}],"partialFingerprints":{"codehealthFindingId/v1":"de651979958892785cdaeed9fe6181046abd1385c19f72077cc00eb94e984be7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): lib/hive/implementation_identity/resolver.rb:249-259 | lib/hive/implementation_identity/resolver.rb:269-280 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/hive/implementation_identity/resolver.rb:269\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/implementation_identity/resolver.rb"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95e0be1be5d4689680a828857383769a209ad34c7feb99dbde47a4369363995"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/hive/patrol/reviewer.rb:150-161 | lib/hive/refactor_patrol/reviewer.rb:196-207 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol/reviewer.rb"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"7099158b8de0c189cf54b0d0428c83321220dc969349d9bfe33c69f8dd1f3ded"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/hive/patrol/reviewer.rb:336-347 | lib/hive/refactor_patrol/review_agent_runner.rb:51-62 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/hive/patrol/reviewer.rb:336\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol/reviewer.rb"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74562fbb1167400dd8abc518bc8d7c7588c6c5558ec395a56fd0f965c0a9f1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/hive/proposals/decision_service.rb:58-69 | lib/hive/proposals/decision_service.rb:151-162 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/hive/proposals/decision_service.rb:58\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/proposals/decision_service.rb"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe45119714f6b3a74efc3981b330b80c0fc42ffea22c8e88ceafd030bef9ca3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): web/script/record_box_demo_real.rb:69-80 | web/script/record_box_demo_real_resume.rb:73-84 \u2014 before extracting anything, compare \u0060web/script/record_box_demo_real.rb\u0060 and \u0060web/script/record_box_demo_real_resume.rb\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 80 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/script/record_box_demo_real.rb"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"fefe5cbd7a9f42b57c7645da079eea9ffe58eae638d6dfb34880a8e0d8b68d24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): lib/hive/stages/review.rb:2600-2610 | lib/hive/stages/review/ci_fix.rb:537-546 | lib/hive/stages/review/triage.rb:113-122 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/hive/stages/review.rb:2600\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/review.rb"},"region":{"startLine":2600}}}],"partialFingerprints":{"codehealthFindingId/v1":"117ae328e46f4b7b2c7388ffc0f21d85ac172a5777a3e8be69d1fe4737c2427d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): components/agent-cli-runtime/lib/agent_cli_runtime/profiles.rb:111-121 | components/agent-cli-runtime/lib/agent_cli_runtime/profiles.rb:133-143 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"components/agent-cli-runtime/lib/agent_cli_runtime/profiles.rb"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"156318ec83e5e7ec60d4c06dcf9d4ad5ab41e3f13c1750a651028ba36f5953bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/hive/artifacts/outcome_evidence/proof.rb:670-680 | lib/hive/artifacts/outcome_evidence/proof.rb:690-700 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/artifacts/outcome_evidence/proof.rb"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b168afddfdf939591e528333b972b875495038aace51e4f6a6be8bbc786a71a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): lib/hive/bot/child_supervisor.rb:244-252 | lib/hive/daemon/child_supervisor.rb:675-685 \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 that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/bot/child_supervisor.rb"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"181aca589f64746950e6bdb586519b08367326593ba7e80913ebffde61e7c368"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201311 lines \u00D7 2): lib/hive/commands/daemon.rb:455-465 | lib/hive/one_shot/runner.rb:79-85 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/hive/commands/daemon.rb:455\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/daemon.rb"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c0baebb0bb519af5abddc04d3266ce7f7dcb5f2724b8085b2d5c29f8b6c64c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/hive/daemon/dispatcher.rb:4761-4771 | lib/hive/daemon/dispatcher.rb:4866-4876 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":4761}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1e4f60bcf0e8cec8e5b4179fba41227608a4331da641bae964f9352a334465"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/hive/stages/finalize.rb:478-488 | lib/hive/stages/review.rb:3279-3289 \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":"lib/hive/stages/finalize.rb"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"9586d415cd179024f59363cf863d7406e4c92530ca0c2e043ac183a772cb8778"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): lib/hive/babysitter/logger.rb:90-98 | lib/hive/bot/logger.rb:172-180 | lib/hive/daemon/logger.rb:176-185 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/babysitter/logger.rb"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"715f51595046087d23dfdd7736f4b5cef22964e6bb9942c675314c68a2344266"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): lib/hive/proposals/decision_service.rb:55-64 | lib/hive/proposals/decision_service.rb:99-108 | lib/hive/proposals/decision_service.rb:148-157 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/hive/proposals/decision_service.rb:55\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/proposals/decision_service.rb"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eab3edcecaabf197fc5fb6f66a8404291dd1647278af7af3736ee940668264d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/hive/commands/module/lifecycle.rb:266-275 | lib/hive/commands/module/state_change.rb:117-126 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/module/lifecycle.rb"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"693f872a26680c210cb25ec82d8e3c25c0a6efe36c12a6534f1043f2d09d5edd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): lib/hive/daemon/dispatcher.rb:3456-3465 | lib/hive/daemon/dispatcher.rb:3472-3480 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/hive/daemon/dispatcher.rb:3456\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":3456}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ec02c6843438cd9d47f8c08c91fc926a760c2532df71ba3fe3e4cf21751bca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/hive/daemon/recovery_coordinator.rb:520-529 | lib/hive/daemon/recovery_coordinator.rb:810-819 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/recovery_coordinator.rb"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1323e4f5244ccab4a670a425205836a5f7c8213e5270013f3818598503939fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/hive/module_package/managed_store.rb:127-136 | lib/hive/modules/dispatcher.rb:431-440 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/module_package/managed_store.rb"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"927db3dcce1eb3d839403d864e0a70780732276fda1afd4e6d7e8570258fdb25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/hive/web/project_capture_provider.rb:893-902 | lib/hive/web/project_capture_provider.rb:906-915 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/web/project_capture_provider.rb"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe686200c6a1cb004ab056fc7eed18f70810746538522f7941cc6db745a8f34d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/hive/artifacts/outcome_evidence/store.rb:902-910 | lib/hive/artifacts/outcome_evidence/store.rb:920-928 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/artifacts/outcome_evidence/store.rb"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"364bda8fe3ae6f97897f0c3b24c23b7fda717cbb112c3ff4359364c70ef0c826"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): lib/hive/task_workspace/builder.rb:288-296 | lib/hive/task_workspace/usage.rb:357-364 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_workspace/builder.rb"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"201b863605f539d64af457a9969de37251fe8ca80d9bd0fdb37f94d1be604436"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): lib/hive/agent_skills/manifest.rb:224-231 | lib/hive/agent_skills/manifest.rb:274-280 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/agent_skills/manifest.rb"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"f463f150c2f83b8a15bf4a797277bcef727b0433d4d0fd16ac6bdd0194f8b658"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/hive/agent_support/claude/skills.rb:62-69 | lib/hive/agent_support/codex/skills.rb:70-77 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/hive/agent_support/claude/skills.rb:62\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/agent_support/claude/skills.rb"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c82997060e38cfc06254d49ef7c2a33afdb5d4d7983e4fe64fb0ce3b22878c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/hive/daily_digest/delivery.rb:169-176 | lib/hive/daily_digest/delivery.rb:188-195 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/hive/daily_digest/delivery.rb:169\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daily_digest/delivery.rb"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91d3d756ce4ecd3746b167f33fe9b42423c66d6ba29aaaf61d74723cabfc938"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/hive/implementation_identity/reconstructor.rb:17-24 | lib/hive/implementation_identity/store.rb:20-27 \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":"lib/hive/implementation_identity/reconstructor.rb"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"6adbb5d7228858382150f2c0fe580cef4073da070b7ae7c4c7bbf92f0fcc0891"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/hive/proposals/decision_service.rb:89-96 | lib/hive/proposals/decision_service.rb:132-139 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/hive/proposals/decision_service.rb:89\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/proposals/decision_service.rb"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce09e96f45f5d4d467142653def65b2c9ebacb7121d827f6c90d81aecbf517b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/hive/remote/question_handles.rb:157-164 | lib/hive/remote/token_store.rb:136-143 \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":"lib/hive/remote/question_handles.rb"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"8886a415748b76c18a3b9362a252c091df9890602308491f11dd878137e905db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/hive/stages/council/reviewer.rb:131-138 | lib/hive/stages/council/revise.rb:108-115 \u2014 before extracting anything, compare \u0060lib/hive/stages/council/reviewer.rb\u0060 and \u0060lib/hive/stages/council/revise.rb\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/hive/stages/council/reviewer.rb:131\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/council/reviewer.rb"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d4b2231461c561848605efb7c2785529b113892ec27b8ff38dbc37b4c17cfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/hive/workflow_package/managed_store.rb:143-150 | lib/hive/workflow_package/managed_store.rb:165-173 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/workflow_package/managed_store.rb"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe789042ebdd86a01909e3bf204ab19b503c83bf8a867fdde54f133149469a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): lib/hive/agent_support/opencode/skills.rb:102-108 | lib/hive/agent_support/opencode/skills.rb:167-172 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/agent_support/opencode/skills.rb"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0124e719de7274c403e4bbebd58074591ebb2fcdaab957a826c88b96038a87b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/hive/attempts/dispatcher.rb:158-164 | lib/hive/attempts/dispatcher.rb:208-214 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/attempts/dispatcher.rb"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"b209dd0aa377a55db27f2d22c448d76d3b000c67446eea4cfea143024eb5f19d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/hive/bot/alert_store.rb:312-318 | lib/hive/update_check/state.rb:255-261 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/bot/alert_store.rb"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa002e7c5ad4cf1bd118ebb61f1b4becf84d0769798633b4d8bac18b9ad767c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/hive/command_receipt_store/effects.rb:98-104 | lib/hive/command_receipt_store/effects.rb:141-147 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/command_receipt_store/effects.rb"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9d55dc8fdb10a3527307a351424c008261ff4b5ef92f3d1d26c41514aa77c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/hive/commands/approve.rb:696-702 | lib/hive/commands/decide.rb:51-57 \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":"lib/hive/commands/approve.rb"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f7e1a015898500194f11948beba411e3afad4b988b00429ad968667c9614b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/hive/module_package/validator.rb:75-83 | lib/hive/workflow_package/validator.rb:113-121 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/module_package/validator.rb"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce980f596cebd98a159a7daeb27ad40fd00d0896d81819b06b6b2aec9b9d391"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/hive/modules/daemon_runtime.rb:97-103 | lib/hive/modules/daemon_runtime.rb:234-240 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/modules/daemon_runtime.rb"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f90c88c88e84ad48e31cba36bb34a9ad603133a0f75e46b3aa48a72d1964d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/hive/process_kill.rb:70-76 | lib/hive/process_kill.rb:118-124 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/process_kill.rb"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20fa12f5d7ea8b0f48fbbc5d9f67a6ecbb45b803a718ee9aded9a95b679532e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/hive/refactor_patrol/job_query_index.rb:103-109 | lib/hive/refactor_patrol/job_query_index.rb:140-146 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/job_query_index.rb"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"24508ba83566f3daac88e013dfbaa42191edf18b9206b1e8379482f744657200"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/hive/stages/brainstorm.rb:22-28 | lib/hive/stages/brainstorm.rb:64-70 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/brainstorm.rb"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ffcfa53a366a34d36c23c59506508179b187345c9046957bc08e8206f39f152"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): packaging/release_candidate/baseline_cache.rb:129-135 | packaging/release_candidate/baseline_cache_materializer.rb:152-158 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packaging/release_candidate/baseline_cache.rb:129\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/release_candidate/baseline_cache.rb"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ebb1cabcafcb4602da728fbabad2d4b3cefb261ef34bbfc00f7904e890758a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): script/measure_command_receipts.rb:177-183 | script/measure_command_receipts.rb:204-209 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060script/measure_command_receipts.rb:177\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"script/measure_command_receipts.rb"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3e16e337e29f66c2b2e443929418cfa4b32f511f49f8aeab29db99603f229c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): lib/hive/daemon/recovery_coordinator.rb:1874-1881 | lib/hive/runtime_control_plane/dispatch_repository.rb:100-105 | lib/hive/user_service/status.rb:57-72 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/hive/daemon/recovery_coordinator.rb:1874\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/recovery_coordinator.rb"},"region":{"startLine":1874}}}],"partialFingerprints":{"codehealthFindingId/v1":"3531619f31c98a68379235bedbb868305a05f57baeddeb551ebd85433ecb0160"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/hive/bot/handlers/free_text_handler.rb:74-79 | lib/hive/bot/router.rb:297-302 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/hive/bot/handlers/free_text_handler.rb:74\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/bot/handlers/free_text_handler.rb"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"228ee4ae9e30aa8c00a383d5f2695a0bc8e2bd3044bab182ec949a88cf289df3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/hive/commands/decide.rb:50-57 | lib/hive/task_activity.rb:502-507 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/decide.rb"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b21f4fa6b02b00a8baafc62d3fc5ea04eb91134d1f2c39417dfd0d7852d946d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/hive/commands/refactor_patrol.rb:535-540 | lib/hive/refactor_patrol/frozen_revision_map_rig.rb:63-68 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/refactor_patrol.rb"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"37068f6abf34f914717309e07f801ce594d3e215ca3749800396ade28af8737f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/hive/daemon/child_supervisor.rb:163-170 | lib/hive/daemon/child_supervisor.rb:195-202 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/child_supervisor.rb"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde1ca9c93543969e7435e7ea2e402a4944790950b811877e25d82c4f5cc0669"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/hive/daemon/patrol_fix_semantic_decision_runner.rb:138-143 | lib/hive/refactor_patrol/merge_classifier_runner.rb:96-102 \u2014 before extracting anything, compare \u0060lib/hive/daemon/patrol_fix_semantic_decision_runner.rb\u0060 and \u0060lib/hive/refactor_patrol/merge_classifier_runner.rb\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/patrol_fix_semantic_decision_runner.rb"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2f5a6b3ae68f1cc6cd2d725f96b94b48bd651f0012325fb643264ba1e2b1f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/hive/one_shot/architecture_patrol_adapter.rb:33-38 | lib/hive/one_shot/patrol_adapter.rb:19-24 \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":"lib/hive/one_shot/architecture_patrol_adapter.rb"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca479cc4ac33f2118ee2ad2e1bbe41d8da5aa87f6d9da7bccb245a8fc0466ee6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/hive/stages/artifacts.rb:805-810 | lib/hive/stages/artifacts.rb:827-832 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/hive/stages/artifacts.rb:805\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/artifacts.rb"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af2e9f0625f6a251bde809552fc3ad9582fcfaa8bd3ab1a0ce14fe2d5d3eb68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): lib/hive/daemon/recovery_coordinator.rb:1873-1879 | lib/hive/runtime_control_plane/dispatch_repository.rb:99-103 | templates/builtins/bench/runtime/harness/profiles/candidates.rb:55-59 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/recovery_coordinator.rb"},"region":{"startLine":1873}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e289e6ce00f6a509fa662dd29fb78553dd90dc76f398098057fd4fd4fc2c680"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/hive/agent_skills/adapters/openclaw.rb:246-250 | lib/hive/agent_skills/inspector.rb:599-603 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/agent_skills/adapters/openclaw.rb"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"292f0fe3e0f3afeeff860ce93e4c15c9c02ecf8d13667d1f0bcafa13e8534c57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/hive/babysitter/gh_policy.rb:169-173 | lib/hive/babysitter/gh_policy.rb:279-283 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/babysitter/gh_policy.rb"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0db96e2b953f20d9e2abf85d74ece210ed476a72ab8cee3eb600ff2e9152e4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 3): lib/hive/daemon/recovery_coordinator.rb:138-142 | lib/hive/daemon/recovery_coordinator.rb:1885-1887 | lib/hive/recovery/api.rb:180-184 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/recovery_coordinator.rb"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5424f55a2da3cb48446cf80b8776d4242613f26d40d6b7aaadb2dd6d8fcfaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/hive/worktree.rb:488-492 | lib/hive/worktree.rb:545-549 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/worktree.rb"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5631375ac9bc20ca385deabcfda05b183834d260331ea3b8b02642d94782a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): web/script/record_box_demo_real.rb:293-300 | web/script/record_box_demo_real_resume.rb:176-183 \u2014 before extracting anything, compare \u0060web/script/record_box_demo_real.rb\u0060 and \u0060web/script/record_box_demo_real_resume.rb\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 80 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060web/script/record_box_demo_real_resume.rb:175\u0060 calls \u0060join\u0060 and \u0060web/script/record_box_demo_real.rb:292\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/script/record_box_demo_real.rb"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ab9bc1059011fb8343ceee3554d4c1c821759e5af681a4d85ed1894e34ba35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): lib/hive/agent_support/opencode/configuration.rb:127-135 | lib/hive/attempts/context.rb:349-357 | lib/hive/provider_routing.rb:162-170 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/hive/agent_support/opencode/configuration.rb:127\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/agent_support/opencode/configuration.rb"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"232125f7d6d1d16241ffe7f1eb410db798a2ba0f72cf4b6853adcad032374132"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/hive/artifacts/browser_gateway.rb:406-411 | lib/hive/artifacts/capture_mailbox.rb:153-158 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/artifacts/browser_gateway.rb"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"1959b7becf0782a8ae302d85c1bd8a300e4f4cf36e24f0ddf4068dc403887626"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): lib/hive/bot/handlers/callback_handlers.rb:25-35 | lib/hive/bot/handlers/slash_handlers.rb:19-29 | lib/hive/commands/babysit.rb:34-44 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/bot/handlers/callback_handlers.rb"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b81c664422e3bfd5d636156a7f4b703c02eb4715e7528ff93ea6cc6cdaa6ee8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/hive/bot/telegram.rb:235-239 | lib/hive/bot/transcriber.rb:240-244 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/bot/telegram.rb"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"6415d3c2e5b07abccc0a7fc3bc8b86bb169ee76f20e624db6cb090136ea8ca49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/hive/commands/bot.rb:309-316 | lib/hive/commands/daemon.rb:884-891 \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":"lib/hive/commands/bot.rb"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"33682d2fd24991ce64c544b32e3f1611ad104710a4c2b8ff599bae0741cbac8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/hive/commands/connect.rb:51-63 | lib/hive/commands/disconnect.rb:21-33 \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":"lib/hive/commands/connect.rb"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0f975be0e728fe9f27218ef7f73119993aab9f9271dc1a801f52225a882666"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): lib/hive/commands/module/base.rb:35-42 | lib/hive/commands/workflow.rb:391-408 | lib/hive/commands/workflow/base.rb:39-46 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/module/base.rb"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5dd7157fdcfb4f5cfcc290368f67c79bf5ff1caed98373c84953bca3d829d41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/hive/conditions/attempt_observer.rb:132-141 | lib/hive/conditions/reconcilers/execute.rb:235-244 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/conditions/attempt_observer.rb"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"757731ddfafe3f9159142ab7af91e2457ba3cb828ef8dac0b9f3ec56c4689503"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): lib/hive/config.rb:1134-1140 | lib/hive/plan_review.rb:63-69 | lib/hive/proposals.rb:226-232 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/hive/config.rb:1134\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/config.rb"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5df9d48c67f37f26403d1b03b8c364af84aeae03d4e70b9fb1fcbb34c491743"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/hive/daemon/dispatch_baselines.rb:127-131 | lib/hive/daemon/patrol_arbiter.rb:63-67 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/dispatch_baselines.rb"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad71eb4e8c5174d6e9493e0a88af070d3a1f8b8b1be36104b8b1170b8937873"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/hive/daemon/refactor_patrol_merge_reconciler.rb:382-387 | lib/hive/daemon/refactor_patrol_scheduler.rb:634-639 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/refactor_patrol_merge_reconciler.rb"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"522921ed79eec49735ecdf6631554f02b069489d81880eac67b0eace0c4ea364"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/hive/daily_digest/coverage.rb:200-204 | lib/hive/daily_digest/materiality.rb:312-316 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/hive/daily_digest/coverage.rb:200\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daily_digest/coverage.rb"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"22bf0e49872d164110567a746fa6f75f5f3482fddd0086edd189d4dd0e03aab3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): lib/hive/module_package/configuration.rb:192-196 | lib/hive/module_package/manifest.rb:312-316 | lib/hive/module_package/normalizer.rb:85-89 | lib/hive/module_package/preview.rb:144-148 | lib/hive/modules/status.rb:233-237 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 5 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/hive/module_package/configuration.rb:192\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/module_package/configuration.rb"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"5afb9b1be170a7b43a9e27cd12bb96710f7e64cb30de70ec42dce95c6c7bf167"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/hive/patrol/fingerprint.rb:179-184 | lib/hive/refactor_patrol/fingerprint.rb:64-69 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol/fingerprint.rb"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"455ccf7f8059179bee655b7b3b589909a191466380f2f2e695d5f878c3802ede"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/hive/patrol_fix.rb:39-45 | lib/hive/workflow_package/source_snapshot.rb:295-301 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/hive/patrol_fix.rb:39\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060lib/hive/patrol_fix.rb:48\u0060 calls \u0060deep_copy\u0060, \u0060parse\u0060, \u0060generate\u0060 and \u0060lib/hive/workflow_package/source_snapshot.rb:303\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol_fix.rb"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f60c1fcd32d1e056f25929dc78eac239dfb046a75d670e5bb7f0d75ee7add44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/hive/patrol_fix/receipt_store.rb:357-361 | lib/hive/patrol_fix/source_snapshot.rb:209-213 \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":"lib/hive/patrol_fix/receipt_store.rb"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca9ad9b68de5f342881c79e5a0548f559f519a66e77b5dfcf4d88306f6e851a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/hive/patrol_fix/source_snapshot.rb:150-154 | lib/hive/patrol_fix/task_manifest.rb:157-161 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol_fix/source_snapshot.rb"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a3c7d9258e47927fd8cf8ef60152585adad8a13d1159c74b781f9e37737bff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/hive/plan_review/orchestrator.rb:1470-1475 | lib/hive/plan_review/transition_guard.rb:307-312 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/plan_review/orchestrator.rb"},"region":{"startLine":1470}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d580a9108c696d90004e593c1e18ee75bdcfedb5e944df291d61e22f8acd11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/hive/plan_review/planner_identity.rb:44-49 | lib/hive/stages/base.rb:244-249 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/plan_review/planner_identity.rb"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9c7a5060c5ffdb48d5f17df8074b5151f4ee7679c6d80761435a721063ce2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/hive/plan_review/planner_identity.rb:54-60 | lib/hive/stages/base.rb:264-270 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/plan_review/planner_identity.rb"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb22520810668768e599fae43fa2f0b76eee389f509ff480353e078101ed51f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/hive/proposals/source_event_store.rb:548-553 | lib/hive/proposals/store.rb:620-625 \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":"lib/hive/proposals/source_event_store.rb"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"e956ec752dd767afd2570e731d850eb96745940f11687dcc37ed9e0e9d5ff8e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/hive/refactor_patrol/merge_classifier.rb:159-164 | lib/hive/refactor_patrol/post_merge_batch_store.rb:186-191 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/merge_classifier.rb"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1cf3148ebad70561cafcc461fdc9226d0a37150e40d92bebbddd68025257cd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/hive/web/browser_bundle.rb:136-143 | lib/hive/web/source_bundle.rb:90-97 \u2014 before extracting anything, compare \u0060lib/hive/web/browser_bundle.rb\u0060 and \u0060lib/hive/web/source_bundle.rb\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/web/browser_bundle.rb"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bbf7bf5f1afbdeaf55fd16bbee7315b2c2ff55e49dc5310c80fb04eb3f82581"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/hive/web/browser_bundle.rb:368-372 | lib/hive/web/source_bundle.rb:260-265 \u2014 before extracting anything, compare \u0060lib/hive/web/browser_bundle.rb\u0060 and \u0060lib/hive/web/source_bundle.rb\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/web/browser_bundle.rb"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a39147a3846475dca132d23e7c5b9b902e461be2e41ff9702a2a5614ef7b2c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/hive/web/browser_bundle.rb:376-384 | lib/hive/web/source_bundle.rb:303-311 \u2014 before extracting anything, compare \u0060lib/hive/web/browser_bundle.rb\u0060 and \u0060lib/hive/web/source_bundle.rb\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060lib/hive/web/browser_bundle.rb:388\u0060 calls \u0060realpath\u0060 and \u0060lib/hive/web/source_bundle.rb:315\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/web/browser_bundle.rb"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"4020072fd3d854cd8602ad25473745b357527ac3997efc842874177a149ddb4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/hive/workflow_package/runtime_policy.rb:523-529 | packaging/live_agent_skills/workflow_creator_live_setup.rb:798-803 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/workflow_package/runtime_policy.rb"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3a563d315bb454fe74ecdda61fc5b96f26f7be5bc0650df1f2c35bd6373d27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): packaging/live_agent_skills/release_selector.rb:144-149 | packaging/release_candidate/aggregate.rb:243-248 | packaging/release_candidate/hosted_aggregate.rb:215-220 | packaging/release_candidate/hosted_gate.rb:133-138 | packaging/release_candidate/release_selector.rb:435-440 | packaging/release_candidate/remote_identity.rb:167-172 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/live_agent_skills/release_selector.rb"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14bcfd5fec13ca20aeb46ed9e242a476a082f6a1d0f48a65f769bbc5fbb97b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): packaging/live_agent_skills/workflow_creator_text_safety.rb:17-21 | packaging/live_agent_skills/workflow_creator_values.rb:26-30 \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":"packaging/live_agent_skills/workflow_creator_text_safety.rb"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55d01a1120e189270577b045731e9bd84453f7b3793ab614f3ed1afc485c03f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): packaging/release_candidate/remote_run.rb:121-126 | packaging/release_candidate/remote_workflow.rb:281-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":"packaging/release_candidate/remote_run.rb"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"4384b7ab77adf6513264ff03090f011774423932db7226e253b3b1717ad89003"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/hive/attempts/record.rb:617-624 | lib/hive/refactor_patrol/pr_manifest.rb:197-204 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/hive/attempts/record.rb:617\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/attempts/record.rb"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba80e439251546a58768f98431ddc114e95ce79bd50ac25d9b49faef0b42451"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/hive/commands/daemon.rb:1090-1095 | lib/hive/commands/forget.rb:121-126 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/hive/commands/daemon.rb:1090\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/daemon.rb"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"716c3017e45a74788d4a4ee6d0f917b82590690c2030e4300999cdbcdbd99d92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/hive/stringify_keys.rb:6-10 | lib/hive/workflow_package/publish_receipt.rb:289-293 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/hive/stringify_keys.rb:6\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stringify_keys.rb"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5b48eeaae8a9540dab900a00b177e4ab4f86d6c076ebe63930d31f0f545951"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/hive/web/project_capture_provider.rb:1149-1153 | lib/hive/web/task_capture.rb:1144-1148 \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":"lib/hive/web/project_capture_provider.rb"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"964415a006d6aee28e5a6b78dc82783b25232248cc8b91dac3fb5bc18caa149a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): lib/hive/bot/handlers/slash_handlers.rb:262-266 | lib/hive/bot/handlers/slash_handlers.rb:320-324 | lib/hive/bot/handlers/slash_handlers.rb:354-358 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/bot/handlers/slash_handlers.rb"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"d420490ab48c6f7d2700252ec87f04c5b283ced4be462eb92d5d7c58ea214b63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/hive/commands/status.rb:1371-1375 | lib/hive/tui/views/tasks_pane.rb:267-271 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/status.rb"},"region":{"startLine":1371}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb11b497b229f0aaa73e3384e8904d954819cdcb843e15065b82f72bd7c8f3cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/hive/modules/daemon_runtime.rb:34-40 | lib/hive/modules/daemon_runtime.rb:53-59 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/modules/daemon_runtime.rb"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c35837f81e9e5eee953d6899a261ebf48b35b0b12811209264563917209a109"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/hive/patrol/fix_admission_adapter.rb:86-90 | lib/hive/refactor_patrol/fix_admission_adapter.rb:107-111 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol/fix_admission_adapter.rb"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ac0acbfd8a02fe9e14ad24839f6a9a4e4535a2180ea417ff8de3b8754fd2a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/hive/stages/patrol_fix/fix.rb:117-121 | lib/hive/stages/patrol_fix/validate.rb:136-140 \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":"lib/hive/stages/patrol_fix/fix.rb"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44b6f58419292525f4c4ef4e9f1996c4858f5a54c14ceb967f6307d9339b07c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/hive/task_workspace/timeline.rb:230-236 | lib/hive/task_workspace/timeline.rb:271-277 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_workspace/timeline.rb"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"040a928714c226fcb889e20676c7121e017b8e40da1d04057dc3a9711fc22f41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/hive/workflows/descriptor_parser.rb:601-607 | lib/hive/workflows/descriptor_parser.rb:678-684 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/workflows/descriptor_parser.rb"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3a41693b5dcaed5b048663ead2bebaff88cea4c2d721bbeed898e6b98de379"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): templates/builtins/bench/runtime/harness/hive_run.rb:70-106 | templates/builtins/bench/runtime/harness/run_all.rb:228-261 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/builtins/bench/runtime/harness/hive_run.rb"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2095df7f844f6774e73ad0e641d6f4e266629e78e5313142e88d35c54fc20b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): templates/builtins/bench/runtime/harness/hive_run.rb:129-138 | templates/builtins/bench/runtime/harness/pipeline_run.rb:89-97 \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":"templates/builtins/bench/runtime/harness/hive_run.rb"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6738a58c451e3a5aaeb3f61ae6172d384ca1107962cd4f70dbd957764344e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): templates/builtins/bench/runtime/harness/lib/hive_driver.rb:337-344 | templates/builtins/bench/runtime/harness/lib/hive_driver.rb:358-363 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/builtins/bench/runtime/harness/lib/hive_driver.rb"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"0655189a2b14eee33fe043df66cadf9829c86d0fc36154918db1998df430a71c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): templates/builtins/bench/runtime/harness/lib/hive_config.rb:137-141 | templates/builtins/bench/runtime/harness/lib/hive_driver.rb:798-802 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/builtins/bench/runtime/harness/lib/hive_config.rb"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"066186ccb83b7b227823983d1c28c3abc93e994dca9e0b5d8d880632f3f04ae6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): templates/builtins/bench/runtime/harness/lib/pipeline.rb:103-106 | templates/builtins/bench/runtime/harness/run.rb:130-140 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/builtins/bench/runtime/harness/lib/pipeline.rb"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae95fbb0c7cb8f3f01378be876b926cd4106b902bd409b775fd0be5d81f0536c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): templates/builtins/bench/runtime/harness/pipeline_run.rb:74-76 | templates/builtins/bench/runtime/harness/run_all.rb:265-267 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/builtins/bench/runtime/harness/pipeline_run.rb"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"165061ed544d93bf76096d3c53256394f493cfd69f6cce8259eb31475e62aec9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): templates/builtins/bench/runtime/harness/lib/pipeline.rb:131-134 | templates/builtins/bench/runtime/harness/run_all.rb:186-189 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/builtins/bench/runtime/harness/lib/pipeline.rb"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"05197f0edb7d8d5d9a911364ec39b5997d92ca608c41e91e4d3572705268da8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): templates/builtins/bench/runtime/harness/hive_run.rb:133-138 | templates/builtins/bench/runtime/harness/pipeline_run.rb:93-97 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/builtins/bench/runtime/harness/hive_run.rb"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"377688f25c8f00e14de168af95b13ac3d32c76f37e49a922404c3a3ed12b4353"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): templates/builtins/bench/runtime/harness/hive_run.rb:77-81 | templates/builtins/bench/runtime/harness/pipeline_run.rb:57-61 \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":"templates/builtins/bench/runtime/harness/hive_run.rb"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"4039f075e6aadcdfe6483757b5fcfcb28f9d345fffd6ed022a1fd9e9e65c01fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): templates/builtins/bench/runtime/harness/hive_run.rb:95-100 | templates/builtins/bench/runtime/harness/run_all.rb:246-251 \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":"templates/builtins/bench/runtime/harness/hive_run.rb"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ffb2054bc122dd058e6efc475ec45ad87139826f4c0ee37efd238c5bb95a84f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Repository (LCOM4 10): Repository\u0027s methods fall into 10 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 10 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":"lib/hive/attempts/repository.rb"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c45fb831b818c1532b8b026999c48583165d5886e352e77a5710e72c6b10e33"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CommandReceiptStore (LCOM4 8): CommandReceiptStore\u0027s methods fall into 8 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 8 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":"lib/hive/command_receipt_store.rb"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b94b3c275ac5cf5a99528a01425de8c5de9e2d93e303aac8eb9d608ea6d02de"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Task (LCOM4 8): Task\u0027s methods fall into 8 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 8 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":"web/app/models/task.rb"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f8400fa3fe3e432015109ce6ab7352bc3d55a97936ea3573237456828fc38b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: AgentProfile (LCOM4 6): AgentProfile\u0027s methods fall into 6 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 6 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":"lib/hive/agent_profile.rb"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6f025f9760f87e37553d7f914ed358cbed980a3fe3fd23b63178b6070e9510"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Snapshot (LCOM4 5): Snapshot\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_workspace/snapshot.rb"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"babe70cd262adac84e096bd26f7317a9fc4def75054082e04ce313d9e2fd136d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: InitSetup (LCOM4 5): InitSetup\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/models/init_setup.rb"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ae5126ad1c0be7977d236a6548cc1b5f79bd3193a92ec55b5275a3a6e945f7"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Profile (LCOM4 4): Profile\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":"components/agent-cli-runtime/lib/agent_cli_runtime/profile.rb"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"97cbaa0815506abf12f3446ef52c949c0181ad3b24ae07e50387d7019e570660"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Agent (LCOM4 4): Agent\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":"lib/hive/agent.rb"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2f639960e87328c4d535b230efa38c84ee105ce3e8bfb8b4aca02a1660ae69"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RefactorPatrolMergeProgressStore (LCOM4 4): RefactorPatrolMergeProgressStore\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":"lib/hive/daemon/refactor_patrol_merge_progress_store.rb"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"351ecdc091af9977660deae4dcd15e53cbb4e75812af2e4b578f5b6f41ef0d7d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Transaction (LCOM4 4): Transaction\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":"lib/hive/user_service/transaction.rb"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f295dee9687f8cd4904e7b4fbda3060969c0ce5fac5ebf6828a0ef7c2420da6"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RemoteIdentity (LCOM4 4): RemoteIdentity\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":"packaging/release_candidate/remote_identity.rb"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2f15f4772a3839fa24a40501badebfc814793cfc623cc11af599aaff48b228"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/stages/review.rb: lib/hive/stages/review.rb changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 190 in Review.run_review_body! at line 158. 21 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/stages/review.rb\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":"lib/hive/stages/review.rb"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"8294e1da311b7ef6918cdd095b60712ca7bf4945b8bbd27d24f3af1c7e685881"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/daemon/dispatcher.rb: lib/hive/daemon/dispatcher.rb changed 60 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in Dispatcher.tick at line 336. 36 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/daemon/dispatcher.rb\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":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd89587717532d09d5748ff1c5c4053fe9780b4ca1aa804bd91979363a50fa9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/agent.rb: lib/hive/agent.rb changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 110 in Agent.spawn_and_wait at line 304. 14 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/agent.rb\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":"lib/hive/agent.rb"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"471c024b8eaa1966840eea2042924e9ce3072055df4de61cdc36e890500929d9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/operational_status.rb: lib/hive/operational_status.rb changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in OperationalStatus.reasons_for at line 1191. 23 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/operational_status.rb\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":"lib/hive/operational_status.rb"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"324f23ff99db51c65aa90d6be9298497c773d264b13aa4cf88711bf69fb1d381"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/attempts/supervisor.rb: lib/hive/attempts/supervisor.rb changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 99 in Supervisor.run_worker at line 380. 6 of those changes were fix/bug commits, and the other 6 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/attempts/supervisor.rb\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":"lib/hive/attempts/supervisor.rb"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"23bf8783fc46ba225e195db64c2af8bc49df8987cf0bdd4b50e0f1f231357fa0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/daemon/recovery_coordinator.rb: lib/hive/daemon/recovery_coordinator.rb changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in RecoveryCoordinator.request at line 288. 18 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/daemon/recovery_coordinator.rb\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":"lib/hive/daemon/recovery_coordinator.rb"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8deba2929f2aacbf6d012e87262accaa3dc1c912dac81390320bb0cc3317575"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/stages/base.rb: lib/hive/stages/base.rb changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 70 in Base.spawn_agent at line 974. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/stages/base.rb\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":"lib/hive/stages/base.rb"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f92f24812f45ed325512106eaffd28c44093cc9fee42aee7f7917aa50d35503"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/attempts/dispatcher.rb: lib/hive/attempts/dispatcher.rb changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in Dispatcher.admit at line 228. 10 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/attempts/dispatcher.rb\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":"lib/hive/attempts/dispatcher.rb"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"23446ae05d488c999d893d0792415f37602f940e4811c7e2c42273fceb356c95"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/cli.rb: lib/hive/cli.rb changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in CLI.daemon at line 2183. 14 of those changes were fix/bug commits, and the other 24 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/cli.rb\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":"lib/hive/cli.rb"},"region":{"startLine":2183}}}],"partialFingerprints":{"codehealthFindingId/v1":"901a3f8d3efaf1cf1bd2186cfa3df5daedd870cc269d47df2b428d86784f13fb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/config.rb: lib/hive/config.rb changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in Config.validate_daily_digest! at line 4554. 12 of those changes were fix/bug commits, and the other 22 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/config.rb\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":"lib/hive/config.rb"},"region":{"startLine":4554}}}],"partialFingerprints":{"codehealthFindingId/v1":"9194c03c9a144df52885ab4ec8c57fb33e86d5e9f76c55cf2b40e5d90773c590"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/plan_review/orchestrator.rb: lib/hive/plan_review/orchestrator.rb changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in Orchestrator.resume_review at line 178. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/plan_review/orchestrator.rb\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":"lib/hive/plan_review/orchestrator.rb"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd15462220128e8651c57bd78d9fefc8b3622d52ed74290f47c364f048f4602"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/commands/status.rb: lib/hive/commands/status.rb changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in Status.collect_rows at line 1576. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/commands/status.rb\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":"lib/hive/commands/status.rb"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"702efb10cae4388327a751933e4529ac77a15a492a686a80ba0ab086af61e42b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/stages/execute.rb: lib/hive/stages/execute.rb changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in Execute.run_pass at line 202. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/stages/execute.rb\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":"lib/hive/stages/execute.rb"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c8b8a70c7998772c78fd727a320165a9f5a6e62cf3e0205749f472069d20f4f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/task_closure.rb: lib/hive/task_closure.rb changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in TaskClosure.validate_receipt! at line 1093. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/task_closure.rb\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":"lib/hive/task_closure.rb"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34a681790e83e6204825131b58366a81a84894040ff4a7d343e025c6cff1665"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/stages/artifacts.rb: lib/hive/stages/artifacts.rb changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in Artifacts.run_outcome_evidence! at line 140. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/stages/artifacts.rb\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":"lib/hive/stages/artifacts.rb"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"32405f4b0635fecacf831bcfe1bf675222a06f68b530d027e1e932619a0123a2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/stages/review/ci_fix.rb: lib/hive/stages/review/ci_fix.rb changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in CiFix.run_ci_once at line 250. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/stages/review/ci_fix.rb\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":"lib/hive/stages/review/ci_fix.rb"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"19352e4bd02ea2ef2a1fee04d663adbfdd80eb15badb6c905f385a0202201fe2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/commands/daemon.rb: lib/hive/commands/daemon.rb changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Daemon.start_daemon at line 260. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/commands/daemon.rb\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":"lib/hive/commands/daemon.rb"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fdd46682597cd657814b433af6be54cb9ee49c807014a69bce9e10c8761029"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/task_action.rb: lib/hive/task_action.rb changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in TaskAction.plan_review_action at line 753. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/task_action.rb\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":"lib/hive/task_action.rb"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"017794bc6f3e67efcb7b49539200ce3a77294e53bb4c7279c687e73008bf43b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/commands/run.rb: lib/hive/commands/run.rb changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in Run.marker_next_action at line 534. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/commands/run.rb\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":"lib/hive/commands/run.rb"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"28396423eb232a40af1884a5683521b2746eab287bcd367e45cb5482c8dc5253"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/github_publication.rb: lib/hive/github_publication.rb changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in Controller.validate_state at line 1065. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/github_publication.rb\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":"lib/hive/github_publication.rb"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"3075b28be88f5ff5ffa9d4aba52ec4b6bd1ed7a8d5aa5182cf11dc5ac6f0309e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/runtime_control_plane/database.rb: lib/hive/runtime_control_plane/database.rb changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in Database.transaction at line 229. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/runtime_control_plane/database.rb\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":"lib/hive/runtime_control_plane/database.rb"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"4262883282379d45ee5d6903b74c89dfc9e8428000413955accaefb3f8874a59"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/plan_review/adapters/ce_doc_review.rb: lib/hive/plan_review/adapters/ce_doc_review.rb changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in CeDocReview.call at line 214. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/plan_review/adapters/ce_doc_review.rb\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":"lib/hive/plan_review/adapters/ce_doc_review.rb"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a19eb733c0c832c50a623a4a6554604db12e222fd5f7683c51008293b57765"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/commands/refactor_patrol.rb: lib/hive/commands/refactor_patrol.rb changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in RefactorPatrol.validate_mode! at line 544. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/commands/refactor_patrol.rb\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":"lib/hive/commands/refactor_patrol.rb"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a609ef3e93822ca65d2e4456758c30b54c98a54fe4539f6470e8ab31baebeb1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/daemon/stale_agent_healer.rb: lib/hive/daemon/stale_agent_healer.rb changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in StaleAgentHealer.heal_attempt_losses at line 118. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/daemon/stale_agent_healer.rb\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":"lib/hive/daemon/stale_agent_healer.rb"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"addd58ed980b2e23b7c65090db79bcc0bc954371a2e833680e8ffd07ef3f0721"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/stages/review/fix_guardrail.rb: lib/hive/stages/review/fix_guardrail.rb changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in FixGuardrail.scan_diff at line 192. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/stages/review/fix_guardrail.rb\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":"lib/hive/stages/review/fix_guardrail.rb"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"74686d4604f0feed8495a27c87a75cca84d45e26633514c67cbda8e2ef3e75c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/attempts/context.rb: lib/hive/attempts/context.rb changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Context.validate_task_binding! at line 190. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/attempts/context.rb\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":"lib/hive/attempts/context.rb"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c28ded17a37b50c2478f560cfe292b1206c1859b16cc197973e37bec4463fa1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/stages/finalize.rb: lib/hive/stages/finalize.rb changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in Finalize.run! at line 20. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/stages/finalize.rb\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":"lib/hive/stages/finalize.rb"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f23f81c2f449dfec034fd9a14cfbfb4b8207cd7c104c8ec4d3f9eacdc3826ba"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/commands/setup.rb: lib/hive/commands/setup.rb changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Setup.call at line 79. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/commands/setup.rb\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":"lib/hive/commands/setup.rb"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"071c2e5ebea605a5cbd719de3143241bd3a954d51a3f2c148737e3eaa85be805"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/babysitter/project_tick.rb: lib/hive/babysitter/project_tick.rb changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in ProjectTick.run at line 31. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/babysitter/project_tick.rb\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":"lib/hive/babysitter/project_tick.rb"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd93db99ba246eafa166ac8cdd43f15d3176adfab280176ab3b43387d69f703"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/daemon/refactor_patrol_scheduler.rb: lib/hive/daemon/refactor_patrol_scheduler.rb changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in RefactorPatrolScheduler.reserve at line 255. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/daemon/refactor_patrol_scheduler.rb\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":"lib/hive/daemon/refactor_patrol_scheduler.rb"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de3dbbf6361db7241b73f1e24731740ec9050ccd892555d79fec76ef071f16c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/git_ops.rb: lib/hive/git_ops.rb changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in GitOps.hive_commit at line 295. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/git_ops.rb\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":"lib/hive/git_ops.rb"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"006b62f66cfa3729941e65cf1b82bfcd2338f98737f84cfbed81fbc87dcca748"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/command_operation.rb: lib/hive/command_operation.rb changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in CommandOperation.call at line 189. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/command_operation.rb\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":"lib/hive/command_operation.rb"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc03dde08e7cc5ec34c490e2c69534d1debee9647e32b3edb3b17cf1f3f26bd1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/attempts/detached_launcher.rb: lib/hive/attempts/detached_launcher.rb changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in DetachedLauncher.launch at line 81. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/attempts/detached_launcher.rb\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":"lib/hive/attempts/detached_launcher.rb"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa54a353d63a15af5421f34c72dbdd2b746e9c89a96a1de9235a150da4582f5a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/attempts/reconciler.rb: lib/hive/attempts/reconciler.rb changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in Reconciler.completion_first_disposition at line 291. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/attempts/reconciler.rb\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":"lib/hive/attempts/reconciler.rb"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a8027321f467e4add574b9c7629a631e4b067cf80630fecd47f3191c63a1f4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/babysitter/pr_fixer.rb: lib/hive/babysitter/pr_fixer.rb changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in PrFixer.run at line 50. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/babysitter/pr_fixer.rb\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":"lib/hive/babysitter/pr_fixer.rb"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4279d9f3fc124a55b38a5376851874d7b76b8df9efe384abdef215c9fd35450"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/stages/patrol_fix/fix.rb: lib/hive/stages/patrol_fix/fix.rb changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Fix.fix_authorization at line 164. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/stages/patrol_fix/fix.rb\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":"lib/hive/stages/patrol_fix/fix.rb"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"5802962672617546a807332823416954b900cd0cc404f479dfdf49bc109f1d48"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: components/agent-cli-runtime/lib/agent_cli_runtime/opencode/probe.rb: components/agent-cli-runtime/lib/agent_cli_runtime/opencode/probe.rb changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in Probe.call! at line 57. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- components/agent-cli-runtime/lib/agent_cli_runtime/opencode/probe.rb\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":"components/agent-cli-runtime/lib/agent_cli_runtime/opencode/probe.rb"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a60ee8847a2636ce0502421b7f76bb0d6d7718a5ddfbd412b8cb44669af41d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/stages/review/remote_ci.rb: lib/hive/stages/review/remote_ci.rb changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Runner.wait_for_settlement! at line 236. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/stages/review/remote_ci.rb\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":"lib/hive/stages/review/remote_ci.rb"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1fa718b3232ce67e55d7b41fb03de92dce50840109ac36454292a69f30f714"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/stages/managed_agent_custody.rb: lib/hive/stages/managed_agent_custody.rb changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in ManagedAgentCustody.launch_agent at line 26. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/stages/managed_agent_custody.rb\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":"lib/hive/stages/managed_agent_custody.rb"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb808f46ef390d6d58b80023e6598bee8c6557450e1a27d567e4080eb993de4e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/daemon/patrol_scheduler.rb: lib/hive/daemon/patrol_scheduler.rb changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in PatrolScheduler.candidates at line 76. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/daemon/patrol_scheduler.rb\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":"lib/hive/daemon/patrol_scheduler.rb"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"31df32673abd2020d25be5d1309baf74e27a243a118661fced15a41a480775b5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/task_meta.rb: lib/hive/task_meta.rb changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in TaskMeta.read at line 233. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/task_meta.rb\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":"lib/hive/task_meta.rb"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4643df2929c98c40b3dc58e3074892a2eaf5b649b39fdddd49748ecc590d653"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/dependency_snapshot.rb: lib/hive/dependency_snapshot.rb changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in DependencySnapshot.base_selection at line 111. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/dependency_snapshot.rb\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":"lib/hive/dependency_snapshot.rb"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb81c3ade01bfd1a5e954119a4d9c49c126b416176e73b0a9737a62db427b189"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/artifacts/capture_toolkit.rb: lib/hive/artifacts/capture_toolkit.rb changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in CaptureToolkit.prepare! at line 66. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/artifacts/capture_toolkit.rb\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":"lib/hive/artifacts/capture_toolkit.rb"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f54696a3b8e81b3a8dd4f2653e3b05842f51a5a0e6662dc1c03d3f93263d0bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/patrol_fix/projection.rb: lib/hive/patrol_fix/projection.rb changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in Projection.project at line 37. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/patrol_fix/projection.rb\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":"lib/hive/patrol_fix/projection.rb"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"599857768b70a4573496513736915fd599cbf1a8f5c1258b0d6b1cc051a694d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/runtime_control_plane/admission_transition.rb: lib/hive/runtime_control_plane/admission_transition.rb changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in AdmissionTransition.claim_request! at line 111. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/runtime_control_plane/admission_transition.rb\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":"lib/hive/runtime_control_plane/admission_transition.rb"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"951807622561116e11006cc50da0d5aa861a42b3e3bede34cf9da2b9a9cab7ad"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/stages/agent_worktree.rb: lib/hive/stages/agent_worktree.rb changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in AgentWorktree.run! at line 33. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/stages/agent_worktree.rb\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":"lib/hive/stages/agent_worktree.rb"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b695c490dc7168aa64965c0e941935f78de406c42806a805673e32cb22c23c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/stages/patrol_fix/publish.rb: lib/hive/stages/patrol_fix/publish.rb changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Publish.exact_snapshot! at line 180. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/stages/patrol_fix/publish.rb\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":"lib/hive/stages/patrol_fix/publish.rb"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"4028c2a20387d71950bd39c71aa99d378152650e97a1e7f7618a6eb9e524ff36"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/attempts/record.rb: lib/hive/attempts/record.rb changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Record.validate_subject! at line 414. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/attempts/record.rb\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":"lib/hive/attempts/record.rb"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bcfc43d07521f9c9f5fc8accd982a5b1a4554c5b5004c0e8b525704053430da"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/refactor_patrol/job_record_validator.rb: lib/hive/refactor_patrol/job_record_validator.rb changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in JobRecordValidator.validate_publication_receipts! at line 978. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/refactor_patrol/job_record_validator.rb\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":"lib/hive/refactor_patrol/job_record_validator.rb"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b64cde435f69793b9e25cd04319d45bcdcc26615da59de10c681f05bff10ef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/running_status.rb: lib/hive/running_status.rb changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in RunningStatus.each_active_lease_row at line 76. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/running_status.rb\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":"lib/hive/running_status.rb"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7acfbc3dfb3467931b3d6a5d755850b41a16065fac3e966e4790d1146a31795"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/workflow_package/task_migrator.rb: lib/hive/workflow_package/task_migrator.rb changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in TaskMigrator.build_plan at line 108. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/workflow_package/task_migrator.rb\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":"lib/hive/workflow_package/task_migrator.rb"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"44dc830006ca59a66fc4c28dfe4d49bcb642cc917518205eb3ecbf63dfec2db2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/patrol_fix/worktree_snapshot.rb: lib/hive/patrol_fix/worktree_snapshot.rb changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in WorktreeSnapshot.capture at line 14. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/patrol_fix/worktree_snapshot.rb\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":"lib/hive/patrol_fix/worktree_snapshot.rb"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c4f220f619ecb0d66ca03ab341e66f94fcb5b037f9d5223d618b3ff4615bbb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/daily_digest/reader.rb: lib/hive/daily_digest/reader.rb changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Reader.read_view at line 36. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/daily_digest/reader.rb\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":"lib/hive/daily_digest/reader.rb"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ad811a22d7c800ccbda899df5a31e7067261eb0d2b4b3d5a4b89b499509d35"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/conditions/transition_guard.rb: lib/hive/conditions/transition_guard.rb changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in TransitionGuard.validate! at line 19. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/conditions/transition_guard.rb\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":"lib/hive/conditions/transition_guard.rb"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5265017d79e6746c88c0afc68ec76210ab952f1481db8a252194311a8ef35f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/refactor_patrol/github_gateway.rb: lib/hive/refactor_patrol/github_gateway.rb changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in GithubGateway.merged_pr_details at line 40. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/refactor_patrol/github_gateway.rb\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":"lib/hive/refactor_patrol/github_gateway.rb"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"2118504fc40c459c4b17ec2e8b1aed4de31572728cf882f39bc37297d5d9e6d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/command_receipt_pruner.rb: lib/hive/command_receipt_pruner.rb changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in CommandReceiptPruner.prune at line 85. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/command_receipt_pruner.rb\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":"lib/hive/command_receipt_pruner.rb"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"0363b4abdcd44a40dac2aaaab9d51b90ae8337131b393762c1e2c6a79927eadc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/one_shot/process_executor.rb: lib/hive/one_shot/process_executor.rb changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ProcessExecutor.call at line 59. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/one_shot/process_executor.rb\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":"lib/hive/one_shot/process_executor.rb"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ee0436c764ffc91641588c4251a0ca3605f9e90be80ed6f66f5d4f0fa5acaf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/hive/attempts/process_identity.rb: lib/hive/attempts/process_identity.rb changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in ProcessIdentity.terminate_orphan_group 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/attempts/process_identity.rb\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":"lib/hive/attempts/process_identity.rb"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"16389d73c819412cbd9946407ca1c5af9612f06a2f22646ee507bcdd5e237015"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/hive/daemon/logger.rb: lib/hive/daemon/logger.rb changed 17 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is Logger.rotate_if_needed! at line 169), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: reduce SQLite hot-write contention and bound bookkeeping retries (#1591)\u201D; \u201Cfix(daemon): log and surface operational snapshot publication failures (#1617)\u201D; \u201Cfix(daemon): stop redispatching identical plan-review-run failures (#1613)\u201D; \u201Cfix(daemon): survive runtime database lock contention instead of exiting (#1608)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/daemon/logger.rb\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":"lib/hive/daemon/logger.rb"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e391a383b6e2be369dbf9ee264d9d70c18d7d7918265175399a7a40c0f4f3b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/hive/stages/plan.rb: lib/hive/stages/plan.rb changed 11 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is Plan.carried_decisions_text at line 141), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(plan): adopt plan dependencies after review revisions and for supersets (#1573)\u201D; \u201Cfix: batch the finished Hive-task PRs and Actions billing holds (#1545)\u201D; \u201Cfix(plan): re-running a cleared, current plan no longer respawns the planner (#1493)\u201D; \u201Cfix(plan): plan and review against the revision execution will use (#1479)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/stages/plan.rb\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":"lib/hive/stages/plan.rb"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"2124b9a66d83bd7076bf10464308ead61e2632df7a413b8c304160a1d8953dea"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: components/agent-cli-runtime/lib/agent_cli_runtime/profiles.rb: components/agent-cli-runtime/lib/agent_cli_runtime/profiles.rb changed 8 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is Profiles.grok_auth_path at line 90), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(opencode): run OpenCode commands on a private server when supported (#1647)\u201D; \u201Cfix(agent-cli-runtime): codex retry notices no longer mask the terminal provider error (#1485)\u201D; \u201Cfix: recover tasks after PR rewrites and stale validation (#1422)\u201D; \u201CFix Claude structured quota recovery (#1359)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- components/agent-cli-runtime/lib/agent_cli_runtime/profiles.rb\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":"components/agent-cli-runtime/lib/agent_cli_runtime/profiles.rb"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15bfdb9035e0e004c7f7751e7a049e4bd5fa52e2861f060670f0e1fc170f7fb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/hive/gh.rb: lib/hive/gh.rb changed 7 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is Gh.required_status_check_contexts at line 622), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(review): require protected checks in hosted CI gate; scope review comment dedupe to generation (#1630)\u201D; \u201Cfix(review,approve): block conflicting PRs in hosted CI gate; archive review passes on rewind (#1629)\u201D; \u201Cfix: publish review fixes before exact-head verification (#1580)\u201D; \u201Cfix: unblock publication with bundled Betterleaks scanning (#1403)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/gh.rb\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":"lib/hive/gh.rb"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b292355cd3918ac4e6429ecbe168c39e87e4655ddc099bcb634a16515e7d45"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: templates/builtins/bench/runtime/harness/lib/codex_judge.rb: templates/builtins/bench/runtime/harness/lib/codex_judge.rb changed 7 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is CodexJudge.judge_fn at line 39), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(bench): enforce one campaign contract before spend (#1307)\u201D; \u201Cfix(bench): retry deliberation provider limits (#1217)\u201D; \u201Cfix(bench): isolate ChatGPT Codex judges (#1207)\u201D; \u201Cfix(bench): isolate OpenRouter Codex judges (#1206)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- templates/builtins/bench/runtime/harness/lib/codex_judge.rb\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":"templates/builtins/bench/runtime/harness/lib/codex_judge.rb"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a306181355ef065f4e718aca974aab3a227d9ff6421ea3fca9faeb8243792e5c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/hive/lock.rb: lib/hive/lock.rb changed 8 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is Lock.ps_lstart_start_time at line 194), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: batch the finished Hive-task PRs and Actions billing holds (#1545)\u201D; \u201Cfix(lock): wait for commit queues and report SQLite contention as retryable (#1474)\u201D; \u201Cfix: keep interrupted tasks retrying without runaway dispatch (#1415)\u201D; \u201Cfix(daemon): clear completed agent child identity (#1343)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/lock.rb\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":"lib/hive/lock.rb"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07a5c141664c56018168afa13f2cb398195ea3bec97840055da90cc4a7dd529"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/hive/stages/open_pr.rb: lib/hive/stages/open_pr.rb changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is OpenPr.read_authoring at line 327), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(agent): stop tasks on a provider-refused model instead of retrying it as a limit (#1546)\u201D; \u201Cfix(limits): treat Codex plan-model walls as limits and honor them in open-PR (#1473)\u201D; \u201Cfix(opencode): reap escaped processes and finish authoring safely (#1172)\u201D; \u201Cfix: recover tasks after PR rewrites and stale validation (#1422)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/stages/open_pr.rb\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":"lib/hive/stages/open_pr.rb"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"3edd822c7f333aaa9af4413a5897e4f8e4e89a51e018109acef76254ecdd9b44"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/hive/errors.rb: lib/hive/errors.rb changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is InternalError.sqlite_busy? at line 287), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: reduce SQLite hot-write contention and bound bookkeeping retries (#1591)\u201D; \u201Cfix(archive,finalize): require merged PR to archive; re-check summary.md completion (#1628)\u201D; \u201Cfix: attach guarded workflow retries without a daemon (#1625)\u201D; \u201Cfix(new): keep --idempotency-key working when command receipts are not installed (#1536)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/errors.rb\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":"lib/hive/errors.rb"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d4b23c198c5f5815d11301a1d0c1010cd2899580d8ce3411e1e9c34fd733d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/hive/plan_review/planner_revision.rb: lib/hive/plan_review/planner_revision.rb 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 11 (its worst body is HiveRunner.call at line 36), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: reassess plan review gates before operator escalation (#1432)\u201D; \u201Cfix(pi): preserve workflow progress and complete evidence capture (#1171)\u201D; \u201Cfix(plan-review): recover planner revisions via fallback (#1358)\u201D; \u201Cfix(opencode): make prepared startup reliable (#1170)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/plan_review/planner_revision.rb\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":"lib/hive/plan_review/planner_revision.rb"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aaad78e39341f79dfb2c024b7c4c5946568a88bd79f70545eb267cdd15c6e3f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/hive/plan_review/transition_guard.rb: lib/hive/plan_review/transition_guard.rb changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is TransitionGuard.legacy_adoption_valid? at line 287), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(execute): stop a plan-review-refused execute entry for the operator instead of retrying it (#1648)\u201D; \u201Cfix(plan): adopt plan dependencies after review revisions and for supersets (#1573)\u201D; \u201Cfix: recover pending plan revisions through verification (#1434)\u201D; \u201Cfix(plan-review): preserve clearance for reviewed rework (#1364)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/plan_review/transition_guard.rb\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":"lib/hive/plan_review/transition_guard.rb"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1a0b91b1c4569b8eb6b260755456d70f75e710a5810bef561ef384792fedd1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/hive/daily_digest/hold_observer.rb: lib/hive/daily_digest/hold_observer.rb changed 5 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 12 (its worst body is HoldObserver.record at line 23), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(execute): stop a plan-review-refused execute entry for the operator instead of retrying it (#1648)\u201D; \u201Cfix(custody): treat task-journal.jsonl as an append-only controller log (#1611)\u201D; \u201Cfix(agent): stop tasks on a provider-refused model instead of retrying it as a limit (#1546)\u201D; \u201Cfix(daemon): defer digest hold journal writes while the task lock is live (#1521)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/daily_digest/hold_observer.rb\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":"lib/hive/daily_digest/hold_observer.rb"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"014be2976a48d30facc523cd5770201e26ee167ccdd9670c33de8d5c14cbc3ef"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/hive/recovery.rb: lib/hive/recovery.rb changed 5 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is Recovery.review_stale_recovery_state at line 115), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(execute): stop a plan-review-refused execute entry for the operator instead of retrying it (#1648)\u201D; \u201Cfix(recovery): resume answered max-pass REVIEW_STALE via workflow.retry (#1644)\u201D; \u201Cfix: publish review fixes before exact-head verification (#1580)\u201D; \u201Cfix(daemon): publish binary-tagged UTF-8 status\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/recovery.rb\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":"lib/hive/recovery.rb"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffff80591d62b6b9a79f88b32110ddbe558bada5fbf31c7129d9739ddb2e1fbf"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/hive/markers.rb: lib/hive/markers.rb changed 5 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 12 (its worst body is Markers.write_atomic at line 267), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(review): surface unpublished residual commits after agent failures (#1634)\u201D; \u201CFix UTF-8 marker serialization hiding projects from daemon status (#1556)\u201D; \u201Cfix(pi): preserve workflow progress and complete evidence capture (#1171)\u201D; \u201Cfix(patrol): recover stage transitions and markerless exits (#1221)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/markers.rb\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":"lib/hive/markers.rb"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"9489a6689c8c5877a624216c256c386ffb073f0febb40cabd72a67c5d36610b4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/hive/plan_review/decision_service.rb: lib/hive/plan_review/decision_service.rb changed 5 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 DecisionService.normalize_value at line 181), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(plan-review): restart stale reviews; keep and bound rejected reviewer output (#1614)\u201D; \u201Cfix(plan-review): let operators answer gated findings with a chosen alternative (#1567)\u201D; \u201Cfix: reassess plan review gates before operator escalation (#1432)\u201D; \u201Cfix: preserve main Claude reviewer identity across subagents (#1430)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/plan_review/decision_service.rb\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":"lib/hive/plan_review/decision_service.rb"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"667bc60d487c751095d7cfda378c7ca0d2e258a3c01d8cf103020cdc0e423aa6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/hive/artifacts/outcome_evidence/contract.rb: lib/hive/artifacts/outcome_evidence/contract.rb changed 5 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 Contract.review! at line 60), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(evidence): downgrade accepted wrong-kind proof to a recorded revise (#1497)\u201D; \u201Cfix(pi): preserve workflow progress and complete evidence capture (#1171)\u201D; \u201Cfix: unblock publication with bundled Betterleaks scanning (#1403)\u201D; \u201Cfix(artifacts): return implementation defects to execute (#1351)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/artifacts/outcome_evidence/contract.rb\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":"lib/hive/artifacts/outcome_evidence/contract.rb"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"7972885374ca8a89fc9b51b336952cb24a080f1d62484620ab48033987ddf2c1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/app/controllers/status_controller.rb: web/app/controllers/status_controller.rb changed 5 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 15 (its worst body is StatusController.index at line 6), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): keep project navigation responsive during history refreshes (#1464)\u201D; \u201Cfix(web): show completed tasks on normal project boards (#1454)\u201D; \u201Cfix(web): show completed workflow tasks in a Done board (#1452)\u201D; \u201Cfix(web): show saved status immediately after restart (#1444)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- web/app/controllers/status_controller.rb\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":"web/app/controllers/status_controller.rb"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42aa6ce2d627910e3e4604e82a9a89ce21c2072d1f725edb22caa24797caf06"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/hive/web/status_feed.rb: lib/hive/web/status_feed.rb changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is StatusFeed.overlay_operational_recoveries at line 346), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): remove historical reviewer routes from web status (#1466)\u201D; \u201Cfix(web): show saved status immediately after restart (#1444)\u201D; \u201Cfix(web): make the status command contract authoritative\u201D; \u201Cfix(status): preserve completed scheduler snapshots (#1287)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/web/status_feed.rb\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":"lib/hive/web/status_feed.rb"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"1676c426cac6a22f77340252999bdc7f1c64d86240d820a6a7d2c2456c26127e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/hive/agent_skills/inspector.rb: lib/hive/agent_skills/inspector.rb changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is Inspector.inspect_resolution at line 433), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(skills): treat an outranked foreign skill as missing, not conflicting (#1604)\u201D; \u201Cfix(doctor): accept commit-SHA plugin versions for unconstrained packages (#1566)\u201D; \u201Cfix: harden web and agent lifecycle boundaries (#1306)\u201D; \u201Cfix(opencode): make prepared startup reliable (#1170)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/agent_skills/inspector.rb\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":"lib/hive/agent_skills/inspector.rb"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee0fd86dfb42d474e67391ce1c209cee70599939a4325104ba0f7358bab5f59"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/hive/runtime_control_plane.rb: lib/hive/runtime_control_plane.rb changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is RuntimeControlPlane.database at line 80), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: reduce SQLite hot-write contention and bound bookkeeping retries (#1591)\u201D; \u201Cfix: make status resilient to runtime database contention (#1574)\u201D; \u201Cfix: batch the finished Hive-task PRs and Actions billing holds (#1545)\u201D; \u201Cfix(lock): wait for commit queues and report SQLite contention as retryable (#1474)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/runtime_control_plane.rb\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":"lib/hive/runtime_control_plane.rb"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0cde441cff8bf525d7dae816aad1917af193ea85ad19c1cfbb036d94445192"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: components/agent-cli-runtime/lib/agent_cli_runtime/error_extractors.rb: components/agent-cli-runtime/lib/agent_cli_runtime/error_extractors.rb changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is ErrorExtractors.opencode_error_message at line 111), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(digest): read OpenCode 2.x errors and surface failed generations (#1619)\u201D; \u201Cfix(agent-cli-runtime): codex retry notices no longer mask the terminal provider error (#1485)\u201D; \u201CFix Claude structured quota recovery (#1359)\u201D; \u201Cfix(opencode): retry structured provider limits (#1201)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- components/agent-cli-runtime/lib/agent_cli_runtime/error_extractors.rb\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":"components/agent-cli-runtime/lib/agent_cli_runtime/error_extractors.rb"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"38943f1fd2a1473758907208a529b9f97c6e43f67fd2355eb123831d81380999"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: components/agent-cli-runtime/lib/agent_cli_runtime/profile.rb: components/agent-cli-runtime/lib/agent_cli_runtime/profile.rb changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is Profile.initialize at line 35), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: harden web and agent lifecycle boundaries (#1306)\u201D; \u201Cfix(bench): make OpenCode campaigns recover reliably (#1169)\u201D; \u201Cfix(opencode): make prepared startup reliable (#1170)\u201D; \u201Cfix(agents): make Pi workflows autonomous and review-safe (#1148)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- components/agent-cli-runtime/lib/agent_cli_runtime/profile.rb\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":"components/agent-cli-runtime/lib/agent_cli_runtime/profile.rb"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bcd8c9cf9bdbdcde4b896ac8a9a338ce487821e3bc893b61fe37ed46fba314d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/hive/stages/review/github_publisher.rb: lib/hive/stages/review/github_publisher.rb 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 11 (its worst body is GithubPublisher.publish! at line 16), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(review): require protected checks in hosted CI gate; scope review comment dedupe to generation (#1630)\u201D; \u201Cfix: unblock review publication and make artifacts best effort (#1413)\u201D; \u201Cfix: unblock publication with bundled Betterleaks scanning (#1403)\u201D; \u201Cfix(review): route publisher dedupe probe through configured GitHub invocation\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/stages/review/github_publisher.rb\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":"lib/hive/stages/review/github_publisher.rb"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"116eeb1443f51cc6cec4e04e3492050aea198c0bd7d8467827b3674fc4aeb526"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/hive/babysitter/events.rb: lib/hive/babysitter/events.rb 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 3 (its worst body is Events.emit at line 42), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(agent): stop tasks on a provider-refused model instead of retrying it as a limit (#1546)\u201D; \u201Cfix: batch the finished Hive-task PRs and Actions billing holds (#1545)\u201D; \u201Cfix(babysitter): hold on provider usage limits and lead give-up comments with the error (#1534)\u201D; \u201Cfix(babysitter): stop admitting work after shutdown (#1275)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/babysitter/events.rb\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":"lib/hive/babysitter/events.rb"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8194b9c9aabc9bc6e069f8602b561e08197e3d5433f50888f93836a8ab04bad"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: components/agent-cli-runtime/lib/agent_cli_runtime/values.rb: components/agent-cli-runtime/lib/agent_cli_runtime/values.rb 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 5 (its worst body is Immutable.deep at line 43), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: batch Patrol fixes and the review guardrail attribution fix (#1535)\u201D; \u201Cfix: harden web and agent lifecycle boundaries (#1306)\u201D; \u201Cfix(opencode): make prepared startup reliable (#1170)\u201D; \u201Cfix(agents): make Pi workflows autonomous and review-safe (#1148)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- components/agent-cli-runtime/lib/agent_cli_runtime/values.rb\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":"components/agent-cli-runtime/lib/agent_cli_runtime/values.rb"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc133c6e5b905040dbed21118d5a6316d79b2c7b9a09a4efb5e25ffe5d51e1b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/hive/plan_review/policy.rb: lib/hive/plan_review/policy.rb 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 4 (its worst body is Policy.evaluate at line 28), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(pi): preserve workflow progress and complete evidence capture (#1171)\u201D; \u201Cfix(plan-review): recover planner revisions via fallback (#1358)\u201D; \u201Cfix(opencode): make prepared startup reliable (#1170)\u201D; \u201Cfix(agents): make Pi workflows autonomous and review-safe (#1148)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/plan_review/policy.rb\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":"lib/hive/plan_review/policy.rb"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1016756a74c20181d763a912269eba392381a685399958ef1c9c7ee4a7c3cdc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/hive/stages/auto_commit.rb: lib/hive/stages/auto_commit.rb 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 11 (its worst body is AutoCommit.staged_index_entries at line 209), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(pi): preserve workflow progress and complete evidence capture (#1171)\u201D; \u201Cfix: unblock publication with bundled Betterleaks scanning (#1403)\u201D; \u201Cfix(worktree): restore native residue recovery (#1200)\u201D; \u201Cfix(agents): make Pi workflows autonomous and review-safe (#1148)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/stages/auto_commit.rb\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":"lib/hive/stages/auto_commit.rb"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67af2239e98a92c93267fa5a13a5633fe4d77ab870b68a6e394ea7688163e22"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: templates/builtins/bench/runtime/harness/lib/claude_judge.rb: templates/builtins/bench/runtime/harness/lib/claude_judge.rb 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 8 (its worst body is ClaudeJudge.structured_limit_detail at line 83), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(bench): recognize Claude usage-credit banner (#1312)\u201D; \u201Cfix(bench): recognize Claude structured quota results (#1311)\u201D; \u201Cfix(bench): recognize Claude stdout quota banner (#1219)\u201D; \u201Cfix(bench): make OpenCode campaigns recover reliably (#1169)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- templates/builtins/bench/runtime/harness/lib/claude_judge.rb\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":"templates/builtins/bench/runtime/harness/lib/claude_judge.rb"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba0d1a9a5623e2dfff62b9dfe97ed8b7edcd5acbe63469899447bc3fb88b61f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/hive/conditions/reconcilers/execute.rb: lib/hive/conditions/reconcilers/execute.rb changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is Execute.build_observations at line 81), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: reduce SQLite hot-write contention and bound bookkeeping retries (#1591)\u201D; \u201Cfix: harden control-plane recovery and validation (#1301)\u201D; \u201Cfix(agents): make Pi workflows autonomous and review-safe (#1148)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/conditions/reconcilers/execute.rb\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":"lib/hive/conditions/reconcilers/execute.rb"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"02084e7de881248690af00be108f7b4b6037806576a2820461e9c33ab61c69b8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: components/agent-cli-runtime/lib/agent_cli_runtime/opencode/overlay.rb: components/agent-cli-runtime/lib/agent_cli_runtime/opencode/overlay.rb changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is Cleanup.call at line 23), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(opencode): run OpenCode commands on a private server when supported (#1647)\u201D; \u201Cfix: harden web and agent lifecycle boundaries (#1306)\u201D; \u201Cfix(opencode): make prepared startup reliable (#1170)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- components/agent-cli-runtime/lib/agent_cli_runtime/opencode/overlay.rb\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":"components/agent-cli-runtime/lib/agent_cli_runtime/opencode/overlay.rb"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"801e7fda3c44f4212aa89a54bcdb54b2d38ca752e9d782112dcbffea658a5962"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/hive/artifact_firewall.rb: lib/hive/artifact_firewall.rb changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is ArtifactFirewall.protected_violation_kind at line 599), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(custody): treat task-journal.jsonl as an append-only controller log (#1611)\u201D; \u201Cfix(patrol): recover OpenCode reports and stalled tasks (#1194)\u201D; \u201Cfix(agents): make Pi workflows autonomous and review-safe (#1148)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/artifact_firewall.rb\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":"lib/hive/artifact_firewall.rb"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e82912b952551e6a2b9b88c09a4e2d8b8dab2bc0ff4b77b15654c5bcedfe5f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/hive/plan_review/route_resolver.rb: lib/hive/plan_review/route_resolver.rb changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is RouteResolver.attest_observed_identity at line 186), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(plan-review): let Codex attest its OpenAI family without a served model (#1607)\u201D; \u201Cfix(plan-review): recover reviewer capability automatically (#1323)\u201D; \u201Cfix(agents): make Pi workflows autonomous and review-safe (#1148)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/plan_review/route_resolver.rb\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":"lib/hive/plan_review/route_resolver.rb"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"77cc9d841f2609f012e5bf8f6ac5c82a16999f909f304dd559591747a8e676ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: components/agent-cli-runtime/lib/agent_cli_runtime/runtime.rb: components/agent-cli-runtime/lib/agent_cli_runtime/runtime.rb changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is Runtime.compile at line 5), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(agent-cli-runtime): codex retry notices no longer mask the terminal provider error (#1485)\u201D; \u201Cfix(agent): classify Grok HTTP 402 as a provider limit (#1346)\u201D; \u201Cfix(agents): make Pi workflows autonomous and review-safe (#1148)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- components/agent-cli-runtime/lib/agent_cli_runtime/runtime.rb\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":"components/agent-cli-runtime/lib/agent_cli_runtime/runtime.rb"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"9501b593a0e3df05a21a9364f0b7a2af26b0460125af872ab0ffc31a8b99d7cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/hive/dependency_admission.rb: lib/hive/dependency_admission.rb changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is Context.walk at line 198), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(plan): adopt plan dependencies after review revisions and for supersets (#1573)\u201D; \u201Cfix: batch the finished Hive-task PRs and Actions billing holds (#1545)\u201D; \u201Cfix(archive): cancel unwanted tasks without claiming delivery (#1423)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/dependency_admission.rb\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":"lib/hive/dependency_admission.rb"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c01d5e48fb097f4a6f2a72131e7d7f9caf1a764380c1889d45bfcde3837d2a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: templates/builtins/bench/runtime/harness/lib/hive_config.rb: templates/builtins/bench/runtime/harness/lib/hive_config.rb changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is HiveConfig.route_for at line 113), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(bench): route Ox Alpha through disclosed model (#1246)\u201D; \u201Cfix(bench): validate dogfood OpenCode runtime (#1244)\u201D; \u201Cfix(bench): package Ox Alpha max runtime (#1243)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- templates/builtins/bench/runtime/harness/lib/hive_config.rb\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":"templates/builtins/bench/runtime/harness/lib/hive_config.rb"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"65fd1beadd56bde59f78970d4191378c07d79ef90d6a63dcdcc0df960a4081c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/app/models/status_broadcaster.rb: web/app/models/status_broadcaster.rb changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is StatusBroadcaster.start_unlocked! at line 159), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): keep project navigation responsive during history refreshes (#1464)\u201D; \u201Cfix(web): show completed tasks on normal project boards (#1454)\u201D; \u201Cfix(web): show saved status immediately after restart (#1444)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- web/app/models/status_broadcaster.rb\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":"web/app/models/status_broadcaster.rb"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"d614cdf12e8e328d54ad0b90e0f38fa014a69816859e79672565ae087ffe6461"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/app/models/board.rb: web/app/models/board.rb changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is Board.bands_for at line 37), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): keep project navigation responsive during history refreshes (#1464)\u201D; \u201Cfix(web): show finished workflow deliveries in Done (#1463)\u201D; \u201Cfix(web): preserve current task state and fold kanban clutter (#1399)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- web/app/models/board.rb\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":"web/app/models/board.rb"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce4a8e7b90acb092afdc0a88c843f8639a2c8bcf79dd350b80d33d31c2cbb90c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/hive/plan_review.rb: lib/hive/plan_review.rb changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is PlanReview.deep_freeze at line 62), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(execute): stop a plan-review-refused execute entry for the operator instead of retrying it (#1648)\u201D; \u201Cfix(pi): preserve workflow progress and complete evidence capture (#1171)\u201D; \u201Cfix(agents): make Pi workflows autonomous and review-safe (#1148)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/plan_review.rb\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":"lib/hive/plan_review.rb"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"403fe71cc5bdff24d6939d7e47c38e6c601ab405b5ee139198fe9385bfed4893"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/hive/bot/handlers/callback_handlers.rb: lib/hive/bot/handlers/callback_handlers.rb changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is CallbackHandlers.approve_plan at line 225), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: publish review fixes before exact-head verification (#1580)\u201D; \u201Cfix: batch Patrol fixes and the review guardrail attribution fix (#1535)\u201D; \u201Cfix(artifacts): return implementation defects to execute (#1351)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/bot/handlers/callback_handlers.rb\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":"lib/hive/bot/handlers/callback_handlers.rb"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e565cb716a51a6143a741616a5b38f9751646f75756b2ca8a363ba3fd8c43a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/hive/plan_review/store.rb: lib/hive/plan_review/store.rb changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is Store.progress_token at line 147), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(plan-review): restart stale reviews; keep and bound rejected reviewer output (#1614)\u201D; \u201Cfix: batch the finished Hive-task PRs and Actions billing holds (#1545)\u201D; \u201Cfix(agents): make Pi workflows autonomous and review-safe (#1148)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/plan_review/store.rb\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":"lib/hive/plan_review/store.rb"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa6fd47edaf80d6e7424624c50373eb5684247fcfbc242d848726b000c77a07"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/hive/plan_review/plan_signals.rb: lib/hive/plan_review/plan_signals.rb changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is PlanSignals.analyze at line 59), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(plan-review): slice plan text by characters, not bytes (#1596)\u201D; \u201Cfix: unblock publication with bundled Betterleaks scanning (#1403)\u201D; \u201Cfix(plan-review): prevent avoidable review stalls (#1354)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/plan_review/plan_signals.rb\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":"lib/hive/plan_review/plan_signals.rb"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b16650f694cc468096fcf14bf36db201e78df42871d6dd8b86e0e222cd92899"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/hive/brainstorm_parser.rb: lib/hive/brainstorm_parser.rb changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is BrainstormParser.parse_text at line 69), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(brainstorm): restore escaped answer lines as UTF-8 (#1575)\u201D; \u201Cfix: batch Patrol fixes and the review guardrail attribution fix (#1535)\u201D; \u201Cfix(opencode): make prepared startup reliable (#1170)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/brainstorm_parser.rb\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":"lib/hive/brainstorm_parser.rb"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"250ae709d467a74cb3a6300b2046cbac6dbffe7c2a06cd1eebfa853f20fd4fa5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/hive/daemon/auto_retry_safety.rb: lib/hive/daemon/auto_retry_safety.rb changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is AutoRetrySafety.safe_to_retry? at line 28), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: batch the Codex reviewer isolation, review quota and recovery identity fixes (#1544)\u201D; \u201Cfix: unblock publication with bundled Betterleaks scanning (#1403)\u201D; \u201Cfix(opencode): make prepared startup reliable (#1170)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/daemon/auto_retry_safety.rb\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":"lib/hive/daemon/auto_retry_safety.rb"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"34860f2b76fdb7b21867902bf2fb1c759d021498dc89dc20b401a3cb8ae31722"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/hive/stages/clean_exit.rb: lib/hive/stages/clean_exit.rb changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is CleanExit.run! at line 41), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(pi): preserve workflow progress and complete evidence capture (#1171)\u201D; \u201Cfix(worktree): restore native residue recovery (#1200)\u201D; \u201Cfix(bench): make OpenCode campaigns recover reliably (#1169)\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 15:59:09 \u002B00:00\u0027 --until=\u00272026-11-16 15:59:09 \u002B00:00\u0027 --full-history --no-merges -- lib/hive/stages/clean_exit.rb\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":"lib/hive/stages/clean_exit.rb"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"c515067a0f56c651705b384424527e4e4056e2c312ccaddd78b97a7fe648bad4"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060(repository root)\u0060 (240845 LoC, 3745 module-visible types across 84 directories) overshoots its size bounds. 2 of 3 build unit(s) (Bundler, RubyGems, 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":"Gemfile"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93967a6eaa12f32f163fcd4f79c6158b883c5a929bdba9448bfd9390b5ddd5c8"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060web\u0060 (7876 LoC, 169 module-visible types across 17 directories) overshoots its size bounds. 2 of 3 build unit(s) (Bundler, RubyGems, npm) overshoot their size bounds, lowering Project Cohesion to 0.0/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/package.json"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ea941af3f901551a092032ec144fc221c4f79efdf006625aecd57cda1f6e02"}},{"ruleId":"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":"de9c498ae0bc5fa4fb8dc56d164f449406dc529a746ef5c5e2bca2a48f455e4b"},"properties":{"commitSha":"80829219078dd4bd2d3734f7f1082ce379bbb94d"}},{"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":"7e5c4b48927146e9d167bbf935efea1ac6642f651a95e81a96bbd4201112a15d"},"properties":{"commitSha":"4a06d924940542864357ac55db303229ff208a7f"}},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e6672404dcfa6df521e34e5e53b08d92bd9f31e3221d37e96dc6fb4a0529e6cb"},"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":"6aa6b458c318eb70ddaac128ebb35b65c2726847f587a1d02868fe26107ca663"},"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":"5a7e9f38c74ca5deebeabe7817f8ddb73f0a168a5fb6b0b51d46508a6f9f1b06"},"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":"15d77cb2205f8d744c7a3eabcd664929072ba069c006e1f6c70e74c893b8f9f7"},"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":"afcb3aa61e4044fb4768e0919d1e0332256414928129465e71f71b745bbcd33c"},"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":"3eac36da2da5cfd6d46ec676de69909ed8a9260aa942c209f840826f75622125"},"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":"829e5cc10e5dfd4923bbab79dd2c037be35f0b68e212b33e7a1578282f30fbd6"},"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":"74dc9a734c313c34b5cb35a4d29b2ba04b89bec2fee7e7bbcfc93829e9273035"},"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":"46177c2edb79b0102d619c4291ff8c58a9dad58943793617a8ba3f7a456e0ad8"},"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":"3c7891940b9247026522ad90b5f6e33d4ced573a1911a9bacab9b7532fd892ce"},"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":"33a4dc43e64c4b21395e8227874a7ce58741fe09d205406ac452c9f562988230"},"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":"e3a0772b1d6d0b55759908eaa6cc7e839dcb45ff1bed06b331101c5b331673ea"},"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":"07f2e88f9c63e0f58c4ae8bdf330e7621436d36db0ff5969c1c9418203c8ad24"},"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":"b4ffdce103471dc5dda1daa283362ff2058370f186420a8853237211b5307432"},"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":"bda8cb40b0e0ec91cca5ef85a2264445da64cc64ba892c6e177b1d8986dc4d24"},"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":"7ae65471b3cbe4ca39b839bc387d551d39179f75503532bcd8f81820e231e83b"},"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":"9b2355e9253282855d8c8b620bec19b585bd955c75f44e56adc7d12bfd198ba7"},"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":"e5d41fb894f022b1d88f70b873917a84f4731ef610dd660a6a10f99150679822"},"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":"18a255251839db77b5663e53054bfb8d499cdfff7e551cb0d47299e5fd8c94bd"},"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":"2dbbe7fc6630bca5b812923bdaa4f6255006dd550715e4f0d113aa03bd21d8d8"},"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":"33378c5cc791bce5962aaed640bcffce35b5f56e11fc30f34d3a2eeb18131c9a"},"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":"cb0c607bd165f0cf3b34a2f73b61c1ed49abc3b4ce9af13dabc25e65096c4298"},"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":"09ef9934479f464a59542084882ed1d7c8a0f1243fc0f037b017608e6f22ad2d"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"74d5e77f362849e109cbb5fa5c985dfd2e482798c769416ee4d26bb31c7aceee"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"333bc14cbda8539fbee0d9e8087314713cdf1d95a9bf65714b9fd63f9ff26da6"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ab95f5aef8a82d870a65efc9944ef7c9eaab6448e6c6d62045852d68cd83ebed"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"43660523f932fb55b284944147e86d3ece073fef2011dd1fac18f8dddd3b2a42"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7f89fba6175ac82db5664a6f5e40061c0721478464a7f9fb4f46e21f6528feb9"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8c660d6288439091c51353bf6d786513294e62c7ce26f5bf8dbb73bca5d0eda8"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0260e7d1ab8d888062e1391edf89b2c0c89270f5896d046402b13c9ba095b56c"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4d08273105bb783fb5ada9fc263b3c64b0af7d1a72e731b64635e3c5b0cff79d"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b6a9c6a19c744d3f4dacb0a0f5606390ac72af24b4a8460eb874c6f313c9283"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"83b75cd4fa7b3e92362709e96b02214a8d4212d8c93166c0e72616de541240b0"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dacbf287116937a0a11301f6b94850b2e571e20eeef24d0ea9482e1ee74327cc"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c587aa7df99b478c0d6b23c8f819714908e016b5552d1ffee03e7578cee28a4b"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d82536f99b6adf606eeea50b06499ef0642f926bb483b9c436d8fc55ea6d5c7b"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"691f1d39accaaad8828d92d6028ae856862e660946f2a224616c27d5a1ed49c0"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"acf12f8143456c48f4ed0b5e87436a0ac591aaabc15941b7306316cfeb8ef1ac"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9341d1119d50a6e55b7f1cd2bdc952546dcd044e05f8feeebb805c57e8045d53"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9f53e594a2be73e04cf404a4d7eeb17bda4a81eac05dfedb04eaa785afaf8887"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a4e15a01a486fb9f34848c4ed30c673f785328652667e7bc6bbc026fb07dbec6"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"588d9606b728331cc3dabe37335774d3611f783e0114ae1fac3a8557e06786af"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0ec3261829fe9425fe0da5d0676f2246f5669a5bff0e0a37c68d7f1f09fbec96"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fdcd1265d1b485f995389f7213d5c77bd673aafb445211a4fd8c3b09f83f4fb9"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6f13aebf7825063a3204f09b0a1a9ad0972fe8b92f7c143dffb7cd01b43ccfcb"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c2499f99ec0dff782deec94519884ae96a7639e1e925f7b525b01e83e4b78df3"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"903e6abfce7377be21d3b0ff50bbab388103397d100025f55c1a410eadb30f1e"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"53c35fda84a2a217ff92a1ad0ed8857e1753439391c7fb8ad508e83d92dd22c3"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"79d4f9da872f8d730627993e94dbcd75cecfa4d70fc8c8c5e3bc0429e34c940c"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"241fc60b688c4c0f1bac4ebcfabd1894fe1cbe067bc42985d82026f311b84c9c"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d8450bbc014e8b1bab861b4edf166517cfecb2b7e2168991460c44fce6493bf3"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"338f550c9a7ffacfa6ba6bd8ac9f7d95424b07c41875fa3046c9589634eefb68"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1f47f1e4c4483f906ec6d2ae346935c57105037c6da5b214a4bc632e98ab9b2a"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ff79509e38bdae779c00b7cf12dc39f4ae76428617e186757da756699a5b762d"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"95b4e476143a3718fee2da0646c70f5df43e256fcab60ac8f2b7bc7775035f77"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc229381e673bde5fe55251c93fe48a8393b5171295ef0d28e0e81f281c4a3cc"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d28a4502957058bbceb2198302d8c32ac692f29a1fb1cf20c89330f7354d57a4"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7e225ae9fb6541c5c0706267df0e1be24fb6c75abab9cc4c63002b4ce50eddbe"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e1fb472ec58d8b25a57055a4c351c79111e1e0f42eb2e2e199cd573286c63b6f"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7af65bddc5aae5a2799de9929e107f250aa429a936659f3dc7e4952d803db7b9"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b357b5a85e75a801f363ec32d48703d1858f726abde42cb6154c06d1c5d3cb08"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3c7b88e002d9823d4ff6422272826a2ac9729cf0e31765e42969263e615ebdab"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0b1604f241b6e00c2f6fa0d47f8e49be0852020b360b7dbd9d2db4167659ebc4"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a33babd9f0ccd202ec48e7fa9765f5f8101f1b2e058ad6f04ac46fae9da65883"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"29c2d2d195e339f9c2c79a9d64641eb88cb38197c13a5729d5c0a6f6e54670dc"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"28c8cdf8235199b5d95e328ad4437c338f30e4507bdec40ebe1eb7569c38382a"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"82c5c4459ff760f88b66671da3d069e33c9627dab24b88baf3056807e37f7a13"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8b62a02bca78262ed971a0d41cff3caa1ba4e3b329acbea18fa3ea4edfcca2ab"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3706ee0613fd051bfab911fde1d4765863889a96f7b06c4ffc80453bee7fb385"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"de419aabe3d3ebb800eabfad8c7a0518372cc9647fb666c40564f42fc87f437b"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4b2ca5d9dbb7214c4e84550f86e132ec2521a45a80c7d7834e05ae1a4a6f37d8"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a4d2aac38ffe8757c15326a8bbbb554416e6db91e56335dac6f3a045e865aa33"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"78e743bc4102aed28668d5c78822b0b6b594863b5d969bc4f9ddc03c14463f33"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3eef2c855235fe5391b692b2392cae08b1da609b896697f29145725b1e1ad8ee"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9669c4ff6c630adc81e8fc3c1c650c863cadb3f863eedd6fd6ac6788ba7dbf3c"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0ffc1d11ef8a13da8db4ceb89b2de59c321ea8de67a10afbc46368a742941c64"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"371a24b42785da1b87b9a6658b94e800a3e071f7fe8ec62fd5379401fd780602"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"96067a67f4202ef772fdfb373a0d67dad969f1b15991909bd539677a3147aac8"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"942d0f2beef7c5ce44359ca6be9188f91f1e5b159d05e2dbb513724cb290c3f4"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d3e948e386440cc8dd733e96b114ca6d5c163935287f722f4f20eb486896e12c"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b413617f62f678526cb07ae0db9a454f1a42463833a4d4fce5df496fcedc7511"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c64c8366b54d17c235296376e948bd81c37db1510042b943861051ea5fcfe635"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"266f33a9d8e9ae48a6e36cccdd22b23704a7714ed781727f7a1b77a5ccebcfa3"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c5f778886d98b3038ef64afb74a9ded7359b3eadf48cca6b9175a3b1db48b139"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eba2925709912d6a14a8a110a4aa06347197e4631f26aa509de1a6ee521e35ba"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ab1b9fa057af7e08dafa08c4255134096c30edd7b9db26ba8f1ac84f2957a051"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5e03b1cc9c45b6443d8746429d5d37b41c2bcb54e1adbad935add4d2bb42765d"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"251c0c3383d555e4a3b1475277abc5c0dc1fa5760e228ff07a16c5b415a49661"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e3d4cb118a427bce2b9f8d51fdde623b97f6448e5655aad4e1b442a692b76213"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f8ff01b43dcde08173976cb66c41acc1ef5a680a301ffc67d68af351a12c7123"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"56c137573231a0d64b5e450b72f0e9a89b9ad4b1d302d69ea77be1b23f84f9f9"},"taxa":[{"id":"CWE-639","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"9363446bdef5bfef15d679405ab722021e270ac46b5dee5a3190a44fb84c463d"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"501ec8c00958412c14eedc3b751a52ee69b9bd63a90c90bea71b766e4f9012f6"},"taxa":[{"id":"CWE-94","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":"0c9a1f395f5f91d964484312b922324cd091121b563211e8fad40f0b43f2cd45"},"taxa":[{"id":"CWE-1265","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"6ff1a30b90822774a459ffa001c5fcbca30907b4a6546f9a98de3a61cdc9cad0"},"taxa":[{"id":"CWE-1265","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"ac057aff463de640cc87703dc0931c18eaca658339169572cab0d99d79fba0d8"},"taxa":[{"id":"CWE-1265","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"70a00857b2383f0f8585807c240f68b5b63fe4687d054b3dd87273c1b846a54c"},"taxa":[{"id":"CWE-1265","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"43bb4a95f61a8c62f23d3def2e2d9cf0a52d4c66038a6a7bfd82f18fdd083388"},"taxa":[{"id":"CWE-1265","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"7f101a327b7d9b60f521c8444e73e75af4c3ebfbe6a9ae69d698ad81f6d78a59"},"taxa":[{"id":"CWE-1265","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"39fb82e9edf142a11c8415c89796f2bf1de2ecc9893567eef66e897629c89cf7"},"taxa":[{"id":"CWE-116","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":"9eedd7aee9cdc8c2be6f385c550f19bb74501bf4856d1bc27197ee062c1a87f0"},"taxa":[{"id":"CWE-1265","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"d35486d9bdbed5c97e72b6642ad6fcab954b5b101f28d481dd60034bfa552af8"},"taxa":[{"id":"CWE-1265","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"eb1514914ac3b3ffe6771edd178dbbfbb7de35dcd905a3612f11cf12444f1650"},"taxa":[{"id":"CWE-1265","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"d704355e19c316248fad0e239f2ca858e41981d1744cb1bf99ef605d3ab001f1"},"taxa":[{"id":"CWE-1265","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"c6a41e9efbf8119d47772777756004c5a1323ba182872d245b4aceede9ef6dfe"},"taxa":[{"id":"CWE-601","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"5294f7e484f1dba40edc4fc97a7e3d0e0517165eaa54f2b1e151e6cae40def89"},"taxa":[{"id":"CWE-915","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1505af04f524e7224dd41b597b1ca36ee9108ba6b1eba8e164112707bab26ce5"},"taxa":[{"id":"CWE-601","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"5d5bcc9018eab2e8fb1516e942cf5a47094b26145311c82527d46f29a7ac8bbe"},"taxa":[{"id":"CWE-73","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bffb6f0c141df5c198da678d9a96f52950bb913ac7f8095e9fb9c90595f4554c"},"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":"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":"22f366366060d7eb3f67b1cc872339c4844239d7a2fea0f2e799aa75de12dd46"},"taxa":[{"id":"CWE-311","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"baa3b1ccb8e0611d467c4af5dc4e56aca8fc62a6fccf289e339a6b99d6be351a"},"properties":{"dependency":{"package":"@simple-git/argv-parser","version":"1.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"critical","fixedVersion":"2.0.1","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ec8b1a89c1e66b8a5e446df4cd60918d5f535abeb4eb0edd191ad224ff833ab9"},"properties":{"dependency":{"package":"proxy-addr","version":"2.0.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"critical","fixedVersion":"2.0.8","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5d52cd87b3a19ca672e7eef95a6bc780eb220b355ad2f32f2521039c8b15e939"},"properties":{"dependency":{"package":"simple-git","version":"3.36.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"critical","fixedVersion":"4.0.1","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"81cd3e197ba34e86d7364931ab38ae66afb073fa9c78124bb19bba422f3fe3eb"},"properties":{"dependency":{"package":"proxy-addr","version":"2.0.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"critical","fixedVersion":"2.0.8","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9e001e65156f61b8f82d4778933510a9b38112b4dfe0c86e11c796c707c2a994"},"properties":{"dependency":{"package":"@modelcontextprotocol/sdk","version":"1.29.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"1.32.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"63dfcf07b6ce500ce2d10f5cf20053ab3b7b5501ece555ba717cf8e709f6b5a1"},"properties":{"dependency":{"package":"body-parser","version":"2.3.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"2.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a896e0fcb7e9414cfd9c28821b5cf0094e8dd58fcf184729e67d8f7e23cba648"},"properties":{"dependency":{"package":"brace-expansion","version":"2.1.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"2.1.5","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0d58358d19a63f6d5a51bc482924aa4983e81bea1e5a283eec3f0616c91ced44"},"properties":{"dependency":{"package":"fast-uri","version":"3.1.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"3.1.6","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d75feef2bead5bbc33e74526cb8f0a68a80b82e65781ac4d6ed3aa32203cc012"},"properties":{"dependency":{"package":"picomatch","version":"2.3.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2eb1550e312c1345e93ea97e979be4bcf8141e75992a8f9c0be961013328aaed"},"properties":{"dependency":{"package":"picomatch","version":"4.0.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"531f8fe91665a0a2cbb85e52edc9503267c05dd00faf85a18233c425a78626ba"},"properties":{"dependency":{"package":"zod","version":"4.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"4.6.6","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2883dfc810337661c05e77852b32ebdf2d110b6e215b025bb141ee531b3d542d"},"properties":{"dependency":{"package":"@modelcontextprotocol/sdk","version":"1.30.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"1.32.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3217350f853f030f06ce3525b3baf741b755e98162b06e5cc2b8cf29a61367f8"},"properties":{"dependency":{"package":"body-parser","version":"2.3.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"2.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"026eac315eb39d112e9596b7cb6cee05f507233737eb914bd1166d618a17b7b6"},"properties":{"dependency":{"package":"brace-expansion","version":"5.0.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"5.0.10","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fc5d90cd2389c54e999192de571ea7dd2a617fc5d10582edc2721d302fd92fa7"},"properties":{"dependency":{"package":"fast-uri","version":"3.1.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"3.1.6","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"510653586ba3869f8e83306ffe025416a777cbb1d3cc470bf4423b2d51c45c1c"},"properties":{"dependency":{"package":"undici","version":"8.9.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"8.12.2","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b8e19d7080a3432b691c96e44e866298e7100355c096315d2dfc4d45cd5b6e3"},"properties":{"dependency":{"package":"zod","version":"4.4.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"4.6.6","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0a1f09d29cc38e5791e7ea85317409cf5b841f815c514578d3f8417afa59879f"},"properties":{"dependency":{"package":"@hono/node-server","version":"1.19.17","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"1.19.18","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3083dc08c8e04887c1f473ca8d564c7b234d33dccc2ed63e5d0f476888e0cd20"},"properties":{"dependency":{"package":"glob","version":"10.5.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"14.0.2","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"555755efe406bbca705c8855aa180ae610bb06f5fb7cd108c32cd10b8eca5de8"},"properties":{"dependency":{"package":"hono","version":"4.13.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"4.13.16","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9ae012c4ba4f7d92fad80f795b264732083205e7e9bf3532a2fea2048412ae89"},"properties":{"dependency":{"package":"ip-address","version":"10.5.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"10.5.1","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6e20e4098f55b8bbb827d0c45bbae4e08c5ae13e9f0d7e2da49e1a92caab82bb"},"properties":{"dependency":{"package":"minimatch","version":"9.0.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"11.0.1","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a117e8ce07c56c720a906c388bbb48f5e5bb9ca7da4d24a3d40b9f4f5d8f5599"},"properties":{"dependency":{"package":"qs","version":"6.15.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"6.16.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ea37e85f87056a3d8f0eedc169b2269a982887aa79954a3c28b8ed60e005d0cb"},"properties":{"dependency":{"package":"@hono/node-server","version":"2.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"2.1.6","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b45955aade162a0e0845332c6c2ddabe89449a945bc9346bb7e3134662f0618b"},"properties":{"dependency":{"package":"hono","version":"4.13.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"4.13.16","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8ab6760d58bed7c56f4a60d8e8bc6997148e02790850cd02f0757dc9723a90ca"},"properties":{"dependency":{"package":"ip-address","version":"10.4.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"10.5.1","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a403415436b67807c9252decc3861ee6abee0cbe44f9196b6e68a465a630d1e3"},"properties":{"dependency":{"package":"minimatch","version":"10.2.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"11.0.1","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"785b5e2a9fea1af514fc12f20e0ff9e30e33793f8fa74ad524eacbc84a886e8c"},"properties":{"dependency":{"package":"qs","version":"6.15.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"6.16.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: help.rb \u2194 key_map.rb: \u0060lib/hive/tui/help.rb\u0060 and \u0060lib/hive/tui/key_map.rb\u0060 change together 91% of the time (10 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u006015694f0b\u0060 fix(tui): align kill-class error routing (#176); \u0060aaffed10\u0060 feat(tui): full-screen info panel and footer hint for [i] (#127); \u006060d6d5bb\u0060 feat(tui): \u0060r\u0060 is the in-TUI force-retry gesture for max_passes-hit R\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/tui/help.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f186066c3b6b9f75bc4d636853715409964ba3c65569811e8d890e2b63507c"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: bubble_model.rb \u2194 help.rb: \u0060lib/hive/tui/bubble_model.rb\u0060 and \u0060lib/hive/tui/help.rb\u0060 change together 91% of the time (10 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u006015694f0b\u0060 fix(tui): align kill-class error routing (#176); \u0060aaffed10\u0060 feat(tui): full-screen info panel and footer hint for [i] (#127); \u006060d6d5bb\u0060 feat(tui): \u0060r\u0060 is the in-TUI force-retry gesture for max_passes-hit R\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/tui/bubble_model.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf312ffcdbb746c6da3a116583ec228b7e452a4151810fff42abc20e0db7de2"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: run.rb \u2194 review.rb: \u0060lib/hive/commands/run.rb\u0060 and \u0060lib/hive/stages/review.rb\u0060 change together 64% of the time (14 of the 22 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 14 shared commits counted here, the most recent 3 are \u0060c13970c5\u0060 fix(recovery): resume answered max-pass REVIEW_STALE via workflow.ret\u2026; \u0060b51be4bb\u0060 fix(review): surface unpublished residual commits after agent failure\u2026; \u00608fa6722e\u0060 fix(review,approve): block conflicting PRs in hosted CI gate; archive\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/run.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6dac8258c7d8bab9c05a888328b2a7928f9eca114038623a10c42c28f8abe8"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: orchestrator.rb \u2194 task_action.rb: \u0060lib/hive/plan_review/orchestrator.rb\u0060 and \u0060lib/hive/task_action.rb\u0060 change together 59% of the time (10 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u006046f0fdcc\u0060 fix(plan-review): restart stale reviews; keep and bound rejected revi\u2026; \u0060e6f9ec1e\u0060 fix: reconcile automatic dispositions with pending choices (#1435); \u006009a756ab\u0060 fix: recover pending plan revisions through verification (#1434) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/plan_review/orchestrator.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe15f4738dade0d9f8c113a4f61f9651aa7eafdd6103be6accf9981257467736"}},{"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":"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":"8a57b4e251c5c15e11a1ee6800475c83366483aeeb778d9e389ebf321549dc78"},"taxa":[{"id":"CICD-SEC-4","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":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","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":"c593d4dbd23724f337bfb8d2c1653812f143ae255bd9b59d4b3e9c37779fa6f4"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cvideo\u003E without a captions track: Video with no captions \u003Ctrack\u003E offers no captions. This player\u0027s source is set at runtime, so there is no caption file to author here: give the player a way to carry captions \u2014 accept a track/captions URL alongside the media and render a \u003Ctrack kind=\u0022captions\u0022\u003E when one is supplied \u2014 and capture that asset wherever the media enters the product (upload, import or generation)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/views/tasks/_media.html.erb"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f1c66c357a1a945da90083b216241f9a694dca5df383e8d233c04632046723"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cvideo\u003E without a captions track: Video with no captions \u003Ctrack\u003E offers no captions. This player\u0027s source is set at runtime, so there is no caption file to author here: give the player a way to carry captions \u2014 accept a track/captions URL alongside the media and render a \u003Ctrack kind=\u0022captions\u0022\u003E when one is supplied \u2014 and capture that asset wherever the media enters the product (upload, import or generation)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/views/tasks/_outcome_evidence.html.erb"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7e6dd9d9da653398cd802b5562fdcbd30d1bf8712573072175b1d9222d5c3b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/views/modules/_preview.html.erb"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a1cf1e0ca45ac8f3386e50284834abbb8d540a7a1357edd03c89130e2954f6"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/views/modules/_preview.html.erb"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6f7d548ee28f8bb92bb2ecd2d9483f28e5105e69ca172bf8f702cf8975be22"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/views/modules/index.html.erb"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ab957e6de518c9e4425a2f80f47568813c3f42ebd5279e67312a41511b392b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/views/repos/new.html.erb"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d5eb4ee6c7f8dc2eea68800ad12dee34587fee42cc22663c0bcc37e756465f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/views/repos/new.html.erb"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"97dc00ffa28521250a2cb384f935853e4e721b0311dd8da7743ccf69cd576619"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/views/repos/new.html.erb"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28085fcfb62198640946531ab1e9619bfbef737280ce38bf7781ecd5bcbde55"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/views/repos/new.html.erb"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"928bd64935658279963b4297e76c926e1422883de555197bba0fb0f2ec0ff646"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/views/repos/new.html.erb"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4337bc8ae9225e6aa678649fb3912dd578dc7bb48231a79510da95b570059bd"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/views/repos/new.html.erb"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"4577b6d091e9955df8e69ccabaeab1ee269f475d8b49edcda0cadfa280283dbc"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/views/repos/new.html.erb"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"37812ef2e2c4eaea272521dbdac0da5b7f8771ef88f1aac8ff1a9eaf3d3483a4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/views/workflows/_preview.html.erb"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"263aa5be95686b44fe2cb67c4ad3d212f7fb8bf9037ed1f830fcaf3c07b71b36"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/views/workflows/_preview.html.erb"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"36613e1f667e7651dd23e0354f0d24912197c042d91e988b56159781322544c6"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/views/workflows/_preview.html.erb"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb0e4a7567db77601e2b7b1602c789910628cb211070c805eed30f848a2822a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/views/workflows/_preview.html.erb"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"273f23ed53a2a1b9497f1f1acae1d92149d91e20130421181bfa366434868979"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h1 to h3: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/views/agents/index.html.erb"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eabb345144328302f7c1159d63dd4e8eba307fc4bda1d8ab1b8a47dc673ee5b"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/views/layouts/mailer.html.erb"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2866cdcd95bad00db21c5c4322d9e8cc0c25d9159fcf1cb3a72374bc8ea01c"}},{"ruleId":"AC3","level":"error","message":{"text":"Document without a \u003Ctitle\u003E: A page with no \u003Ctitle\u003E gives no name in the tab, history or screen-reader page list. Add a descriptive \u003Ctitle\u003E in \u003Chead\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/views/layouts/mailer.html.erb"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df170d9fb11d7b412d0066bf17ab09dbc9b72f093f8024ccf47c6be4213c788"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/views/layouts/mailer.html.erb"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e657a8a7d5a8173b6e6bede1ea0c994f838cf675d5fea2abf1be541b61f027"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable element isn\u0027t keyboard-operable: The repo\u0027s own CSS styles .task-slug with \u0060cursor: pointer\u0060, so this \u003Cp\u003E is a control \u2014 but it has no role, no tabindex=\u00220\u0022 and no key handler, so it can only be reached with a mouse. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/views/tasks/closures/new.html.erb"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"60fb4a141884783cdebcc4f17dbb9547e97ba8a7f869fbe355c18a37bf72f01f"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable element isn\u0027t keyboard-operable: The repo\u0027s own CSS styles .task-slug with \u0060cursor: pointer\u0060, so this \u003Cp\u003E is a control \u2014 but it has no role, no tabindex=\u00220\u0022 and no key handler, so it can only be reached with a mouse. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/views/tasks/diff.html.erb"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b97db261c98a835d5f074b680cf9de1c4080d0bdd7cb10cd375a1bd3753546f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (4.1:1): \u0060.session-avatar\u0060 sets color: #b3522f on background-color: #f5e3db \u2014 4.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/assets/stylesheets/application.css"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"3923b16e4d460f2efea2acb37cc8441567e99e08d1853c410c8251eb21679f9b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.1:1): \u0060.btn, button, input[type=\u0022submit\u0022]\u0060 sets color: #fff on background-color: #d97757 \u2014 3.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/assets/stylesheets/application.css"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b17e08850d3e23164e204497e8fb35459f7b3adf7f5c8281be5e78c6ab4559"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.8:1): \u0060.flash-notice\u0060 sets color: #5f7e5a on background-color: #e4ecdf \u2014 3.8:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/assets/stylesheets/application.css"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07267daff78ef38e64f55546e9f8841ec97f5e1699ba2412ec76b758d63af70"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.8:1): \u0060.flash-alert\u0060 sets color: #d3766c on background-color: #44312e \u2014 3.8:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/assets/stylesheets/application.css"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b9d668262bca882b0730120f8d6931c27b72639211465c0458a1b846b93e6d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.9:1): \u0060.chip-icon\u0060 sets color: #c96442 on background-color: #ffffff \u2014 3.9:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/assets/stylesheets/application.css"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b77d2479bdb9d0c1e8aebf7944fcee2316c661f1b20a327a25a20e0d9205768"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.8:1): \u0060.workspace-state-current \u003E .workspace-panel-heading .workspace-state-label\u0060 sets color: #5f7e5a on background-color: #e4ecdf \u2014 3.8:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/assets/stylesheets/application.css"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"555951957bd79e3254e1bc20574db9f875d3e17f4eb54b38ec9d521a5e28a506"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.2:1): \u0060.workspace-state-stale \u003E .workspace-panel-heading .workspace-state-label, .workspace-state-partial \u003E .workspace-panel-heading .workspace-state-label, .workspace-state-missing \u003E .workspace-panel-heading .workspace-state-label\u0060 sets color: #a8763e on background-color: #f3e6d4 \u2014 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/assets/stylesheets/application.css"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5d4ffac7df9abdd20ded007ad7c517885aaa0c2cd323fc937f287df1870bd0"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.8:1): \u0060.workspace-state-conflicting \u003E .workspace-panel-heading .workspace-state-label, .workspace-state-unavailable \u003E .workspace-panel-heading .workspace-state-label, .workspace-state-exhausted \u003E .workspace-panel-heading .workspace-state-label\u0060 sets color: #d3766c on background-color: #44312e \u2014 3.8:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/assets/stylesheets/application.css"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6d76218068795ff131736102ee94119a5e5e216d7580b83447d8a2688f988a"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (4.1:1): \u0060.proof-kind\u0060 sets color: #b3522f on background-color: #f5e3db \u2014 4.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/assets/stylesheets/application.css"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"829dd211c7c886703b8d53d06c9b38cff9320e21274937602af4f97d5d1490e5"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.8:1): \u0060.evidence-blocker, .evidence-warning\u0060 sets color: #d3766c on background-color: #44312e \u2014 3.8:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/assets/stylesheets/application.css"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd7e5ff39969ed670843a3a9ff5e7236fb308b6b83e5e7caa22c61b246433a3"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.2:1): \u0060.demo-banner\u0060 sets color: #a8763e on background-color: #f3e6d4 \u2014 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/assets/stylesheets/application.css"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa32edfcea092c15dbbaaa347b77915a7030b5f87238d5d6aeb3d6a91fe8f143"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.2:1): \u0060.digest-badge-partial, .digest-badge-open\u0060 sets color: #a8763e on background-color: #f3e6d4 \u2014 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/assets/stylesheets/application.css"},"region":{"startLine":1298}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be270e65c93280015033323e0a20cc28332742f2624564026d7fba1b1a63708"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.2:1): \u0060.state-banner\u0060 sets color: #a8763e on background-color: #f3e6d4 \u2014 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/assets/stylesheets/application.css"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ad1da675767fc3219b0a85d5ebea81a04a9f8145ab4f870e66560fc1609f91"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.composer textarea:focus\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/assets/stylesheets/application.css"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9cde7c109767065b8cc5e9b236f64ebd3afa8300d07e752b448282c76c883b9"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.btn\u0060 moves (\u0060transition: background 120ms ease, border-color 120ms ease, transform 60ms ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/assets/stylesheets/application.css"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c9f67c6e95e6462384482b872a07f3e8a90ed43607451314939544264ca15e"}},{"ruleId":"C2","level":"note","message":{"text":"No named authorization policies: Authorization IS enforced here (by route guards, auth middleware or checks that refuse a caller) \u2014 this is NOT a claim that endpoints are unprotected. What\u0027s missing is a NAMED rule set: who may do what is encoded inline where it is checked, so the rules can\u0027t be listed, reviewed or tested apart from the code that applies them. Recommendation, not a defect."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b048fdf3fa524ac68c7874fdfcdb4c49d5f010013f2cb22a0bd84cb12ceb951f"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 2/3 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060components/agent-cli-runtime\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"Dependabot does not watch npm: \u0060.github/dependabot.yml\u0060 schedules updates, but no \u0060package-ecosystem\u0060 entry covers \u0060npm\u0060, which this tree depends on \u2014 so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entry to the \u0060updates:\u0060 list."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/dependabot.yml"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"da14c5e8fb421b8614b797a2517de829b3c94f3b85263a50e3283dfd26519afe"}},{"ruleId":"P8","level":"warning","message":{"text":"Schema created by ActiveRecord::Schema.define at runtime outside the migrations: This repository versions its schema (Sequel migrations), but ActiveRecord::Schema.define at runtime here builds or alters the schema from the model as well, outside that history \u2014 the two paths can disagree about the shape, and a change made this way is never a reviewed migration. Turn it off and let Sequel migrations own the schema."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/db/cable_schema.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b25615b94aab842788ead0ab670ea0254223ebd7785419e50d3f804a5cbe9a"}},{"ruleId":"P8","level":"warning","message":{"text":"Schema created by ActiveRecord::Schema.define at runtime outside the migrations: This repository versions its schema (Sequel migrations), but ActiveRecord::Schema.define at runtime here builds or alters the schema from the model as well, outside that history \u2014 the two paths can disagree about the shape, and a change made this way is never a reviewed migration. Turn it off and let Sequel migrations own the schema."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/db/cache_schema.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe329abec893154f0982d4f398818373784f039987f6133c6eff4e99d51c615"}},{"ruleId":"P8","level":"warning","message":{"text":"Schema created by ActiveRecord::Schema.define at runtime outside the migrations: This repository versions its schema (Sequel migrations), but ActiveRecord::Schema.define at runtime here builds or alters the schema from the model as well, outside that history \u2014 the two paths can disagree about the shape, and a change made this way is never a reviewed migration. Turn it off and let Sequel migrations own the schema."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/db/queue_schema.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd90a229e934d9c0dbdbada5976585949f15b835faa598fdab990dd134bbed1"}},{"ruleId":"P8","level":"warning","message":{"text":"Schema created by Sequel create_table at runtime outside the migrations: This repository versions its schema (Sequel migrations), but Sequel create_table at runtime here builds or alters the schema from the model as well, outside that history \u2014 the two paths can disagree about the shape, and a change made this way is never a reviewed migration. Turn it off and let Sequel migrations own the schema."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/runtime_control_plane/database.rb"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e2669928ad2f1881ed9e24dc5ce5038b4e2715699f0e46fac6b4b5c3742f46"}},{"ruleId":"P8","level":"warning","message":{"text":"Schema created by Sequel create_table at runtime outside the migrations: This repository versions its schema (Sequel migrations), but Sequel create_table at runtime here builds or alters the schema from the model as well, outside that history \u2014 the two paths can disagree about the shape, and a change made this way is never a reviewed migration. Turn it off and let Sequel migrations own the schema."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/runtime_control_plane/command_migrations/002_add_command_receipts.rb"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"524285fcce4ca9c7e36ab1c25e1e59291fd287fe80ca87d60216267e527ccd3b"}},{"ruleId":"P8","level":"warning","message":{"text":"Schema created by Sequel create_table at runtime outside the migrations: This repository versions its schema (Sequel migrations), but Sequel create_table at runtime here builds or alters the schema from the model as well, outside that history \u2014 the two paths can disagree about the shape, and a change made this way is never a reviewed migration. Turn it off and let Sequel migrations own the schema."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/runtime_control_plane/command_migrations/002_add_command_receipts.rb"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"817c843cee477e2e32465ecdbb27eb5006b07ac459cf581f3e7318d9150f14e0"}},{"ruleId":"P8","level":"warning","message":{"text":"Schema created by Sequel create_table at runtime outside the migrations: This repository versions its schema (Sequel migrations), but Sequel create_table at runtime here builds or alters the schema from the model as well, outside that history \u2014 the two paths can disagree about the shape, and a change made this way is never a reviewed migration. Turn it off and let Sequel migrations own the schema."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/runtime_control_plane/command_migrations/002_add_command_receipts.rb"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f4e15dedda22d8f9912dc02784724d4831b8ffc42bcf6c52ab9b6a7290050e"}},{"ruleId":"P8","level":"warning","message":{"text":"Schema created by Sequel create_table at runtime outside the migrations: This repository versions its schema (Sequel migrations), but Sequel create_table at runtime here builds or alters the schema from the model as well, outside that history \u2014 the two paths can disagree about the shape, and a change made this way is never a reviewed migration. Turn it off and let Sequel migrations own the schema."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/runtime_control_plane/command_migrations/002_add_command_receipts.rb"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea87929b2cb5f92628d05e0e6dc6a800e10bc4149aebb6f03c533542e9b5056"}},{"ruleId":"P8","level":"warning","message":{"text":"Schema created by Sequel create_table at runtime outside the migrations: This repository versions its schema (Sequel migrations), but Sequel create_table at runtime here builds or alters the schema from the model as well, outside that history \u2014 the two paths can disagree about the shape, and a change made this way is never a reviewed migration. Turn it off and let Sequel migrations own the schema."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/runtime_control_plane/command_migrations/002_add_command_receipts.rb"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61f25e2c97bcd428b86e4d4cef916fa34161c9a89f713d995f25eb7e99c8436"}},{"ruleId":"P8","level":"warning","message":{"text":"Schema created by Sequel create_table at runtime outside the migrations: This repository versions its schema (Sequel migrations), but Sequel create_table at runtime here builds or alters the schema from the model as well, outside that history \u2014 the two paths can disagree about the shape, and a change made this way is never a reviewed migration. Turn it off and let Sequel migrations own the schema."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/runtime_control_plane/command_migrations/002_add_command_receipts.rb"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f87fa840666b3e11abe2119cccee1db08e8550b313ff0f514a221c995390b7f"}},{"ruleId":"P8","level":"warning","message":{"text":"Schema created by Sequel create_table at runtime outside the migrations: This repository versions its schema (Sequel migrations), but Sequel create_table at runtime here builds or alters the schema from the model as well, outside that history \u2014 the two paths can disagree about the shape, and a change made this way is never a reviewed migration. Turn it off and let Sequel migrations own the schema."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/runtime_control_plane/command_migrations/002_add_command_receipts.rb"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"236fd81401d2056f9e113be523e4c277bae00e33b795bb76e15ed5cb11968337"}},{"ruleId":"P8","level":"warning","message":{"text":"Schema created by Sequel create_table at runtime outside the migrations: This repository versions its schema (Sequel migrations), but Sequel create_table at runtime here builds or alters the schema from the model as well, outside that history \u2014 the two paths can disagree about the shape, and a change made this way is never a reviewed migration. Turn it off and let Sequel migrations own the schema."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/runtime_control_plane/command_migrations/002_add_command_receipts.rb"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"44998920ed85c685ebd09564c77a1ad1cde6c04b196c97d627983087a13aac15"}},{"ruleId":"P8","level":"warning","message":{"text":"Schema created by Sequel create_table at runtime outside the migrations: This repository versions its schema (Sequel migrations), but Sequel create_table at runtime here builds or alters the schema from the model as well, outside that history \u2014 the two paths can disagree about the shape, and a change made this way is never a reviewed migration. Turn it off and let Sequel migrations own the schema."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/runtime_control_plane/command_migrations/002_add_command_receipts.rb"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"a322b470dd92e046bf6c173a1f66d72118f0d43ba43fad2b500e51f40ea48825"}},{"ruleId":"P8","level":"warning","message":{"text":"Schema created by Sequel create_table at runtime outside the migrations: This repository versions its schema (Sequel migrations), but Sequel create_table at runtime here builds or alters the schema from the model as well, outside that history \u2014 the two paths can disagree about the shape, and a change made this way is never a reviewed migration. Turn it off and let Sequel migrations own the schema."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/runtime_control_plane/command_migrations/002_add_command_receipts.rb"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0e9d5427d14f10cc5c5da6bc247a046b14c8d53b1a5b50b102d2bfda39b574"}},{"ruleId":"P8","level":"warning","message":{"text":"Schema created by Sequel create_table at runtime outside the migrations: This repository versions its schema (Sequel migrations), but Sequel create_table at runtime here builds or alters the schema from the model as well, outside that history \u2014 the two paths can disagree about the shape, and a change made this way is never a reviewed migration. Turn it off and let Sequel migrations own the schema."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/runtime_control_plane/command_migrations/002_add_command_receipts.rb"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"17bd9e569ddcc2cb0adda2242ca6cd5d801e07de1b43c76ccfc27dafb75da801"}},{"ruleId":"P8","level":"warning","message":{"text":"Schema created by Sequel create_table at runtime outside the migrations: This repository versions its schema (Sequel migrations), but Sequel create_table at runtime here builds or alters the schema from the model as well, outside that history \u2014 the two paths can disagree about the shape, and a change made this way is never a reviewed migration. Turn it off and let Sequel migrations own the schema."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/runtime_control_plane/command_migrations/002_add_command_receipts.rb"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"112a4cd9d6a5a44f650c9ab10e765515cd7be862437724c7998c1fa2761dc27a"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 0 typed \u00B7 17 plain JS \u2014 the untyped files are web/app/javascript/application.js, web/app/javascript/controllers/answers_controller.js, web/app/javascript/controllers/application.js, web/app/javascript/controllers/artifacts_controller.js, web/app/javascript/controllers/avatar_controller.js, web/app/javascript/controllers/composer_controller.js (\u002B11 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): web/app/javascript/status_stream_source.js:165 \u00B7 web/app/javascript/status_stream_source.js:178 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/javascript/status_stream_source.js"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"4273dbad774d50e0ff39102be12a8247ce6316535446ea5fd1019501d73ce9e3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): web/app/javascript/controllers/answers_controller.js:21 \u00B7 web/app/javascript/controllers/task_workspace_controller.js:14 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/javascript/controllers/answers_controller.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ed368db2cf231ee50761c64cf17752f2cbf0cad75e1f618852095fbc7a009b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): web/app/javascript/status_stream_source.js:552 \u00B7 web/app/javascript/status_stream_source.js:575 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/javascript/status_stream_source.js"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b081295d8fa60b60dbfe518ea1bb2ead6d9ab16e59a392837db8bf2e1d66b31"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function attributeChangedCallback (cyclomatic 12, cognitive 15): attributeChangedCallback has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/javascript/status_stream_source.js"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b1f4d60ff7800ccaeed5e78bd12b763b7ff4850f468be32ea14ed2af9ec796"}},{"ruleId":"R3","level":"warning","message":{"text":"web/app/javascript/status_stream_source.js: 602 lines of code: web/app/javascript/status_stream_source.js has 602 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/javascript/status_stream_source.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f48fd1616cb52efdd9bab190a3f0d105044b448c6d644d4a068718b0bd7edd7"}},{"ruleId":"R6","level":"warning","message":{"text":"No typecheck script: test \u2713 \u00B7 lint \u2713 \u00B7 typecheck \u2717 \u2014 read from this repository\u0027s package.json scripts and corroborated against its CI workflows. A script counts when its name or command matches the step: \u0060test\u0060 for the suite, \u0060lint\u0060 or \u0060prettier\u0060 for linting, \u0060typecheck\u0060/\u0060type-check\u0060/\u0060tsc\u0060 for type checking. \u2717 therefore means no script or CI step under those names was found, NOT that the step is absent from your pipeline \u2014 a task invoked by a runner this check does not read, or named something else entirely, is not seen and is worth confirming before acting on a cross. A \u2713 means the wiring is DECLARED \u2014 a script or CI step under those names exists. It is not a statement that the step passes, or that it runs at all: nothing here installs a dependency or executes a suite."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"912edc7f1fd20bf80ef68c3293e3048565115e48707dc5f9d492201598794658"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027agent-browser\u0027: Declared in lib/hive/assets/capture-tools/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/assets/capture-tools/package.json"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5d5d5c310087b326784fb2b92ac5369bd43981807764c233993c965681c42c"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027node-gyp\u0027: Declared in lib/hive/assets/qmd/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/assets/qmd/package.json"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c8f4f7e8dcdf10e5966ab422481b73863cacad3154b308d72ade18532091fb"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060Digest::SHA256\u0060 or \u0060OpenSSL::Digest.new(\u0022SHA256\u0022)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/tui/bubble_model.rb"},"region":{"startLine":2348}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb0e2a6d7d7e6ccfd345d0587894614b2634ae261368d1cae295471e5ad1324"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060Digest::SHA256\u0060 or \u0060OpenSSL::Digest.new(\u0022SHA256\u0022)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/workflow_package/registry_gateway.rb"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b220cb9cd7cee36ce3c7f1b06698920ec02d457f6727690e74df77c1cddf223"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!custody_report \u0026\u0026 spawn_result.is_a?(Hash) \u0026\u0026 spawn_result[:status] == :ok\u0060 appears character-identically in 2 files \u2014 lib/hive/stages/finalize.rb, lib/hive/stages/open_pr.rb. 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":"lib/hive/stages/finalize.rb"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbbe67fc935511478571c25b36f1753792b120323eca65118ddebd1f5f5c8798"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!custody_report \u0026\u0026 spawn_result[:status] == :ok\u0060 appears character-identically in 2 files \u2014 lib/hive/stages/review/ci_fix.rb, lib/hive/stages/review/triage.rb. 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":"lib/hive/stages/review/ci_fix.rb"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"25fdfa9a943069b6c01731e97ee95d59265641277a031f7981704a7d701ff461"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!limit_text.to_s.empty? || Hive::AgentLimit.from_limit?(error_message.to_s)\u0060 appears character-identically in 2 files \u2014 lib/hive/stages/review.rb, lib/hive/stages/review/limit_fallback.rb. 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":"lib/hive/stages/review.rb"},"region":{"startLine":1424}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc8c63b60ec393d2d41856e6ab7b362f07a4dfbed338ae4f76dbce771cbf19a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!path.empty? \u0026\u0026 !path.start_with?(\u0022/\u0022) \u0026\u0026 !path.include?(\u0022\\\\\u0022) \u0026\u0026 !path.split(\u0022/\u0022).include?(\u0022..\u0022) \u0026\u0026 path.bytesize \u003C= 1_024\u0060 appears character-identically in 2 files \u2014 lib/hive/patrol/fix_admission_adapter.rb, lib/hive/refactor_patrol/fix_admission_adapter.rb. 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":"lib/hive/patrol/fix_admission_adapter.rb"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c41973c8199855d517e5aacc83bfa9fc77701176d298da824ddabef88e004e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060%w[http https].include?(uri.scheme) \u0026\u0026 uri.host \u0026\u0026 !uri.host.empty? \u0026\u0026 uri.userinfo.nil? \u0026\u0026 uri.fragment.nil?\u0060 appears character-identically in 2 files \u2014 lib/hive/module_package/manifest.rb, lib/hive/workflow_package/registry_manifest.rb. 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":"lib/hive/module_package/manifest.rb"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8790c151f22f3ca611435c8e95016fbce3b2763e910a0d546dd939b9cc1663d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(f = stage_glob(project_dir, slug)) \u0026\u0026 f.include?(\u00224-execute\u0022)\u0060 appears character-identically in 2 files \u2014 web/script/record_box_demo_real.rb, web/script/record_box_demo_real_resume.rb. 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":"web/script/record_box_demo_real.rb"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ebc011c6c077ad6714fb72bebed5e5cea06b84ca59ae95d34adf2f1c60f1ea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \[e-mail redacted](\u0022refactor_patrol\u0022, \u0022min_confidence\u0022) || \u0022medium\u0022\u0060 appears character-identically in 2 files \u2014 lib/hive/refactor_patrol/reporter.rb, lib/hive/refactor_patrol/reviewer.rb. 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":"lib/hive/refactor_patrol/reporter.rb"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a9b5f5445e4eea2eb593c515c5fd0da4209dc738b0025990adb57e6eb1bcac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \[e-mail redacted](\u0022timeout_sec\u0022, \u0022patrol\u0022) || 3600\u0060 appears character-identically in 4 files \u2014 lib/hive/daemon/patrol_fix_semantic_decision_runner.rb, lib/hive/patrol/reviewer.rb, lib/hive/refactor_patrol/merge_classifier_runner.rb, lib/hive/refactor_patrol/review_agent_runner.rb. 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":"lib/hive/daemon/patrol_fix_semantic_decision_runner.rb"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"894632bf835f1222258f87b4ee035ef002681ff63fed5730c4cbdd7e62fd9481"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060@durable \u0026\u0026 !Hive::Attempts::Context.active?\u0060 appears character-identically in 2 files \u2014 lib/hive/commands/run.rb, lib/hive/commands/stage_action.rb. 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":"lib/hive/commands/run.rb"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8bd78d864cc7f854f0d5766fa095f3f937032c79732b2a309f7faffb300811"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060@project_entry || Hive::Config.find_project(@project)\u0060 appears character-identically in 2 files \u2014 lib/hive/commands/patrol.rb, lib/hive/commands/refactor_patrol.rb. 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":"lib/hive/commands/patrol.rb"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"49bfdd6e36639e5b15123ad41aab432cdfa0a5a4964701c94c415af8fa05bfce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060@reconciler || Hive::Attempts::Reconciler.new( store: store, process_identity: @process_identity )\u0060 appears character-identically in 2 files \u2014 lib/hive/daemon/quiescence.rb, lib/hive/daemon/quiescence_finalizer.rb. 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":"lib/hive/daemon/quiescence.rb"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"03682b18d199cba47b796984dc203da261c9c97ad994c0471e90adddd5024de3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \[e-mail redacted]?(\u0022/\u0022) || @target.start_with?(\u0022~\u0022, \u0022.\u0022)\u0060 appears character-identically in 2 files \u2014 lib/hive/commands/answer.rb, lib/hive/task_resolver.rb. 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":"lib/hive/commands/answer.rb"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"bccaca8631dc3ff2cd1131beb9f6f52cae4484fb2c30714d08f9163c08c3bf5f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \[e-mail redacted]? || @target.to_s.strip.empty?\u0060 appears character-identically in 2 files \u2014 lib/hive/commands/daemon.rb, lib/hive/commands/markers.rb. 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":"lib/hive/commands/daemon.rb"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"c522c08f74747dbfd88e0f378a7ceee44774c15817dcd3cfde2b93d7f4fb29ce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \[e-mail redacted]? \u0026\u0026 @timeout_sec.finite?\u0060 appears character-identically in 2 files \u2014 lib/hive/daemon/quiescence.rb, lib/hive/runtime_control_plane/quiescence_upgrade.rb. 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":"lib/hive/daemon/quiescence.rb"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8527317aff8fa121366dc4312b518bdae7997c596d79a3296d4e486dcd8a6e7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060File.directory?(path) \u0026\u0026 !File.symlink?(path)\u0060 appears character-identically in 7 files \u2014 lib/hive/agent_skills/directory_publisher.rb, lib/hive/artifacts/project_command_sandbox.rb, lib/hive/commands/init.rb, lib/hive/daily_digest/project_source.rb. 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":"lib/hive/agent_skills/directory_publisher.rb"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"784640ae0974f48b6bc5f7b209d987bc547155d0996475d31b6476672eb7933f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060File.exist?(@path) || File.symlink?(@path)\u0060 appears character-identically in 2 files \u2014 lib/hive/attempts/stream_log.rb, lib/hive/patrol_fix/worktree_receipt.rb. 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":"lib/hive/attempts/stream_log.rb"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"292098ac71dc21f370e4eec74bdcf35d00c9a5e607a30ea505852cf50cc481c9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060File.exist?(current) || File.symlink?(current)\u0060 appears character-identically in 2 files \u2014 lib/hive/llm_wiki_bootstrap.rb, packaging/release_candidate/paths.rb. 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":"lib/hive/llm_wiki_bootstrap.rb"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e547fbea8e00a3998fb3e42021081fe53a2126f83be59465a4500cb16e4a57"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060File.exist?(destination) \u0026\u0026 !Dir.empty?(destination)\u0060 appears character-identically in 3 files \u2014 lib/hive/module_package/catalog_client.rb, lib/hive/workflow_package/publisher.rb, lib/hive/workflow_package/registry_client.rb. 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":"lib/hive/module_package/catalog_client.rb"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec06781f99669e148048eb26017645d3edcc70cdb87c62a22dd83c13ea921782"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060File.exist?(destination) || File.symlink?(destination)\u0060 appears character-identically in 6 files \u2014 lib/hive/agent_skills/directory_publisher.rb, lib/hive/web/source_bundle.rb, lib/hive/web/task_capture.rb, packaging/live_agent_skills/workflow_creator_live_setup.rb. 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":"lib/hive/agent_skills/directory_publisher.rb"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"677b3b3053c0d8e05ba1c7b024b20ce44b57e817b9bac0be259e3672541c5c0f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060File.exist?(directory) || File.symlink?(directory)\u0060 appears character-identically in 2 files \u2014 lib/hive/context_provenance.rb, lib/hive/proposals/store.rb. 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":"lib/hive/context_provenance.rb"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a451d798cdff3deb2f688e326c3a741723613726b7c9961cfe078b91ba37c0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060File.exist?(path) || File.symlink?(path)\u0060 appears character-identically in 39 files \u2014 components/agent-cli-runtime/lib/agent_cli_runtime/opencode/overlay.rb, lib/hive/agent_skills/directory_publisher.rb, lib/hive/artifacts/outcome_evidence/identity.rb, lib/hive/artifacts/outcome_evidence/store.rb. 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":"components/agent-cli-runtime/lib/agent_cli_runtime/opencode/overlay.rb"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"163cf163bd58c7c1bc6a233d83e20b09b0cfc04413ad0fe436adec9eeb879e5e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060File.exist?(receipt_path) || File.symlink?(receipt_path)\u0060 appears character-identically in 2 files \u2014 lib/hive/draft_pr_receipt.rb, lib/hive/stages/agent_worktree.rb. 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":"lib/hive/draft_pr_receipt.rb"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d37b1f0c825531b5ae35654d44d844a177fddec0f673029940a2614d16d17c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060File.exist?(root) || File.symlink?(root)\u0060 appears character-identically in 2 files \u2014 lib/hive/plan_review/transition_guard.rb, lib/hive/proposals/source_event_store.rb. 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":"lib/hive/plan_review/transition_guard.rb"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"11cd1eb0f3acf2c894bef16f1196de9ca4cf015b2150f76ecba0cd02b720026f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060File.exist?(target) || File.symlink?(target)\u0060 appears character-identically in 2 files \u2014 lib/hive/agent_git_gate.rb, lib/hive/workflow_package/publish_store.rb. 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":"lib/hive/agent_git_gate.rb"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28dec8ace52cc199ec404bb341c0377581ef0534a2a41ad47adfd1456419cad"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060File.file?(SANDBOX_PATH) \u0026\u0026 File.executable?(SANDBOX_PATH)\u0060 appears character-identically in 2 files \u2014 lib/hive/agent_support/grok/runtime.rb, lib/hive/agent_support/pi/runtime.rb. 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":"lib/hive/agent_support/grok/runtime.rb"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b2e6cb1ca2eabbad08b3cd970f14400e75d84e7db1bbc8c6159c8b55a01ba3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060File.file?(candidate) \u0026\u0026 File.executable?(candidate)\u0060 appears character-identically in 7 files \u2014 components/agent-cli-runtime/lib/agent_cli_runtime/profile.rb, lib/hive/agent.rb, lib/hive/babysitter/dry_run_env.rb, lib/hive/llm_wiki_bootstrap/scheduler.rb. 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":"components/agent-cli-runtime/lib/agent_cli_runtime/profile.rb"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e62a867efbb5ada9ac6cf5d14634d0dcdf5b9b4b69ecd48ebd7be0f9621ffc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060File.file?(path) \u0026\u0026 !File.read(path).strip.match?(/\\A(?:|\\{\\s*\\})\\z/m)\u0060 appears character-identically in 2 files \u2014 components/agent-cli-runtime/lib/agent_cli_runtime/profiles.rb, lib/hive/agent_profiles.rb. 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":"components/agent-cli-runtime/lib/agent_cli_runtime/profiles.rb"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71a240c83dcc58427e5c5a0ed27840a8224263c0393028f0d4ffe2d5bb345bc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060File.file?(path) \u0026\u0026 !File.symlink?(path)\u0060 appears character-identically in 14 files \u2014 lib/hive/daemon/finalization_proof.rb, lib/hive/daily_digest/hold_observer.rb, lib/hive/daily_digest/project_source.rb, lib/hive/plan_review/decision_service.rb. 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":"lib/hive/daemon/finalization_proof.rb"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"456b91d4c8bc1ba4a7915fbc6dd15d3e1c4ca8417bbec4e06a4b2116cd73cc13"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060File.file?(path) \u0026\u0026 File.executable?(path)\u0060 appears character-identically in 8 files \u2014 lib/hive/agent_skills/adapters/openclaw.rb, lib/hive/agent_skills/inspector.rb, lib/hive/agent_support/operator_authority.rb, lib/hive/commands/service_installer/base.rb. 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":"lib/hive/agent_skills/adapters/openclaw.rb"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd165ac4b5ee612e9f6c045b4f6e15286c875eb218f1406302b5d59c1fd0e73e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060File.file?(paths.current_path) \u0026\u0026 !File.symlink?(paths.current_path)\u0060 appears character-identically in 2 files \u2014 packaging/release_candidate/evidence.rb, packaging/release_candidate/local_attempt.rb. 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":"packaging/release_candidate/evidence.rb"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ab511a306d8f60528534fbda224dcea4bd7c1fa62c53b17b244b249d63d07a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060File.realpath(path) == path \u0026\u0026 stat.directory? \u0026\u0026 !stat.symlink? \u0026\u0026 stat.uid == Process.uid\u0060 appears character-identically in 2 files \u2014 packaging/live_agent_skills/workflow_creator_gateway.rb, packaging/live_agent_skills/workflow_creator_live_setup.rb. 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":"packaging/live_agent_skills/workflow_creator_gateway.rb"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"572880d53193ec12ab2af83826bc558a39605dd78729c6b6af2615fa64fe7373"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Hive::AgentSupport.for(profile) || Hive::AgentSupport.for_protocol(profile.structured_output_protocol)\u0060 appears character-identically in 2 files \u2014 lib/hive/daily_digest/document_generator.rb, lib/hive/display_name/generator.rb. 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":"lib/hive/daily_digest/document_generator.rb"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"9abbd4eec46336aa007c731418609907537ca3ed2e45242eda3ec98213cc3223"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060after.dev == opened.dev \u0026\u0026 after.ino == opened.ino \u0026\u0026 after.size == opened.size \u0026\u0026 after.mtime == opened.mtime\u0060 appears character-identically in 2 files \u2014 lib/hive/context_provenance.rb, lib/hive/context_provenance/wiki_snapshot.rb. 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":"lib/hive/context_provenance.rb"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef16beff0499f4b365972970d90553f26dca0e43f89348a2358969168aef26cd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060arg.start_with?(\u0022-\u0022) \u0026\u0026 !arg.start_with?(\u0022--\u0022)\u0060 appears character-identically in 2 files \u2014 lib/hive/babysitter/gh_policy.rb, lib/hive/babysitter/git_policy.rb. 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":"lib/hive/babysitter/gh_policy.rb"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41f095a28922e1aa126b62fe16e8543e257954ab67d40cf438402bddd16eba8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060attempt_id.empty? || attempt_id == Hive::TaskJournal::LEGACY_ATTEMPT_ID\u0060 appears character-identically in 2 files \u2014 lib/hive/commands/status.rb, lib/hive/task_workspace/attempts.rb. 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":"lib/hive/commands/status.rb"},"region":{"startLine":2349}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a744b614744d47e05c61cf4d1285aee799a861ca7c65b80c21236d2edca02e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060before.dev == after.dev \u0026\u0026 before.ino == after.ino \u0026\u0026 before.size == after.size \u0026\u0026 before.mtime == after.mtime\u0060 appears character-identically in 2 files \u2014 lib/hive/task_workspace/bounded_reader.rb, lib/hive/task_workspace/jsonl_reader.rb. 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":"lib/hive/task_workspace/bounded_reader.rb"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"0266bab1891bc74f11e4d57acad43bb2f2aef14a84e92dd3b03320e45376172c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060boot_id_reader || Hive::RuntimeControlPlane::BootIdentity.method(:current)\u0060 appears character-identically in 2 files \u2014 lib/hive/daemon/dispatcher.rb, lib/hive/daemon/quiescence.rb. 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":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"4700d03e761a281b8e093f96eaaeb435e8de7c94a56384ad0ee179be7e85c990"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060branch_oid.nil? || branch_oid == pull_request.head_oid\u0060 appears character-identically in 2 files \u2014 lib/hive/workflow_package/publish_resolver.rb, lib/hive/workflow_package/registry_submission.rb. 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":"lib/hive/workflow_package/publish_resolver.rb"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"fedc86497211da2067092c9e04948c19cbf6fe362784177adb2cfd4df5955d26"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bytes == canonical(data) \u0026\u0026 data.is_a?(Hash) \u0026\u0026 data[\u0022schema_version\u0022] == 1 \u0026\u0026 data[\u0022hooks\u0022].is_a?(Hash)\u0060 appears character-identically in 2 files \u2014 lib/hive/module_package/managed_store.rb, lib/hive/modules/dispatcher.rb. 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":"lib/hive/module_package/managed_store.rb"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac29876ded004afa98e5dd996bc60ce8fa1af3accecb2f818aa809c4c6f64d92"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060candidate \u0026\u0026 File.file?(candidate) \u0026\u0026 File.read(candidate).include?(\u0022pr_url:\u0022)\u0060 appears character-identically in 2 files \u2014 web/script/record_box_demo_real.rb, web/script/record_box_demo_real_resume.rb. 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":"web/script/record_box_demo_real.rb"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6065ead4ae0aa7430ca2df97711a58dd995976da813cf5ce31133ff00117b17"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060candidate.is_a?(Hash) \u0026\u0026 candidate[\u0022codec_type\u0022] == \u0022video\u0022\u0060 appears character-identically in 2 files \u2014 lib/hive/artifacts/outcome_evidence/proof.rb, lib/hive/web/project_capture_provider.rb. 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":"lib/hive/artifacts/outcome_evidence/proof.rb"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a83f9a68bf0579bdab6c8765a6a6ca3f8d5479da234ee202a6b51aa2dfb354"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cfg.dig(\u0022daemon\u0022, \u0022enabled\u0022) == true \u0026\u0026 Hive::Workflows.coding_id?(cfg[\u0022default_workflow\u0022]) \u0026\u0026 cfg.dig(\u0022refactor_patrol\u0022, \u0022enabled\u0022) == true\u0060 appears character-identically in 3 files \u2014 lib/hive/daemon/refactor_patrol_merge_reconciler.rb, lib/hive/daemon/refactor_patrol_scheduler.rb, lib/hive/daemon/scheduled_architecture_scheduler.rb. 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":"lib/hive/daemon/refactor_patrol_merge_reconciler.rb"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81b5c15834548a74a3e80a516fa030b49433be7dab09b460e6778b4243b08d3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cfg.dig(\u0022daemon\u0022, \u0022enabled\u0022) == true \u0026\u0026 cfg.dig(\u0022refactor_patrol\u0022, \u0022enabled\u0022) == true \u0026\u0026 Hive::Workflows.coding_id?(cfg[\u0022default_workflow\u0022])\u0060 appears character-identically in 2 files \u2014 lib/hive/commands/refactor_patrol_scheduled.rb, lib/hive/one_shot/architecture_patrol_adapter.rb. 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":"lib/hive/commands/refactor_patrol_scheduled.rb"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed548389795bb2a7a89c9188051adcf0dbc8130cc35fbfcd4271d03e69540b6b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cfg.dig(\u0022patrol\u0022, \u0022poll_interval_sec\u0022) || 600\u0060 appears character-identically in 2 files \u2014 lib/hive/daemon/patrol_scheduler.rb, lib/hive/daemon/scheduled_architecture_scheduler.rb. 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":"lib/hive/daemon/patrol_scheduler.rb"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"11df91f6f12042c0130325838869bddf920c8709ddd127d42b954edbbd5dcb11"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cfg.dig(\u0022review\u0022, \u0022triage\u0022, \u0022agent\u0022) || \u0022claude\u0022\u0060 appears character-identically in 2 files \u2014 lib/hive/stages/review/triage.rb, lib/hive/workflow_package/configuration.rb. 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":"lib/hive/stages/review/triage.rb"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"e310083fbc1b4bc49a636a5870b7429ac0a203bb9a8ce038307e91bf48dd763d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cfg.dig(\u0022review\u0022, \u0022triage\u0022, \u0022bias\u0022) || \u0022courageous\u0022\u0060 appears character-identically in 2 files \u2014 lib/hive/stages/review.rb, lib/hive/stages/review/triage.rb. 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":"lib/hive/stages/review.rb"},"region":{"startLine":2632}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31ba910286cc88d4e943b6475dc87cd427830177c3187a275c186f2083fac62"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cfg.dig(stage, \u0022agent\u0022) || Hive::Config::DEFAULTS.dig(stage, \u0022agent\u0022) || \u0022claude\u0022\u0060 appears character-identically in 2 files \u2014 lib/hive/attempts/configured_dispatcher.rb, lib/hive/attempts/entrypoint.rb. 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":"lib/hive/attempts/configured_dispatcher.rb"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"74740b11b8001f73a4768b2a36c92a442877b1dce39b0653f81ee8e8b4299c9d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cfg[\u0022default_branch\u0022] || Hive::GitOps.new(project_root).detect_default_branch\u0060 appears character-identically in 3 files \u2014 lib/hive/commands/patrol.rb, lib/hive/commands/refactor_patrol.rb, lib/hive/daemon/patrol_scheduler.rb. 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":"lib/hive/commands/patrol.rb"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a53fc90f140e31ca89b6dfd0a875e029bda2ecb65416dc3e7cf21573b2dfc63"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cfg[\u0022default_branch\u0022] || git.default_branch\u0060 appears character-identically in 2 files \u2014 lib/hive/commands/rebase_status.rb, lib/hive/rebase.rb. 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":"lib/hive/commands/rebase_status.rb"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"289ef89a77eb641df103223ab94f60a9370d2fdc6998256827ad2c5b56d4f82a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cfg[\u0022worktree_root\u0022] || Hive::Worktree.default_worktree_root(File.basename(task.project_root))\u0060 appears character-identically in 2 files \u2014 lib/hive/stages/execute.rb, lib/hive/stages/review.rb. 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":"lib/hive/stages/execute.rb"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f41cdd0144eb192cce1e16d3435263e59f9a43fd4b4cd770c7fb875cd86823e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config || Hive::Config.load(project_root)\u0060 appears character-identically in 3 files \u2014 lib/hive/proposals/producer.rb, lib/hive/workflows/loader.rb, lib/hive/worktree.rb. 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":"lib/hive/proposals/producer.rb"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4f07f644ba6b6d87b34ff98e83b1832d1beaf843e9b2bda5e30f3973144e79"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config || Hive::Config.load(task.project_root)\u0060 appears character-identically in 2 files \u2014 lib/hive/plan_review/automation.rb, lib/hive/plan_review/transition_guard.rb. 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":"lib/hive/plan_review/automation.rb"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2b2e375d013177fb91521015ecb2f2048b0013b54b432daf1181e2a4061458"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060current \u0026\u0026 current.fetch(\u0022source_commit\u0022) == managed.fetch(\u0022source_commit\u0022) \u0026\u0026 current.fetch(\u0022manifest_digest\u0022) == managed.fetch(\u0022manifest_d\u2026\u0060 appears character-identically in 2 files \u2014 lib/hive/commands/new.rb, lib/hive/task_capture.rb. 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":"lib/hive/commands/new.rb"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d49bf68532640395e368a18d815f5b97546ab0ffa084f2ef42136631a826dd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060current.fetch(\u0022source_commit\u0022) == expected.fetch(\u0022source_commit\u0022) \u0026\u0026 current.fetch(\u0022manifest_digest\u0022) == expected.fetch(\u0022manifest_digest\u0022) \u0026\u2026\u0060 appears character-identically in 2 files \u2014 lib/hive/commands/workflow/remove.rb, lib/hive/commands/workflow/update.rb. 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":"lib/hive/commands/workflow/remove.rb"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f550e0daf5b447e270ffc94a0f287f21779c6518b2cc378af7116bbc1f959ba2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060current[\u0022exists\u0022] == expected[\u0022exists\u0022] \u0026\u0026 current[\u0022digest\u0022] == expected[\u0022digest\u0022]\u0060 appears character-identically in 2 files \u2014 lib/hive/agent_skills/adapters/base.rb, lib/hive/agent_support/codex/setup_adapter.rb. 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":"lib/hive/agent_skills/adapters/base.rb"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"6133e43f776005119502dcf6d0f710437209d5e75fcdfaaee616c59407b09c4e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060data.is_a?(Hash) \u0026\u0026 data.keys.sort == %w[entries schema] \u0026\u0026 data[\u0022schema\u0022] == CATALOG_SCHEMA \u0026\u0026 data[\u0022entries\u0022].is_a?(Array)\u0060 appears character-identically in 2 files \u2014 lib/hive/module_package/catalog_client.rb, lib/hive/workflow_package/registry_client.rb. 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":"lib/hive/module_package/catalog_client.rb"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8fb406ded1979d667b95c26b138aa39723db9bd336628a45c63095faab83b2a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060data[\u0022name\u0022].is_a?(String) \u0026\u0026 NAME.match?(data[\u0022name\u0022])\u0060 appears character-identically in 2 files \u2014 lib/hive/module_package/manifest.rb, lib/hive/workflow_package/registry_manifest.rb. 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":"lib/hive/module_package/manifest.rb"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea08d824bd16750068181ff0c9fe9e398a1e52e00474d15b920f8c2a3613ab3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060data[\u0022schema\u0022] == SCHEMA \u0026\u0026 data[\u0022schema_version\u0022] == SCHEMA_VERSION\u0060 appears character-identically in 4 files \u2014 lib/hive/daily_digest/record.rb, lib/hive/plan_review/decision.rb, lib/hive/plan_review/record.rb, lib/hive/plan_review/result_parser.rb. 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":"lib/hive/daily_digest/record.rb"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"006ec9dcac6cd632b8c8686ad8cd6800ab67c273491c6e6cae32855482dd378b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060data[\u0022schema\u0022] == SCHEMA \u0026\u0026 data[\u0022schema_version\u0022] == VERSION\u0060 appears character-identically in 2 files \u2014 lib/hive/user_service/applied_receipt.rb, lib/hive/user_service/transaction_journal.rb. 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":"lib/hive/user_service/applied_receipt.rb"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba47bdf9d2045a4e1393e3c39f01f4546531c14256057f8af03f983979da81a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060data[\u0022version\u0022].is_a?(String) \u0026\u0026 SEMVER.match?(data[\u0022version\u0022])\u0060 appears character-identically in 2 files \u2014 lib/hive/module_package/manifest.rb, lib/hive/workflow_package/manifest.rb. 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":"lib/hive/module_package/manifest.rb"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"952d970c8a69d3662d3b2d5e860e3703336554fc30806b075baf16ed8f95ac99"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060data[key].is_a?(String) \u0026\u0026 !data[key].empty?\u0060 appears character-identically in 2 files \u2014 lib/hive/daemon/refactor_patrol_merge_progress_store.rb, lib/hive/modules/decision_journal.rb. 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":"lib/hive/daemon/refactor_patrol_merge_progress_store.rb"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e89d448ce835464c94f25947a004e92fcff810faf06046dabb091e90c05566"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060default_branch.nil? || default_branch.strip.empty?\u0060 appears character-identically in 2 files \u2014 lib/hive/commands/rebase_status.rb, lib/hive/rebase.rb. 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":"lib/hive/commands/rebase_status.rb"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcaa72bddae43824a75825a08ef66bc70df31d44398515dbb9f0101e4e7f23ac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060defined?(File::NOFOLLOW) \u0026\u0026 defined?(File::NONBLOCK)\u0060 appears character-identically in 4 files \u2014 packaging/live_agent_skills/workflow_creator_archive.rb, packaging/live_agent_skills/workflow_creator_bundle.rb, packaging/live_agent_skills/workflow_creator_installation.rb, packaging/live_agent_skills/workflow_creator_openclaw_runtime.rb. 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":"packaging/live_agent_skills/workflow_creator_archive.rb"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"619156ebd4a997823cfac1c4c6f8758f2ceae676388b08ae59473dc38d937f30"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060defined?(Hive::CommandOperation) \u0026\u0026 Hive::CommandOperation.current_context\u0060 appears character-identically in 2 files \u2014 lib/hive/attempts/command_dispatch.rb, lib/hive/command_receipt_store/replay.rb. 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":"lib/hive/attempts/command_dispatch.rb"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5444797498978b33311adf9fa7afb7781be479d4035edf9db7a8e09e26fd6a7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060defined?(tmp) \u0026\u0026 tmp \u0026\u0026 File.exist?(tmp)\u0060 appears character-identically in 2 files \u2014 lib/hive/findings.rb, lib/hive/stages/review/suppression.rb. 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":"lib/hive/findings.rb"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"100da40c031e6eaed68238cd947ceeac3b31df32b9bff8a8feeb69a0f17dcdd3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060doc.is_a?(Hash) \u0026\u0026 doc[\u0022schema\u0022] == \u0022hive-status\u0022\u0060 appears character-identically in 2 files \u2014 lib/hive/bot/status_watcher.rb, lib/hive/daemon/status_consumer.rb. 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":"lib/hive/bot/status_watcher.rb"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a33d857f375f63b4bfd0f2ee06b13f5d908261bf7b91899553c42e838b1c12"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060document.is_a?(Hash) \u0026\u0026 document[\u0022schema\u0022] == SCHEMA\u0060 appears character-identically in 2 files \u2014 lib/hive/artifacts/capture_policy.rb, lib/hive/web/status_snapshot_store.rb. 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":"lib/hive/artifacts/capture_policy.rb"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"452c4850cd5eed20050e7087f8091566409b8a0fe504cc0e64d63b19f02e4fa5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060document[\u0022schema\u0022] == SCHEMA \u0026\u0026 document[\u0022schema_version\u0022] == 1\u0060 appears character-identically in 2 files \u2014 lib/hive/attempts/pending_bookkeeping.rb, lib/hive/patrol_fix/fix_report.rb. 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":"lib/hive/attempts/pending_bookkeeping.rb"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6b3a13598331299609dc5e9708461dd1a15debb436bec62521fb4f87bbc844"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry.is_a?(Hash) \u0026\u0026 entry.keys.sort == ENTRY_KEYS.sort\u0060 appears character-identically in 2 files \u2014 lib/hive/module_package/catalog_client.rb, lib/hive/workflow_package/registry_client.rb. 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":"lib/hive/module_package/catalog_client.rb"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"023a97d291f3089039be333ac879680351a4ab4c6a00006fd9dcdcbdeffd32fc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry.is_a?(String) \u0026\u0026 !entry.strip.empty?\u0060 appears character-identically in 2 files \u2014 lib/hive/config.rb, lib/hive/plan_review/route_resolver.rb. 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":"lib/hive/config.rb"},"region":{"startLine":3142}}}],"partialFingerprints":{"codehealthFindingId/v1":"65240c3e0fe8a330f079a33177e7bd3345b68532be63f8c64f14862b5d7e973e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry[\u0022hive_state_path\u0022] || File.join(entry.fetch(\u0022path\u0022), \u0022.hive-state\u0022)\u0060 appears character-identically in 3 files \u2014 lib/hive/commands/refactor_patrol_classify.rb, lib/hive/daemon/refactor_patrol_merge_reconciler.rb, lib/hive/daemon/refactor_patrol_scheduler.rb. 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":"lib/hive/commands/refactor_patrol_classify.rb"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aecce388f8f8cd289b4dafb6038bfcdbf55da3afba7688a3b29f42056164195"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry[\u0022type\u0022] == \u0022file\u0022 \u0026\u0026 entry[\u0022purpose\u0022] == \u0022research_output\u0022\u0060 appears character-identically in 2 files \u2014 lib/hive/conditions/gate_evaluator.rb, lib/hive/task_action.rb. 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":"lib/hive/conditions/gate_evaluator.rb"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca83cc94d9275ebd0165a6dc515f79bd565d3c69db0941ec3cbc2f5c25a50612"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060error.respond_to?(:suggested_id) \u0026\u0026 !error.suggested_id.nil?\u0060 appears character-identically in 2 files \u2014 lib/hive/commands/init.rb, lib/hive/commands/workflow.rb. 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":"lib/hive/commands/init.rb"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"c530a29ff7724850762fed53f5c8783fc0fbef231e83b876d50188faff739006"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060error.respond_to?(:value) \u0026\u0026 !error.value.nil?\u0060 appears character-identically in 3 files \u2014 lib/hive/commands/init.rb, lib/hive/commands/new.rb, lib/hive/commands/workflow.rb. 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":"lib/hive/commands/init.rb"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3abab68f975690acd99a15de62d30c44e5b72ca8bd84eb3a944819f2959532d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.is_a?(Hash) \u0026\u0026 event[\u0022type\u0022] == \u0022error\u0022\u0060 appears character-identically in 2 files \u2014 components/agent-cli-runtime/lib/agent_cli_runtime/error_extractors.rb, components/agent-cli-runtime/lib/agent_cli_runtime/opencode/result_parser.rb. 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":"components/agent-cli-runtime/lib/agent_cli_runtime/error_extractors.rb"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"954b3d95d3cd9b9263201836b86af6da7cb3dcf106c9073daedc0ae79db17386"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event[\u0022is_error\u0022] == true || event[\u0022subtype\u0022].to_s.start_with?(\u0022error\u0022)\u0060 appears character-identically in 2 files \u2014 components/agent-cli-runtime/lib/agent_cli_runtime/error_extractors.rb, lib/hive/agent.rb. 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":"components/agent-cli-runtime/lib/agent_cli_runtime/error_extractors.rb"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"c545bd65c4e2c9c0da8e325c7cfe128ae3eab99c61ee0fe96d16ef7c9d5ccb36"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060evidence[\u0022publication\u0022] == \u0022published\u0022 \u0026\u0026 evidence[\u0022failure_reason\u0022].nil?\u0060 appears character-identically in 2 files \u2014 lib/hive/stages/review.rb, lib/hive/stages/review/remote_ci.rb. 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":"lib/hive/stages/review.rb"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8fb98f54d1cbcfa613f0ffb099f1b8c50d8bd54d8f0dcd6fae9742dfa9cd417"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060execute_identity[\u0022model\u0022] || execute_identity[:model]\u0060 appears character-identically in 2 files \u2014 lib/hive/agent_support/muse.rb, lib/hive/agent_support/opencode.rb. 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":"lib/hive/agent_support/muse.rb"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f68f075fe011e44d30b26f55c518f1fbe39a7654f891086ddf58c34d46e2f4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060existing.empty? || existing.end_with?(\u0022\\n\u0022)\u0060 appears character-identically in 2 files \u2014 lib/hive/git_ops.rb, lib/hive/llm_wiki_bootstrap.rb. 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":"lib/hive/git_ops.rb"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"638a45029bbb9300d0c1135ed7049568937c341d65ac6afabb954a05bd396c72"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060existing[\u0022effective_gaps\u0022] || existing[\u0022gaps\u0022]\u0060 appears character-identically in 2 files \u2014 lib/hive/daily_digest/coordinator.rb, lib/hive/daily_digest/projector.rb. 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":"lib/hive/daily_digest/coordinator.rb"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"494eb20805f6b53e7b51a3548f44f00640f336aede51be9313e95b78d3b3035f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060expected_root || Hive::Worktree.canonical_root(task.project_root)\u0060 appears character-identically in 2 files \u2014 lib/hive/task_workspace/publication.rb, lib/hive/web/task_diff.rb. 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":"lib/hive/task_workspace/publication.rb"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"85cebefb893e5555563062e445bae8c0da193e90ee3b4235df79ad8c882dd965"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060expected_snapshot \u0026\u0026 snapshot != expected_snapshot\u0060 appears character-identically in 2 files \u2014 lib/hive/managed_directory.rb, lib/hive/web/task_capture.rb. 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":"lib/hive/managed_directory.rb"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4a237796beb261c45a53ec822bdf0b66d7a0f1ace689390c58982de427955c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060file.key?(\u0022patch\u0022) \u0026\u0026 (!file[\u0022patch\u0022].is_a?(String) || !file[\u0022patch\u0022].valid_encoding? || file[\u0022patch\u0022].include?(\u0022\\0\u0022))\u0060 appears character-identically in 2 files \u2014 lib/hive/refactor_patrol/merge_classifier.rb, lib/hive/refactor_patrol/pr_manifest.rb. 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":"lib/hive/refactor_patrol/merge_classifier.rb"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"82267075b0750b9e18e26b1544869522a67fc3969b556dc66cba97e05dcec99d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060finding.classification == \u0022gated_auto\u0022 \u0026\u0026 finding.blocking?\u0060 appears character-identically in 2 files \u2014 lib/hive/plan_review/decision_service.rb, lib/hive/plan_review/projection.rb. 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":"lib/hive/plan_review/decision_service.rb"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd53152472159e31ef3053dd7c88979a3a157784c55f8868d0b22003efaf0d6f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060generation.is_a?(Integer) \u0026\u0026 generation.positive?\u0060 appears character-identically in 3 files \u2014 lib/hive/patrol_fix/worktree_receipt.rb, lib/hive/refactor_patrol/job_record_validator.rb, lib/hive/refactor_patrol/job_store.rb. 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":"lib/hive/patrol_fix/worktree_receipt.rb"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f73da7d89ff35bc5747cdd0135bad35239f5a8479cb145740cf566c2ad84dd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060git_ops || Hive::GitOps.new(@project_root)\u0060 appears character-identically in 2 files \u2014 lib/hive/patrol_fix/task_materializer.rb, lib/hive/task_capture.rb. 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":"lib/hive/patrol_fix/task_materializer.rb"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"239aab36fa03bf81374947b3aeabe406044d53be1a7522eb697d3b46c41efc3f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060guard || ProjectGuard.new( state_root: entry.fetch(\u0022hive_state_path\u0022), project: entry.fetch(\u0022name\u0022), kind: :one_shot )\u0060 appears character-identically in 3 files \u2014 lib/hive/one_shot/architecture_patrol_adapter.rb, lib/hive/one_shot/dispatch_adapter.rb, lib/hive/one_shot/patrol_adapter.rb. 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":"lib/hive/one_shot/architecture_patrol_adapter.rb"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8cb93fd95204e3bc83fbea8fa6ea764cbfb6a3e7baf8b5a3f698a1edc7c80b1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060history \u0026\u0026 ProjectArchive.identity(history) == ProjectArchive.identity(attributes)\u0060 appears character-identically in 2 files \u2014 web/app/models/project.rb, web/app/models/status_page_feed.rb. 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":"web/app/models/project.rb"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4aee1793a3f0d2d36117eac3569415430c6b22a135ca186fd200267affa7f34"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060history_reader || Hive::TaskProjection::Reader.new( task_folder: task.folder, task: task )\u0060 appears character-identically in 4 files \u2014 lib/hive/conditions/execute_boundary.rb, lib/hive/conditions/reconcilers/execute.rb, lib/hive/implementation_identity/reconstructor.rb, lib/hive/implementation_identity/store.rb. 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":"lib/hive/conditions/execute_boundary.rb"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2d7b0473cfec109fb63bd8f41cff2004fddf424bc7672aef3421a0b6613faf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ingestor || Ingestor.new( source_store: @source_store, store: @store, git_ops: @git_ops )\u0060 appears character-identically in 2 files \u2014 lib/hive/proposals/producer.rb, lib/hive/proposals/reconciler.rb. 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":"lib/hive/proposals/producer.rb"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"2426a4734d02a2778d9878869e6e3076d0e63c60d8d12ba8566fdb468de221eb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060inventory.is_a?(Array) \u0026\u0026 inventory.all?\u0060 appears character-identically in 2 files \u2014 lib/hive/daemon/finalization_proof.rb, lib/hive/daemon/operational_snapshot.rb. 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":"lib/hive/daemon/finalization_proof.rb"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"202c5fa7bbb947cd41c4428f15404152d631ce874d815551cf2de4355a752162"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060kind == :keyrest || %i[key keyreq].include?(kind) \u0026\u0026 name == :deadline\u0060 appears character-identically in 2 files \u2014 lib/hive/task_workspace/builder.rb, lib/hive/task_workspace/dependency_component.rb. 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":"lib/hive/task_workspace/builder.rb"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd697cefcf26bf0e3fb4fb0e4b33f8d450b21188ce3079bc6e0a77278a552b68"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060launch_budget || Hive::Patrol::LaunchBudget.new( @project_root, cfg: cfg, charge_discovery: false )\u0060 appears character-identically in 2 files \u2014 lib/hive/daemon/patrol_fix_semantic_decision_runner.rb, lib/hive/refactor_patrol/merge_classifier_runner.rb. 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":"lib/hive/daemon/patrol_fix_semantic_decision_runner.rb"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc9292e37a55310517043a402217d544d65b8be9dccdb0f62eff6ad8b7cf650"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060liveness || ProjectLiveness.new(entry: entry)\u0060 appears character-identically in 3 files \u2014 lib/hive/one_shot/architecture_patrol_adapter.rb, lib/hive/one_shot/babysitter_adapter.rb, lib/hive/one_shot/patrol_adapter.rb. 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":"lib/hive/one_shot/architecture_patrol_adapter.rb"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7bc3f09aa2ee299d7d8d5c1133cf5c1d12a1b7abae1f55edce2d569c6cfab7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060match \u0026\u0026 match[:tool] == \u0022Read\u0022 \u0026\u0026 match[:specifier]\u0060 appears character-identically in 2 files \u2014 lib/hive/agent_support/codex/runtime.rb, lib/hive/workflow_package/runtime_policy.rb. 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":"lib/hive/agent_support/codex/runtime.rb"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c50535f8418b1e1bd0dda32189630fcb53fc238ee05ddfcc3387443190feabf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060match[:tool] == \u0022Edit\u0022 \u0026\u0026 match[:specifier]\u0060 appears character-identically in 2 files \u2014 lib/hive/permission_scope.rb, lib/hive/workflow_package/runtime_policy.rb. 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":"lib/hive/permission_scope.rb"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"76da4a64e0cb0a1ee29a0c88197abaed9e42ef10e3985f477f3f4fd94dcd44b0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060merges.is_a?(Array) \u0026\u0026 merges.size.between?(1, 8)\u0060 appears character-identically in 2 files \u2014 lib/hive/refactor_patrol/job_record_validator.rb, lib/hive/refactor_patrol/pr_manifest.rb. 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":"lib/hive/refactor_patrol/job_record_validator.rb"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d51be24b43cd41a6d52e3b288bc91c90ef085dfc75e205dbe6cf7f222515b60"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060meta[:workflow] \u0026\u0026 meta[:workflow_commit] \u0026\u0026 meta[:workflow_manifest_digest]\u0060 appears character-identically in 4 files \u2014 lib/hive/commands/status.rb, lib/hive/task.rb, lib/hive/workflow_package/managed_store.rb, lib/hive/workflow_package/task_migrator.rb. 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":"lib/hive/commands/status.rb"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4c1793ea83036d37245d1c7b25c7c171673bdf8b7d0f0f659bdef34e4b9c68a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060moved.project_root == task.project_root \u0026\u0026 moved.slug == task.slug \u0026\u0026 moved.workflow.controller?\u0060 appears character-identically in 2 files \u2014 lib/hive/commands/run.rb, lib/hive/stages/base.rb. 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":"lib/hive/commands/run.rb"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"927bbc1def0efc43571ec6706821ee66e32d26d073d7d69f6e565d3755eca325"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060msg.exit_code.nil? || msg.exit_code.zero?\u0060 appears character-identically in 2 files \u2014 lib/hive/tui/bubble_model.rb, lib/hive/tui/update.rb. 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":"lib/hive/tui/bubble_model.rb"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5c1893998ff28c9a958a8244daa283ed0d51d3a5ef95289c2a202c29553ef5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node_engine.instance_of?(String) \u0026\u0026 !node_engine.empty?\u0060 appears character-identically in 2 files \u2014 packaging/live_agent_skills/workflow_creator_live_runner.rb, packaging/live_agent_skills/workflow_creator_live_setup.rb. 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":"packaging/live_agent_skills/workflow_creator_live_runner.rb"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"3579c07963ff525b9248a596abe04878a2df8e8873285709330e29cfba4b218a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060number.is_a?(Integer) \u0026\u0026 number.positive?\u0060 appears character-identically in 2 files \u2014 lib/hive/patrol_fix/publication_receipt.rb, lib/hive/refactor_patrol/pr_manifest_resolver.rb. 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":"lib/hive/patrol_fix/publication_receipt.rb"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25150a5f20642cbe35f52d1031159f83d27d9df37f97de88e3619e4502f8062"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060opened.file? \u0026\u0026 !current.symlink? \u0026\u0026 opened.dev == current.dev \u0026\u0026 opened.ino == current.ino\u0060 appears character-identically in 3 files \u2014 lib/hive/markers.rb, lib/hive/proposals/store.rb, lib/hive/terminal_outcome.rb. 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":"lib/hive/markers.rb"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b9359c470a6287162c3cd00f6bf3e4e7adc0ab86dde9f72bff119067564c11"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060opened.file? \u0026\u0026 opened.dev == before.dev \u0026\u0026 opened.ino == before.ino\u0060 appears character-identically in 3 files \u2014 lib/hive/context_provenance/wiki_snapshot.rb, lib/hive/task_workspace/bounded_reader.rb, lib/hive/task_workspace/correlated_log.rb. 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":"lib/hive/context_provenance/wiki_snapshot.rb"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"491143f61e1d7c7b6d7c3333ec49e45c0b07f6cc1c640b223a79da38b584d375"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060opened.file? \u0026\u0026 opened.dev == stat.dev \u0026\u0026 opened.ino == stat.ino\u0060 appears character-identically in 4 files \u2014 lib/hive/commands/approve.rb, lib/hive/commands/decide.rb, lib/hive/review_budget/store.rb, lib/hive/task_activity.rb. 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":"lib/hive/commands/approve.rb"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1d612afdd929c847c74b80be914390d884462eb73b55c9df06fe08e854a7df"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parent == @root || parent.start_with?(\u0022#{@root}#{File::SEPARATOR}\u0022)\u0060 appears character-identically in 2 files \u2014 lib/hive/task_workspace/bounded_reader.rb, lib/hive/task_workspace/jsonl_reader.rb. 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":"lib/hive/task_workspace/bounded_reader.rb"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51495c56ec4b5c46b10a9149f753a40a82bb8dc029e267c042ab7d82fbc00f1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path == root || path.start_with?(\u0022#{root}#{File::SEPARATOR}\u0022)\u0060 appears character-identically in 3 files \u2014 lib/hive/artifact_firewall.rb, lib/hive/context_provenance/wiki_snapshot.rb, lib/hive/plan_review/plan_signals.rb. 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":"lib/hive/artifact_firewall.rb"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d6a258f3a91ba28a4153790e5479f5bf7977ff682e88e866ef13eca9418602"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path == root || path.start_with?(\u0022#{root}/\u0022)\u0060 appears character-identically in 2 files \u2014 lib/hive/proposals/source_event_store.rb, lib/hive/proposals/store.rb. 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":"lib/hive/proposals/source_event_store.rb"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec4e2924a45404ae67cc95da22c2a1314afc9ac36b0145865276d6b728da8ee"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path == root || path.start_with?(root \u002B File::SEPARATOR)\u0060 appears character-identically in 4 files \u2014 lib/hive/agent_skills/directory_publisher.rb, lib/hive/agent_support/codex/runtime.rb, lib/hive/agent_support/grok/skills.rb, lib/hive/diagnostic_helpers.rb. 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":"lib/hive/agent_skills/directory_publisher.rb"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"33bbd29c98e2520f6420dae2f2bb670c99ac16df029c93e6d9d7569c7af02993"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path.empty? || row[\u0022hasInstallScript\u0022] != true\u0060 appears character-identically in 2 files \u2014 packaging/live_agent_skills/workflow_creator_live_runner.rb, packaging/live_agent_skills/workflow_creator_live_setup.rb. 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":"packaging/live_agent_skills/workflow_creator_live_runner.rb"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9135e109f59587dbe5dbda4df92ee50c464a70d9d0c49abe09f940d7418a6e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060payload \u0026\u0026 payload[\u0022pid\u0022] == Process.pid \u0026\u0026 File.exist?(pid_file)\u0060 appears character-identically in 2 files \u2014 lib/hive/commands/babysit.rb, lib/hive/commands/daemon.rb. 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":"lib/hive/commands/babysit.rb"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d4d5eb5862fc987040d6540242c4a800eaf7c8f16ad11c974355528eb18825"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060permissions.is_a?(Hash) \u0026\u0026 permissions.keys.sort == PERMISSION_KEYS.sort\u0060 appears character-identically in 2 files \u2014 lib/hive/module_package/manifest.rb, lib/hive/workflow_package/registry_manifest.rb. 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":"lib/hive/module_package/manifest.rb"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"32af5587c6bff4e4ecc4802f38ba131788fe544cc484345fd6e39b066a5ce7b4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process_group_alive?(pid) \u0026\u0026 monotonic_now \u003C deadline\u0060 appears character-identically in 2 files \u2014 lib/hive/agent_skills/command_runner.rb, lib/hive/gh.rb. 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":"lib/hive/agent_skills/command_runner.rb"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab38750277b626b2fd2743db04f4c3eda019ee1a54d6ca04c44e2fbfbcb62651"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060project.to_s.empty? || slug.to_s.empty? || slug.include?(File::SEPARATOR)\u0060 appears character-identically in 2 files \u2014 lib/hive/commands/act.rb, lib/hive/operational_action.rb. 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":"lib/hive/commands/act.rb"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a38c9ecf81953898b5dd1c375a1abeb188254116f335858b0c8ee63592dc2c6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060project_root \u0026\u0026 File.expand_path(project_root)\u0060 appears character-identically in 2 files \u2014 lib/hive/agent_skills/inspector.rb, lib/hive/plan_review/adapters/base.rb. 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":"lib/hive/agent_skills/inspector.rb"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"98845749079efc3d3dbda7ddb803cb10d86e1a1b0ffe5db49614bb4d0813b9dc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060receipt.fetch(\u0022task\u0022) == manifest.fetch(\u0022task\u0022) \u0026\u0026 receipt.fetch(\u0022evidence_revision\u0022) == manifest.fetch(\u0022evidence_revision\u0022)\u0060 appears character-identically in 3 files \u2014 lib/hive/patrol_fix/secret_rework.rb, lib/hive/stages/patrol_fix/publish.rb, lib/hive/stages/patrol_fix/review.rb. 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":"lib/hive/patrol_fix/secret_rework.rb"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"be84ba6858dc43a4055aad02082220662f09d62260af54510fc15fb2de616759"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060record.bytesize \u003E= 4 \u0026\u0026 record.getbyte(2) == 32\u0060 appears character-identically in 2 files \u2014 lib/hive/commands/worktree.rb, lib/hive/stages/clean_exit.rb. 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":"lib/hive/commands/worktree.rb"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9cd8e6c4dc4c5a37e3955d857fc73187c4d43c3db6d3f8211bdd6c7aec4b2f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060record[\u0022effective_completeness\u0022] || record.fetch(\u0022completeness\u0022)\u0060 appears character-identically in 2 files \u2014 lib/hive/daily_digest/delivery.rb, lib/hive/daily_digest/telegram_renderer.rb. 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":"lib/hive/daily_digest/delivery.rb"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a17d40d8389dfa1701805c4e8bbce9bbf40a80feb142b4c3966dd0ee0ea7e7c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060record[\u0022effective_content\u0022] || record.fetch(\u0022content\u0022)\u0060 appears character-identically in 2 files \u2014 lib/hive/daily_digest/delivery.rb, lib/hive/daily_digest/telegram_renderer.rb. 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":"lib/hive/daily_digest/delivery.rb"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cab4e04604c191d6f87f947799ebfe7dcc5b9465b6d6f75996508c21220734c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060record[\u0022retry_at\u0022] \u0026\u0026 Time.iso8601(record.fetch(\u0022retry_at\u0022))\u0060 appears character-identically in 2 files \u2014 lib/hive/daemon/refactor_patrol_scheduler.rb, lib/hive/refactor_patrol/merge_classifier.rb. 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":"lib/hive/daemon/refactor_patrol_scheduler.rb"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23dbffb16242c4bd38a3997938e4c85e19c9310b7e0c59137e0426e6f2efb09"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060record[\u0022task_id\u0022] \u0026\u0026 task.id.to_s != record[\u0022task_id\u0022].to_s\u0060 appears character-identically in 2 files \u2014 lib/hive/attempts/finalization_maintenance.rb, lib/hive/attempts/reconciler.rb. 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":"lib/hive/attempts/finalization_maintenance.rb"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"6684d788b25dcbd7a228472f274eb83e45988de41ae6ccead53a3cc076785334"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060recovered \u0026\u0026 recovered[:task_folder] != task.folder\u0060 appears character-identically in 3 files \u2014 lib/hive/stages/patrol_fix/publish.rb, lib/hive/stages/patrol_fix/review.rb, lib/hive/stages/patrol_fix/validate.rb. 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":"lib/hive/stages/patrol_fix/publish.rb"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da3c03bca41d3c505f4889f39cb73599f5e4aa172bae1e691fa194fdbf04886"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060reference[\u0022sha256\u0022] || reference[:sha256]\u0060 appears character-identically in 2 files \u2014 lib/hive/output_reference.rb, lib/hive/runtime_control_plane/payload_store.rb. 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":"lib/hive/output_reference.rb"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62a271890949d44929174e08d512c87123cbb2723d836d7f22e3dd066d0f429"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060remaining.positive? \u0026\u0026 reader.join(remaining)\u0060 appears character-identically in 2 files \u2014 lib/hive/completion_time.rb, lib/hive/workflow_package/runtime_policy.rb. 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":"lib/hive/completion_time.rb"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"216fb72234cca8d5de609debb7bc9925373087acc0731d24f5dea2f1d2822fe4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060request.task_id.to_s.empty? || task.id.to_s.empty?\u0060 appears character-identically in 2 files \u2014 lib/hive/daemon/dispatcher.rb, lib/hive/daemon/recovery_coordinator.rb. 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":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":4468}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2d64e846d014304f072b8d375ddee0108ecb23e4ddd2a638af740f2430d8be"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.is_a?(Hash) \u0026\u0026 result[:moved_task_folder]\u0060 appears character-identically in 2 files \u2014 lib/hive/commands/run.rb, lib/hive/stages/base.rb. 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":"lib/hive/commands/run.rb"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c10474a28fd08f71d8ae48f5b9e6bdd359d66182cf0cccafb12174d6327b89"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.is_a?(Hash) \u0026\u0026 result[:status] == :error\u0060 appears character-identically in 2 files \u2014 lib/hive/refactor_patrol/reviewer.rb, lib/hive/stages/agent.rb. 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":"lib/hive/refactor_patrol/reviewer.rb"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5aac610e11e0862794f5f61c658e0d27e6e3e0f3ab8eeadd0483787f2eba498"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.is_a?(Hash) \u0026\u0026 result[:status] == :ok\u0060 appears character-identically in 3 files \u2014 lib/hive/daemon/patrol_fix_semantic_decision_runner.rb, lib/hive/refactor_patrol/merge_classifier_runner.rb, lib/hive/stages/agent_worktree.rb. 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":"lib/hive/daemon/patrol_fix_semantic_decision_runner.rb"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ca3598e87af7b76ecf56ee2967ba2db230b455de5939b5d62d113128f89c2f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.killed || result.skipped_reason == \u0022not_alive\u0022\u0060 appears character-identically in 4 files \u2014 lib/hive/artifacts/managed_project_server.rb, lib/hive/commands/web/capture_server.rb, lib/hive/refactor_patrol/process_group_resolver.rb, lib/hive/web/capture_runtime.rb. 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":"lib/hive/artifacts/managed_project_server.rb"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"3daa6d45ed03717171e53288ec221a3af3cc34b85fb5e168e3f75cbde0c62b6d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.valid? \u0026\u0026 result.data[\u0022execution_mode\u0022].to_s == \u0022research\u0022\u0060 appears character-identically in 3 files \u2014 lib/hive/conditions/transition_guard.rb, lib/hive/stages/execute.rb, lib/hive/task_action.rb. 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":"lib/hive/conditions/transition_guard.rb"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9a70d06bcc7137ea008bc38115d5b3e8017486fd0451f8bc22d0c6b0c983f4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result[:model] || usage[:model] || @identity.model || \u0022unknown\u0022\u0060 appears character-identically in 2 files \u2014 lib/hive/daemon/patrol_fix_semantic_decision_runner.rb, lib/hive/refactor_patrol/merge_classifier_runner.rb. 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":"lib/hive/daemon/patrol_fix_semantic_decision_runner.rb"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca2941049b83616344b6b3fdbaa0934b5841749d156984c7dddf1f54a1d3e49"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060review[\u0022effective_level\u0022] || review[\u0022computed_level\u0022] || \u0022pending\u0022\u0060 appears character-identically in 2 files \u2014 lib/hive/commands/status.rb, lib/hive/tui/views/tasks_pane.rb. 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":"lib/hive/commands/status.rb"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65f95ef0651ad1cd7aa56b941b6a2e5b9e16212dfec28fd30ea49428f329070"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060root_status.directory? \u0026\u0026 !root_status.symlink?\u0060 appears character-identically in 2 files \u2014 lib/hive/proposals/store.rb, web/app/models/task.rb. 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":"lib/hive/proposals/store.rb"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"438d4df37445b45612e94505cbdc654aca60c3fba7195b2b6d740ccbcedf9541"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060route \u0026\u0026 TRANSIENT_OUTCOMES.include?(route[\u0022outcome\u0022])\u0060 appears character-identically in 2 files \u2014 lib/hive/plan_review/decision_service.rb, lib/hive/plan_review/orchestrator.rb. 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":"lib/hive/plan_review/decision_service.rb"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f66a832958cb71c0f2a40a4755a226f35db0fa869b35554fe5ca5b85b1cb115"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060route \u0026\u0026 route[\u0022outcome\u0022] == \u0022unsupported\u0022\u0060 appears character-identically in 2 files \u2014 lib/hive/plan_review/orchestrator.rb, lib/hive/task_action.rb. 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":"lib/hive/plan_review/orchestrator.rb"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"d17fbb6a39cc6aa7fd9bd52b705353e641512324d7e6ada4c90f07a37258ae9f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060routing.is_a?(Hash) \u0026\u0026 routing[\u0022mode\u0022] == \u0022explicit\u0022\u0060 appears character-identically in 2 files \u2014 lib/hive/attempts/capacity_snapshot.rb, lib/hive/attempts/record.rb. 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":"lib/hive/attempts/capacity_snapshot.rb"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e3a0ae13c707e077df2b0ff3902da604502d9628a14e8b02de9faa0d870ba0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060row.respond_to?(:marker_attrs) \u0026\u0026 row.marker_attrs.is_a?(Hash)\u0060 appears character-identically in 2 files \u2014 lib/hive/daemon/auto_retry_safety.rb, lib/hive/daemon/stale_agent_healer.rb. 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":"lib/hive/daemon/auto_retry_safety.rb"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9c785d41738230525cb0f2f64e719e31d37133946f66eb81f08e2d020520c6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060row_value(row, :attempt_id) || row_value(row, :current_attempt)\u0060 appears character-identically in 2 files \u2014 lib/hive/daemon/recovery_coordinator.rb, lib/hive/recovery/api.rb. 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":"lib/hive/daemon/recovery_coordinator.rb"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd2be702fc0d2065aba50ec91a26a4dfd91b05fc131c4d6a70a51ea7ce054f2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060row_value(row, :state_file_mtime) || row_value(row, :observation_mtime) || row_value(row, :mtime)\u0060 appears character-identically in 2 files \u2014 lib/hive/daemon/recovery_coordinator.rb, lib/hive/recovery/api.rb. 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":"lib/hive/daemon/recovery_coordinator.rb"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e50e6b39e5dd7c97a167d46af61a888977d971b30056ffbea9350caa3ee8ac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060row_value(row, :task_generation) || row_value(row, :condition_task_generation)\u0060 appears character-identically in 2 files \u2014 lib/hive/daemon/recovery_coordinator.rb, lib/hive/recovery/api.rb. 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":"lib/hive/daemon/recovery_coordinator.rb"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"9541d857d8a7326bbe48e542053f84f29947ec3d0ea79acb75ae38cecabf6274"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060run.dig(:attempt_diagnostic, \u0022code\u0022) || run[:diagnostic].to_s[0, 256]\u0060 appears character-identically in 2 files \u2014 lib/hive/stages/patrol_fix/inbox.rb, lib/hive/stages/patrol_fix/review.rb. 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":"lib/hive/stages/patrol_fix/inbox.rb"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"750ccc92d7128d9237934dd0f1bf81387ef8db41d6f6aa0f617d28cd867d3c95"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060run.is_a?(Hash) \u0026\u0026 run.dig(:attempt_diagnostic, \u0022code\u0022)\u0060 appears character-identically in 3 files \u2014 lib/hive/stages/patrol_fix/fix.rb, lib/hive/stages/patrol_fix/inbox.rb, lib/hive/stages/patrol_fix/review.rb. 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":"lib/hive/stages/patrol_fix/fix.rb"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5bbe0c9f24ff08169c82c6725b737c95466eaf62aa6a7b8804921e54a8a2a7a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060segment.match?(/\\A[a-zA-Z0-9_.-]\u002B\\z/) \u0026\u0026 !%w[. ..].include?(segment)\u0060 appears character-identically in 2 files \u2014 lib/hive/gh/repository_identity.rb, lib/hive/refactor_patrol/repository_ownership.rb. 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":"lib/hive/gh/repository_identity.rb"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ff567a570c0c96fed7ca8087eda0ad8e35c4959243caee16d7c8d6883de2c7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060selection[\u0022active\u0022] || selection[\u0022previous\u0022]\u0060 appears character-identically in 2 files \u2014 lib/hive/modules/dry_run.rb, lib/hive/modules/inspector.rb. 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":"lib/hive/modules/dry_run.rb"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62c2aa20580ab1d0e9aba14cd4946f2bf9601ab897e01d87dbe97104761d2d0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060snapshot.applicable? \u0026\u0026 snapshot.remaining.positive?\u0060 appears character-identically in 2 files \u2014 lib/hive/commands/run.rb, lib/hive/review_budget.rb. 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":"lib/hive/commands/run.rb"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84593c48d738a20bb7e24ee6471e7482dbd25dcbce4e5dbbc295bbd129cbd21"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060source.is_a?(Hash) \u0026\u0026 source.keys.sort == SOURCE_KEYS.sort\u0060 appears character-identically in 2 files \u2014 lib/hive/module_package/manifest.rb, lib/hive/refactor_patrol/pr_manifest.rb. 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":"lib/hive/module_package/manifest.rb"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"170a27a44530c3ee399282e917887363db2914c0ce2ae24c49926cd2e20c9627"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060source[\u0022revision\u0022].is_a?(String) \u0026\u0026 REVISION.match?(source[\u0022revision\u0022])\u0060 appears character-identically in 2 files \u2014 lib/hive/module_package/manifest.rb, lib/hive/workflow_package/registry_manifest.rb. 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":"lib/hive/module_package/manifest.rb"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b7bd6f74bd3b7e624a7b40968a86d29dabe66f9ff079e7e4d5465678b72b4b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060spec.fetch(\u0022type\u0022) == \u0022secret\u0022 || spec[\u0022secret\u0022] == true\u0060 appears character-identically in 2 files \u2014 lib/hive/commands/module/base.rb, lib/hive/modules/inspector.rb. 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":"lib/hive/commands/module/base.rb"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"039e40f79d8ff4b2cf217c839d9b7007e79f6eccafa44f22252e9c461f41d4ad"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060spec[\u0022timeout_sec\u0022] || DEFAULT_TIMEOUT_SEC\u0060 appears character-identically in 2 files \u2014 lib/hive/agent_support/codex/reviewer.rb, lib/hive/reviewers/agent.rb. 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":"lib/hive/agent_support/codex/reviewer.rb"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"3231cb77c97ce139da04105b5298e83507969237341d37fe77f6c3b0ab8e8285"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stat.directory? \u0026\u0026 !stat.symlink? \u0026\u0026 stat.uid == Process.uid\u0060 appears character-identically in 12 files \u2014 components/agent-cli-runtime/lib/agent_cli_runtime/opencode/overlay.rb, lib/hive/artifacts/capture_toolkit.rb, lib/hive/artifacts/project_command_sandbox.rb, lib/hive/commands/evidence.rb. 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":"components/agent-cli-runtime/lib/agent_cli_runtime/opencode/overlay.rb"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"982bb80c2652bcdd97ea13171485237fe1b7a8adbaf4882326634a1942caf641"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stat.directory? \u0026\u0026 stat.uid == Process.uid\u0060 appears character-identically in 3 files \u2014 packaging/live_agent_skills/workflow_creator_bundle.rb, packaging/live_agent_skills/workflow_creator_process_supervisor.rb, packaging/live_agent_skills/workflow_creator_receipt_publisher.rb. 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":"packaging/live_agent_skills/workflow_creator_bundle.rb"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3287679e443286c3384e5912c52912fab3508796e0b40e49f10eb1f3075cad83"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stat.file? \u0026\u0026 !stat.symlink? \u0026\u0026 stat.nlink == 1\u0060 appears character-identically in 2 files \u2014 lib/hive/managed_directory.rb, packaging/release_candidate/release_selector.rb. 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":"lib/hive/managed_directory.rb"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcff6c4cc5269faf71673295d3cfef96d0ad9ffe08e35f048270b8b0d3470e58"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stat.file? \u0026\u0026 !stat.symlink? \u0026\u0026 stat.nlink == 1 \u0026\u0026 stat.uid == Process.uid\u0060 appears character-identically in 6 files \u2014 packaging/live_agent_skills/workflow_creator_execution.rb, packaging/release_candidate/artifacts.rb, packaging/release_candidate/asset_verifier.rb, packaging/release_candidate/baseline_cache.rb. 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":"packaging/live_agent_skills/workflow_creator_execution.rb"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e380ec826cc870de9002286de9cce8b3e59686fe6d884b98e664bf1819acb1f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stat.file? \u0026\u0026 !stat.symlink? \u0026\u0026 stat.uid == Process.uid\u0060 appears character-identically in 2 files \u2014 components/agent-cli-runtime/lib/agent_cli_runtime/opencode/overlay.rb, lib/hive/web/project_capture_provider.rb. 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":"components/agent-cli-runtime/lib/agent_cli_runtime/opencode/overlay.rb"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b8e452e7ee2e44d0dd9023d8c8151cdb0b2c9cd4e7a7223d3249aa5b0562a1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stat.file? \u0026\u0026 !stat.symlink? \u0026\u0026 stat.uid == Process.uid \u0026\u0026 stat.nlink == 1\u0060 appears character-identically in 2 files \u2014 packaging/live_agent_skills/workflow_creator_live_runner.rb, packaging/live_agent_skills/workflow_creator_live_setup.rb. 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":"packaging/live_agent_skills/workflow_creator_live_runner.rb"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ea052e50b72cc3efcb76a8081e87fa99895a1c4f0c15f949a79dcedf88ea30"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stat.symlink? || (!stat.directory? \u0026\u0026 !stat.file?)\u0060 appears character-identically in 2 files \u2014 lib/hive/workflow_package/authoring_lint.rb, lib/hive/workflow_package/publish_store.rb. 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":"lib/hive/workflow_package/authoring_lint.rb"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8dd134c4ffa4863828ea269c8f5d6856925c130d8312ca1702896f5533dc059"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state_file_path \u0026\u0026 File.exist?(state_file_path)\u0060 appears character-identically in 2 files \u2014 lib/hive/daemon/dispatcher.rb, lib/hive/daemon/status_consumer.rb. 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":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":4346}}}],"partialFingerprints":{"codehealthFindingId/v1":"d031c7442d872cc8213f408f5208c4c406bd6e6ea77fed519249a5b2e9308173"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060status.file? \u0026\u0026 !status.symlink? \u0026\u0026 status.uid == Process.uid \u0026\u0026 status.nlink == 1\u0060 appears character-identically in 2 files \u2014 lib/hive/daemon/finalization_proof.rb, lib/hive/runtime_control_plane/quiescence_upgrade.rb. 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":"lib/hive/daemon/finalization_proof.rb"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9211d549823bd60d2f91c482687badcd3437301e717559a99dd695df974fea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060status.success? \u0026\u0026 File.file?(destination) \u0026\u0026 !File.symlink?(destination)\u0060 appears character-identically in 2 files \u2014 packaging/managed_web_archive.rb, packaging/release_candidate/artifacts.rb. 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":"packaging/managed_web_archive.rb"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3bacdd8b412f7c897c3a13d608de4e268a74df5fbd88bfbf72ec2a52751e0b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stripped.empty? || stripped.start_with?(\u0022#\u0022)\u0060 appears character-identically in 2 files \u2014 lib/hive/agent_support/codex/skills.rb, lib/hive/agent_support/codex/user_config.rb. 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":"lib/hive/agent_support/codex/skills.rb"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"2139fdec056954ca6ab536076c9ecb6f3f3cee130ffbd9f40e16e9c8447b03d7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060successor || Hive::PatrolFix::SuccessorMaterializer.new(task)\u0060 appears character-identically in 2 files \u2014 lib/hive/stages/patrol_fix/inbox.rb, lib/hive/stages/patrol_fix/review.rb. 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":"lib/hive/stages/patrol_fix/inbox.rb"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3f18a47054a07e85739037d204fdd1151b47f16226272df53d058ac4c32cb3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060task.is_a?(Hive::Task) \u0026\u0026 File.realpath(task.project_root) == File.realpath(project.fetch(\u0022path\u0022))\u0060 appears character-identically in 2 files \u2014 lib/hive/remote/command_service.rb, lib/hive/remote/read_service.rb. 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":"lib/hive/remote/command_service.rb"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"5514dfcfb8cf877fb53d68df523041622e470e4b1e5900e5ea05c0957d15faa5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060task.respond_to?(:folder) \u0026\u0026 task.folder\u0060 appears character-identically in 4 files \u2014 lib/hive/attempts/command_progress.rb, lib/hive/attempts/generation.rb, lib/hive/conditions/generation_tracker.rb, lib/hive/task_action.rb. 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":"lib/hive/attempts/command_progress.rb"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f470d1a728453fcf1a5f6a6b389babc753a6ce38771ecac0a618176dbdaee4a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060task.respond_to?(:project_root) \u0026\u0026 task.project_root\u0060 appears character-identically in 2 files \u2014 lib/hive/review_budget.rb, lib/hive/stages/base.rb. 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":"lib/hive/review_budget.rb"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b5e81005526cfac12e2866210b25fcce36b3eaad17c42e5d8715c6de9a568a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060telegram_factory || method(:build_telegram)\u0060 appears character-identically in 2 files \u2014 lib/hive/commands/answer_digest.rb, lib/hive/daily_digest/delivery.rb. 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":"lib/hive/commands/answer_digest.rb"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fdd345fe0a33f0830ee525f24a7e88bbe3d840144c31c6292db0f586f447cb0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060text.index(\u0022\\n\u0022, match.end(0)) || text.length\u0060 appears character-identically in 2 files \u2014 lib/hive/plan_review/plan_signals.rb, lib/hive/workflow_package/security_scanner.rb. 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":"lib/hive/plan_review/plan_signals.rb"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"026d470608bab0a8fe1e8ceb79700e1adea79871bccd80ecbe0d85cd0c5321bd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060token.is_a?(String) \u0026\u0026 token.match?(/\\A[a-z0-9]{16,64}\\z/)\u0060 appears character-identically in 3 files \u2014 lib/hive/daemon/patrol_fix_semantic_decision_runner.rb, lib/hive/stages/patrol_fix/inbox.rb, lib/hive/stages/patrol_fix/review.rb. 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":"lib/hive/daemon/patrol_fix_semantic_decision_runner.rb"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2b0f7f805f931f80868572b120517c523c2995343713cda52b3e89aa3c8179"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060utc(interval.fetch(\u0022starts_at\u0022)) \u003C= instant \u0026\u0026 instant \u003C utc(interval.fetch(\u0022ends_at\u0022))\u0060 appears character-identically in 2 files \u2014 lib/hive/daemon/daily_digest_delivery_scheduler.rb, lib/hive/daily_digest/coordinator.rb. 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":"lib/hive/daemon/daily_digest_delivery_scheduler.rb"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef333815cae66c9d17db82f84b52bd9be398cd4c28def1bebfc3b9dfcc1e0c39"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.empty? || value.start_with?(\u0022-\u0022) || value.match?(/[\\0\\r\\n]/)\u0060 appears character-identically in 2 files \u2014 lib/hive/agent_git_gate.rb, lib/hive/gh.rb. 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":"lib/hive/agent_git_gate.rb"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce9ebf99e7b828503a2a108c2297fe92dba9985ca1da33e54c86036c81b20e0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.is_a?(Numeric) \u0026\u0026 value.finite? \u0026\u0026 value.positive?\u0060 appears character-identically in 2 files \u2014 lib/hive/commands/watch.rb, lib/hive/workflows/descriptor_parser.rb. 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":"lib/hive/commands/watch.rb"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab822464a02b6697b6ee79da9182ef0513343bff8cd0e3b5cc858c68a3a52ab"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.is_a?(String) \u0026\u0026 !value.empty? \u0026\u0026 value.bytesize \u003C= 2_000 \u0026\u0026 value.valid_encoding? \u0026\u0026 !value.include?(\u0022\\0\u0022)\u0060 appears character-identically in 2 files \u2014 lib/hive/refactor_patrol/job_record_validator.rb, lib/hive/refactor_patrol/pr_manifest.rb. 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":"lib/hive/refactor_patrol/job_record_validator.rb"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"3240b1d034ef9ba74dded16b86e9d3402d7da25594cb99c4b8377c81da1c2f83"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.is_a?(String) \u0026\u0026 !value.strip.empty?\u0060 appears character-identically in 6 files \u2014 lib/hive/config.rb, lib/hive/patrol/reviewer.rb, lib/hive/plan_review/finding.rb, lib/hive/workflow_package/authoring_metadata.rb. 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":"lib/hive/config.rb"},"region":{"startLine":4340}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4a2988a01b258e7ddfd82fe4761bb04ed1fcbc277ab0d85e71f0517bbe9ca6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.is_a?(String) \u0026\u0026 !value.strip.empty? \u0026\u0026 value.valid_encoding?\u0060 appears character-identically in 2 files \u2014 lib/hive/module_package/manifest.rb, lib/hive/workflow_package/manifest.rb. 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":"lib/hive/module_package/manifest.rb"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"a616667649055875caef1fdf1d1aa21747cb8b594b43c1de84ca6f235b92db23"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.is_a?(String) \u0026\u0026 value.match?(/(?:Z|[\u002B-]\\d{2}:\\d{2})\\z/)\u0060 appears character-identically in 2 files \u2014 lib/hive/completion_time.rb, lib/hive/task_meta.rb. 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":"lib/hive/completion_time.rb"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5674dd09349e5bcc0c0600cd90b103cc4e7fd8df768765831b2d9e535bb868"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.is_a?(String) || value.is_a?(Integer)\u0060 appears character-identically in 2 files \u2014 lib/hive/daemon/dispatcher.rb, lib/hive/dependencies.rb. 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":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":2543}}}],"partialFingerprints":{"codehealthFindingId/v1":"07cf4b742203823d2c3725b41b3aadf252bd37dcd7bfbed8bac56c735b3fca69"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.is_a?(String) || value.is_a?(Symbol)\u0060 appears character-identically in 5 files \u2014 lib/hive/agent_profile.rb, lib/hive/model_routing.rb, lib/hive/provider_routing/configuration.rb, lib/hive/running_status.rb. 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":"lib/hive/agent_profile.rb"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"93989037affdb919dfb260a027373d2e399f55a4ff114e10689b0dd4df092f92"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.nil? || (value.is_a?(String) \u0026\u0026 !value.strip.empty?)\u0060 appears character-identically in 2 files \u2014 lib/hive/config.rb, lib/hive/refactor_patrol/job_record_validator.rb. 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":"lib/hive/config.rb"},"region":{"startLine":3005}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cfdc1a0e28f85d92c25e921070eb74f35b6650f31ede4654978cc50476d1008"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.nil? || value == true || value == false\u0060 appears character-identically in 3 files \u2014 lib/hive/config.rb, lib/hive/patrol/decision_projection.rb, lib/hive/review_publication_recovery.rb. 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":"lib/hive/config.rb"},"region":{"startLine":4145}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c72cda9c61be09c5e1529e178309ab15cf75242b2258cb4f4977c410f00767f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060version.is_a?(Integer) \u0026\u0026 version \u003E SCHEMA_VERSION\u0060 appears character-identically in 2 files \u2014 lib/hive/connection_contexts.rb, lib/hive/one_shot/schedule_state.rb. 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":"lib/hive/connection_contexts.rb"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"5306605c77924b93795d1bba136af74a138ae73ace979e029f789ee9deb35bd2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060worktree.nil? || worktree.to_s.strip.empty?\u0060 appears character-identically in 2 files \u2014 lib/hive/commands/rebase_status.rb, lib/hive/rebase.rb. 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":"lib/hive/commands/rebase_status.rb"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9893e70b52a7159e35e38769654b15cf2d385385b17e0d9b2ec087a0f83848"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060worktree_path \u0026\u0026 File.directory?(worktree_path)\u0060 appears character-identically in 3 files \u2014 lib/hive/commands/adhoc_review.rb, lib/hive/stages/base.rb, lib/hive/tui/bubble_model.rb. 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":"lib/hive/commands/adhoc_review.rb"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"377b4b5585d5c26a4e5fef1e40820aa9288555e05d8523bd7aab4524dbe572b3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060worktree_root \u0026\u0026 File.expand_path(worktree_root)\u0060 appears character-identically in 2 files \u2014 lib/hive/patrol_fix/worktree_receipt.rb, lib/hive/worktree.rb. 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":"lib/hive/patrol_fix/worktree_receipt.rb"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"99adcbfdc4ba399cf7a441fa0b972b6d889ff80f76a2e984bdae6f16f447e733"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060writer || Hive::TaskJournal::Writer.new( task_folder: task.folder, attempt_store: @attempt_store )\u0060 appears character-identically in 2 files \u2014 lib/hive/conditions/execute_boundary.rb, lib/hive/implementation_identity/store.rb. 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":"lib/hive/conditions/execute_boundary.rb"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c989b1c70b35557ec2f1040d2ee7b47fde4d0cd14b51732db65d762cce3c5c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060writer || Hive::TaskJournal::Writer.new( task_folder: task.folder, attempt_store: attempt_store )\u0060 appears character-identically in 2 files \u2014 lib/hive/conditions/reconcilers/execute.rb, lib/hive/implementation_identity/reconstructor.rb. 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":"lib/hive/conditions/reconcilers/execute.rb"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9adff8f6920cb0d90b348b35ab4113f43e47e4cb7eae37a0c4b534201b415d"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060normalize\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 22 (\u0060self.normalize\u0060) with a piece of \u0060value\u0060 (and at line 25) \u2014 and nowhere in \u0060normalize\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060normalize\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/canonical_json.rb"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"19cdfbefd1daee19f2c02de7e895779e785e80a8be6aeb906e1a63b6913ff9f3"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060canonicalize\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 132 (\u0060self.canonicalize\u0060) with a piece of \u0060value\u0060 (and at line 135) \u2014 and nowhere in \u0060canonicalize\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060canonicalize\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/command_mutations.rb"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e194d78949395fe92ad2fe4b6db890bc8157ef4cd7b0503593c4b4f4a9a8a34"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060reserve\u0060 is public, takes a document from its caller (line 153) and hands it to \u0060safe_request\u0060, which walks \u0060value\u0060 as a \u0060Hash\u0060 and calls itself at line 704 (\u0060self.safe_request\u0060) with a piece of \u0060value\u0060 (and at line 707) \u2014 and nowhere in \u0060safe_request\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060safe_request\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/command_receipt_store.rb"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7a90c5edd2ddb110d2e2432935f5bf8bc329823bdceb02965d8603952b4636"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060deep_freeze\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 1136 (\u0060self.deep_freeze\u0060) with a piece of \u0060value\u0060 (and at line 1138) \u2014 and nowhere in \u0060deep_freeze\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060deep_freeze\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/config.rb"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef3c1911fa5ec3a17550c8175d1485afc13195c48455a32149b0a1758742ced"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060canonical_membership_value\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 2180 (\u0060self.canonical_membership_value\u0060) with a piece of \u0060value\u0060 (and at line 2182) \u2014 and nowhere in \u0060canonical_membership_value\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060canonical_membership_value\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/config.rb"},"region":{"startLine":2180}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c9e975f92ef7f0ed4aa7757fd425a331340e51dfa3c15ead0504eb603f0bb3"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060deep_merge\u0060 is public and takes \u0060base\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 2220 (\u0060self.deep_merge\u0060) with a piece of \u0060base\u0060 \u2014 and nowhere in \u0060deep_merge\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060deep_merge\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/config.rb"},"region":{"startLine":2220}}}],"partialFingerprints":{"codehealthFindingId/v1":"735f52aeefa0aabbf735ac8a0ec11065ecaf5cb6414f0366fc617f5b3902ef1c"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060deep_dup\u0060 is public and takes \u0060obj\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 2227 (\u0060self.deep_dup\u0060) with a piece of \u0060obj\u0060 (and at line 2228) \u2014 and nowhere in \u0060deep_dup\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060deep_dup\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/config.rb"},"region":{"startLine":2227}}}],"partialFingerprints":{"codehealthFindingId/v1":"60efc433c371abfc250a0daf48ee5bd7e50dc5bb10c382fd0277fe681c64021e"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060canonical\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 461 (\u0060self.canonical\u0060) with a piece of \u0060value\u0060 (and at line 462) \u2014 and nowhere in \u0060canonical\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060canonical\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/context_provenance.rb"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf9d79273ddd28c7f8dd626c5932166756d38f21b3345b24097540b3ef60487"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060deep_freeze\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 41 (\u0060self.deep_freeze\u0060) with a piece of \u0060value\u0060 (and at line 43) \u2014 and nowhere in \u0060deep_freeze\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060deep_freeze\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol_fix.rb"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"d876eda23acc4c2c649f50932002b6706a64bdd0c25c19f92e3d733972a0baae"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060deep_freeze\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 65 (\u0060self.deep_freeze\u0060) with a piece of \u0060value\u0060 (and at line 67) \u2014 and nowhere in \u0060deep_freeze\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060deep_freeze\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/plan_review.rb"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f90d2234b93b915be38cfb62425396f7e3292c05bf16762d5b145a72c9dfad4"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060deep_freeze\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 228 (\u0060self.deep_freeze\u0060) with a piece of \u0060value\u0060 (and at line 230) \u2014 and nowhere in \u0060deep_freeze\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060deep_freeze\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/proposals.rb"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"738244401ac3143ba30f8eac293b2e42203985a48f75d473abad59a8082bf9fd"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060deep_freeze\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 164 (\u0060self.deep_freeze\u0060) with a piece of \u0060value\u0060 (and at line 166) \u2014 and nowhere in \u0060deep_freeze\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060deep_freeze\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/provider_routing.rb"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8556c2b08562f08216ca20f889100f40621000e21d8363e8e69a44c49df58d"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060deep_copy\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 176 (\u0060self.deep_copy\u0060) with a piece of \u0060value\u0060 (and at line 178) \u2014 and nowhere in \u0060deep_copy\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060deep_copy\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/provider_routing.rb"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4e1d8e805142afff9b391008baca5d60735034d602966a7616f6c331326790"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060canonical_wire_value\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 60 (\u0060self.canonical_wire_value\u0060) with a piece of \u0060value\u0060 (and at line 63) \u2014 and nowhere in \u0060canonical_wire_value\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060canonical_wire_value\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/recovery.rb"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"264da2f0d6662bf3f7587e26b287193c19916c91916fe86d716739cf1593162b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060call\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 7 (\u0060self.call\u0060) with a piece of \u0060value\u0060 (and at line 8) \u2014 and nowhere in \u0060call\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060call\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stringify_keys.rb"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"d261367307e47d50e084403106b70f2fa989450116010b6065fbf24e8a350f27"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060record\u0060 is public, takes a document from its caller (line 320) and hands it to \u0060sanitize\u0060, which walks \u0060value\u0060 as a \u0060Hash\u0060 and calls itself at line 442 (\u0060self.sanitize\u0060) with a piece of \u0060value\u0060 (and at line 444) \u2014 and nowhere in \u0060sanitize\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060sanitize\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_activity.rb"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bbbf233ff9feb38ac4a502dcaa5171e5ca1cf63cdae2005db2f4359dde59359"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060json_safe_evidence\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 631 (\u0060self.json_safe_evidence\u0060) with a piece of \u0060value\u0060 (and at line 632) \u2014 and nowhere in \u0060json_safe_evidence\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060json_safe_evidence\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_meta.rb"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c2d5064950f6bab79eceb3c76816d6367ba7a84856bff3246c7200a1244488"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060canonical\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 108 (\u0060self.canonical\u0060) with a piece of \u0060value\u0060 (and at line 109) \u2014 and nowhere in \u0060canonical\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060canonical\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_projection.rb"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe63c1f8c2cf50d629bf2b69d9e623987589a0d2d1868d4be630046c1a2a7ab2"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060canonical\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 40 (\u0060self.canonical\u0060) with a piece of \u0060value\u0060 (and at line 42) \u2014 and nowhere in \u0060canonical\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060canonical\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_workspace.rb"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"f971c665b26bd474fc4875ca8a73fd42543f8b333de62d2da2915ba3b3a63b95"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060normalize\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 22 (\u0060self.normalize\u0060) with a piece of \u0060value\u0060 (and at line 25) \u2014 and nowhere in \u0060normalize\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060normalize\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/workflow_package/canonical_json.rb"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"61745176ac8b4f8c16a2ad94dcd0589a82d93eb519271369bffd4a2c616d78fb"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060initialize\u0060 is public, takes a document from its caller (line 49) and hands it to \u0060deep_copy\u0060, which walks \u0060value\u0060 as a \u0060Hash\u0060 and calls itself at line 290 (\u0060self.deep_copy\u0060) with a piece of \u0060value\u0060 (and at line 291) \u2014 and nowhere in \u0060deep_copy\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060deep_copy\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/workflow_package/publish_receipt.rb"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"55bd1e2abac71a7dac4c5e22b72061ff90b2d09ae136dfa9e14de52394194240"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060write\u0060 is public, takes a document from its caller (line 18) and hands it to \u0060encode\u0060, which walks \u0060value\u0060 as a \u0060Hash\u0060 and calls itself at line 42 (\u0060self.encode\u0060) with a piece of \u0060value\u0060 (and at line 44) \u2014 and nowhere in \u0060encode\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060encode\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/workflow_package/transaction_journal.rb"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e5cb643724fb64fdeeef36cc3867480047696529cbe1676c6f9f493444d559"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060initialize\u0060 is public, takes a document from its caller (line 14) and hands it to \u0060stringify_keys\u0060, which walks \u0060value\u0060 as a \u0060Hash\u0060 and calls itself at line 605 (\u0060self.stringify_keys\u0060) with a piece of \u0060value\u0060 \u2014 and nowhere in \u0060stringify_keys\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060stringify_keys\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_workspace/dependency_component.rb"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2fc683ca2a8e5ed6b9a9de85cf978c6d81ce0ed289ac141965e1eee645636d"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060decimal_strings\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 67 (\u0060self.decimal_strings\u0060) with a piece of \u0060value\u0060 (and at line 69) \u2014 and nowhere in \u0060decimal_strings\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060decimal_strings\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_workspace/semantic_snapshot.rb"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a6964f32c18e565e4e38356a3a7bcddb7242db3d5c4c3f4b835f6b12a500a8"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060normalize\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 57 (\u0060self.normalize\u0060) with a piece of \u0060value\u0060 (and at line 60) \u2014 and nowhere in \u0060normalize\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060normalize\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/runtime_control_plane/codec.rb"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d04c30222436d5a24edbaceeb85ed93c1f04ceef9fbcc0d98808460206cbf7"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060bound!\u0060 is public, takes a document from its caller (line 83) and hands it to \u0060collect_content\u0060, which walks \u0060value\u0060 as a \u0060Hash\u0060 and calls itself at line 110 (\u0060self.collect_content\u0060) with a piece of \u0060value\u0060 (and at line 114) \u2014 and nowhere in \u0060collect_content\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060collect_content\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/remote/serializers.rb"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"abbacdfb57d45d72d45451803073678bb70e1300c00d63c9f8acf6648ff12a9c"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060canonical_json_value\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 199 (\u0060self.canonical_json_value\u0060) with a piece of \u0060value\u0060 (and at line 201) \u2014 and nowhere in \u0060canonical_json_value\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060canonical_json_value\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/pr_manifest.rb"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"db03e5cafd35627c3ac5670cf1b4649ab9708d931a52fdbd31f44360114f1b0b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060initialize\u0060 is public, takes a document from its caller (line 25) and hands it to \u0060stringify\u0060, which walks \u0060value\u0060 as a \u0060Hash\u0060 and calls itself at line 111 (\u0060self.stringify\u0060) with a piece of \u0060value\u0060 (and at line 112) \u2014 and nowhere in \u0060stringify\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060stringify\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/plan_review/finding.rb"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19794dc4e180b077613af88b3677519a529f57e9a5100d54bb93ff858188986"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060initialize\u0060 is public, takes a document from its caller (line 60) and hands it to \u0060stringify\u0060, which walks \u0060value\u0060 as a \u0060Hash\u0060 and calls itself at line 1532 (\u0060self.stringify\u0060) with a piece of \u0060value\u0060 (and at line 1533) \u2014 and nowhere in \u0060stringify\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060stringify\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/plan_review/orchestrator.rb"},"region":{"startLine":1532}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cfba1c0dfd653e461a28ec443458fb19379d481d540fd784da8ce2ef88657b6"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060write_attempt!\u0060 is public, takes a document from its caller (line 47) and hands it to \u0060sanitize\u0060, which walks \u0060value\u0060 as a \u0060Hash\u0060 and calls itself at line 405 (\u0060self.sanitize\u0060) with a piece of \u0060value\u0060 (and at line 406) \u2014 and nowhere in \u0060sanitize\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060sanitize\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/plan_review/store.rb"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"572fa83a66d8e58e0c04f89f3a081fb2c3549bc5ecc447a115a632bc35c1eef3"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060deep_freeze\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 234 (\u0060self.deep_freeze\u0060) with a piece of \u0060value\u0060 (and at line 235) \u2014 and nowhere in \u0060deep_freeze\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060deep_freeze\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/modules/status.rb"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2ec3010dfd4efcc729965e85f5a94f7e5712814e8032b91b97296eb8ba3069"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060initialize\u0060 is public, takes a document from its caller (line 291) and hands it to \u0060deep_freeze\u0060, which walks \u0060value\u0060 as a \u0060Hash\u0060 and calls itself at line 313 (\u0060self.deep_freeze\u0060) with a piece of \u0060value\u0060 (and at line 314) \u2014 and nowhere in \u0060deep_freeze\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060deep_freeze\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/module_package/manifest.rb"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"c288764858855275a6587c9db6231b582146be64a8559d85458c26f23c1dda36"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060deep_freeze\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 86 (\u0060self.deep_freeze\u0060) with a piece of \u0060value\u0060 (and at line 87) \u2014 and nowhere in \u0060deep_freeze\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060deep_freeze\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/module_package/normalizer.rb"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"980160ff4e2ab59c71356ec9c8aba70467dc4af7adaf41c09512677340305c13"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060initialize\u0060 is public, takes a document from its caller (line 14) and hands it to \u0060stringify\u0060, which walks \u0060value\u0060 as a \u0060Hash\u0060 and calls itself at line 201 (\u0060self.stringify\u0060) with a piece of \u0060value\u0060 (and at line 202) \u2014 and nowhere in \u0060stringify\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060stringify\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daily_digest/coverage.rb"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"46596100ac1be486cd9d36de28e771773738eaaf831040365a200ad8b27fed06"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060stringify\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 313 (\u0060self.stringify\u0060) with a piece of \u0060value\u0060 (and at line 314) \u2014 and nowhere in \u0060stringify\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060stringify\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daily_digest/materiality.rb"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb82df9f7e8893420083573e38cd0ac937246d7497f1228291d7229a04b9dc7d"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060stringify\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 152 (\u0060self.stringify\u0060) with a piece of \u0060value\u0060 \u2014 and nowhere in \u0060stringify\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060stringify\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daily_digest/public_view.rb"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae645516613de0dc83470386071295826da8c543f8767549dbf4ba790bb19a5"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060canonical_object\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 146 (\u0060self.canonical_object\u0060) with a piece of \u0060value\u0060 (and at line 148) \u2014 and nowhere in \u0060canonical_object\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060canonical_object\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daily_digest/record.rb"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fff80124afc71bde1977c19666bfd429b048c2b266a394d2b9ece7bff64a58b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060publish!\u0060 is public, takes a document from its caller (line 33) and hands it to \u0060stringify\u0060, which walks \u0060value\u0060 as a \u0060Hash\u0060 and calls itself at line 142 (\u0060self.stringify\u0060) with a piece of \u0060value\u0060 (and at line 143) \u2014 and nowhere in \u0060stringify\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060stringify\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/finalization_proof.rb"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe267cca65644af6302393539a7e4a9ff8352d42c22981c0c4e2551aeb2ced8"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060stringify\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 266 (\u0060self.stringify\u0060) with a piece of \u0060value\u0060 (and at line 268) \u2014 and nowhere in \u0060stringify\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060stringify\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/context_provenance/context_receipt.rb"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38f96fa9fc868afa62d643377738bf2ee1a64d5becafc7be63a2f10aa2d8304"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060deep_freeze\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 73 (\u0060self.deep_freeze\u0060) with a piece of \u0060value\u0060 (and at line 74) \u2014 and nowhere in \u0060deep_freeze\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060deep_freeze\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/conditions/evidence.rb"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f09e3ba87781e885843314364ae4647b59449457909458ad3c8a0c8a777d49e2"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060canonical_value\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 174 (\u0060self.canonical_value\u0060) with a piece of \u0060value\u0060 \u2014 and nowhere in \u0060canonical_value\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060canonical_value\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/attempts/evidence_channel.rb"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"26625fb5291f73479a15fac54b9a1fc7a7b287a3de1e6c9a8809c7de20e182d0"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060deep_copy\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 184 (\u0060self.deep_copy\u0060) with a piece of \u0060value\u0060 \u2014 and nowhere in \u0060deep_copy\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060deep_copy\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/attempts/evidence_channel.rb"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"979a00ed71ca8cd2422af09113a283fe95074a90bf2481754dff877d6054bf63"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060deep_freeze\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 196 (\u0060self.deep_freeze\u0060) with a piece of \u0060value\u0060 \u2014 and nowhere in \u0060deep_freeze\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060deep_freeze\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/attempts/evidence_channel.rb"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"716266d1f3612b2695054a51fea4408cf5790d3b2fd06603649b0973df829d6b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060canonical_value\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 619 (\u0060self.canonical_value\u0060) with a piece of \u0060value\u0060 (and at line 621) \u2014 and nowhere in \u0060canonical_value\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060canonical_value\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/attempts/record.rb"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff028f40d223da46aa279a844a57bb0946439a0b89ce562e49c51b2dc0b34baf"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060deep_freeze\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 630 (\u0060self.deep_freeze\u0060) with a piece of \u0060value\u0060 (and at line 632) \u2014 and nowhere in \u0060deep_freeze\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060deep_freeze\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/attempts/record.rb"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda20a1df5f9f599b8ebb7079c8d83711e9dc8404cb2c2b726f74f2afd27fcab"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060initialize\u0060 is public, takes a document from its caller (line 28) and hands it to \u0060immutable\u0060, which walks \u0060value\u0060 as a \u0060Hash\u0060 and calls itself at line 45 (\u0060self.immutable\u0060) with a piece of \u0060value\u0060 (and at line 48) \u2014 and nowhere in \u0060immutable\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060immutable\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/agent_skills/directory_publisher.rb"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7390486d88e633735408805f2d755b1d1045701da851b8358d36958d7566ed5"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060deep\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 46 (\u0060self.deep\u0060) with a piece of \u0060value\u0060 \u2014 and nowhere in \u0060deep\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060deep\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"components/agent-cli-runtime/lib/agent_cli_runtime/values.rb"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d636b0f38380e32a14f0bf3fd4ba7b9bacfd337cdeb1b4f3a5854f534b55bb"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060validate_nonsecret!\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 210 (\u0060self.validate_nonsecret!\u0060) with a piece of \u0060value\u0060 (and at line 212) \u2014 and nowhere in \u0060validate_nonsecret!\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060validate_nonsecret!\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"components/agent-cli-runtime/lib/agent_cli_runtime/opencode/overlay.rb"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0d825f96685e1a86066324f0d68d9c2bc67961a03f2a822a40157646a5aa9f"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060environment_placeholders\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 248 (\u0060self.environment_placeholders\u0060) with a piece of \u0060value\u0060 (and at line 250) \u2014 and nowhere in \u0060environment_placeholders\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060environment_placeholders\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"components/agent-cli-runtime/lib/agent_cli_runtime/opencode/overlay.rb"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20c191bc9738c2e612ff388d3dad307ebe9a3342d5c6919401f2182a6550727"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060svg\u0060 is text this program did not author, and it is written into the text of an element through \u0060innerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/javascript/controllers/mermaid_controller.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88dcabab05763dda0c26fa54c68e3f4782d2e2e31ce26490df6150d4de50944"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060data\u0060 is text this program did not author, and it is written into the text of an element through \u0060innerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/javascript/status_stream_source.js"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b1543628829d69f443d30c613634d4fac1423031fa19a78a086701046c2e86"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060\u2026 rescue 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":"web/script/record_box_demo.rb"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"662a132472b1427cb2b588048294a03c6847fc05d2b5d95265cff21c7360a44e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060\u2026 rescue 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":"web/script/record_box_demo_real.rb"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2141dd689034a682426cda8bdd2fff979d2d7380f175a46d006045fb33ccea"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060\u2026 rescue 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":"web/script/record_box_demo_real_resume.rb"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6a132933a2f4fdaf1bb7361bfdb1572bbe2eefa0bea852458dbe2172a47aed"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060\u2026 rescue 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":"web/script/support/capture_server.rb"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"8978231c5f0ad3ac5d9e0b576f2237cd6eb4e566f1cb1d7963b6b50c62469ee5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060\u2026 rescue 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":"web/script/support/capture_server.rb"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed9f65570bcf0bab80385203f04509cb5e2c9d4d5f3d25dbfe8bbbc33078a1b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060\u2026 rescue 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":"web/script/support/capture_server.rb"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b24b8952d4c389ae2ff80fe1591636d2fcccc00632f1dc3a27900409d95e00a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060\u2026 rescue 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":"web/app/models/repository.rb"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e1a224de1a20aa7ad8b367cb43730d7747d1c0571bebc071eabe30d5854b6e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060\u2026 rescue 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":"web/app/models/repository.rb"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"34fc3dfb89a0ccf65342c62109d98637b010d15c9e4338570332aa6082dc2047"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"web/app/models/task.rb"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"88464d849d6cf2591c225558c66964626d8b2c504989fedb1751d1121768da6e"}},{"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":"web/app/javascript/status_stream_source.js"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"b125fa4c3d5a77dafd6edbfc4e14e0e5de726b2f46c823f74afcfd73a38a0901"}},{"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":"web/app/javascript/controllers/kanban_column_controller.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfbd93ead31cd489f8ed5b51e3b28723646c05788eb1f59c5bf74b607a954a39"}},{"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":"web/app/javascript/controllers/kanban_column_controller.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f60ae1c42ae0fe52f942d4015026f2896ac1b2ef7ddf2d9ca56b34da85110f3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"script/flake_sweep.rb"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c486b678afadf5ba790d82d1420b079f512c02bf2cea33a29ea5880f2591296"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060\u2026 rescue 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":"packaging/release_candidate/paths.rb"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f438028a6ab4cefa987423235fdff4f29b5ecfecfca59e50d56eba73f1b9a2a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060\u2026 rescue 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":"packaging/release_candidate/process_teardown.rb"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c5ca5ce143ae88bc94bf713cf94845ad34596f92ae13d10af7c02cbbbfb8a7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"packaging/live_agent_skills/workflow_creator_execution.rb"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ae16bc79a36f303ac9b6718c8c9282b4ba6960d703de50ed72164ce894165c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060\u2026 rescue 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":"packaging/live_agent_skills/workflow_creator_gateway.rb"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"697599cbc2703b702f54dd5da8d7ac9babdecac00621aea52115040c8f558a8d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060\u2026 rescue 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":"packaging/live_agent_skills/workflow_creator_gateway.rb"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a55c9a05de8c69b888178fcbdd2f5f34462a86109d1e71ee899ee6c1fc002a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060\u2026 rescue 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":"packaging/live_agent_skills/workflow_creator_gateway.rb"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf36bc0784a33bd21d20eb9c292766726ea3c97db2ab5a219070aacefcc8bf8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060\u2026 rescue 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":"packaging/live_agent_skills/workflow_creator_process_supervisor.rb"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"0799d24487e017128ca679ee5aa543c8ae7c1666864644934c7bfbd1ea7eeca5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/agent.rb"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"b755ad9265ff4f6ae90178a2a083a61288a6cd0c4e5092a163dada489e2ead9f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/agent_profile.rb"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"45948db6408e12228ff6ca441f1dda4891a71842f7bd540ee5bb0f6a9d464000"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/agent_runtime.rb"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"770fdb54e968d3d120a92b7bdec3b0f92f0125ed42c8e8984775d0b90811b062"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/artifact_firewall.rb"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"392a4a2d801e017127193c99f3fed635bc365876ca35d592ed362efe9a3eb58c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/context_provenance.rb"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3dd98fc8b714b30ab987d9422924236b8d0dfe24916865a9648e5cf41090bba"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/context_provenance.rb"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"a741ebc2e727b9f4bb63b49c03e67bd9ef758975fd3bc1dc106043317a51d56b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/context_provenance.rb"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b0aa7c3cd285d08032024cd6dc3de3c042a0873de6ad46246a3a9b891ea43c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/dependency_snapshot.rb"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"4826149e6e2f364ca1a70875e81b6759ff336cf6393ca1a8ccb2e853594653dc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/git_ops.rb"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ed54a4be18323ce57f8bdcffc4b166652029d5923872d13134869474206e3c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/git_ops.rb"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1bf52d4aeef8ffedf0bb94e621165ccdc9b7070610c4f25ac617a9ec1e8c5e0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/git_ops.rb"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b457a777646c3e380b90198119968ba974fb3c64dc025366371603dd86e6a2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/git_ops.rb"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"788affa8f702bbde6cb12acf4adf46bc635cdac8329523117129cb769df7d873"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue SystemCallError, Exception, ArgumentError\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":"lib/hive/llm_wiki_bootstrap.rb"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"552b2b0f66e81ac49fa2808e91dfc94617ab5689a79d17645fcfa365ff7bce97"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/lock.rb"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e6e65f3e73cefd6f94441328002f46fd079be7e74f2bb1aa87e022dec42b7a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060\u2026 rescue 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":"lib/hive/managed_directory.rb"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"326288420c794205bf7fc7c1e305a36d69811a42b4bedaf3eeecc319b80811b2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060\u2026 rescue 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":"lib/hive/managed_directory.rb"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"b706d546de4182dd75e93c2828494d32d24a58ebb0c418031fa8aad4aa0bece7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/managed_git.rb"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0bf9d42705a272a87c371e37e44f58334575bb832ed5e1dc647bc04016eb5f2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/markers.rb"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed97cccd213e1a48cfb82cb474d95f7aa004b6931e1dcd9c716c89ca145bdda"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue Exception, SystemStackError, NoMemoryError\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":"lib/hive/pid_file.rb"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e464929530d03348981c29bbb5725e7fbc2654e06618c3a84f837f22490d8b7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue Exception, SystemStackError, NoMemoryError\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":"lib/hive/running_status.rb"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"859186e12a43a48bf1bdb4735da1d4edbcf49767490c7ca794ce16bfba9c9245"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue Exception, SystemCallError\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":"lib/hive/task_action.rb"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b3b7a48b4f3a1c3bab7c593fcc181e2d19952f609caa8f3cf1810f235c7c02"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/update_check.rb"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d570a827ec6ad25b4262b8c9f4c692e24e8f1f04cc3f1315d0374c812b66319"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/update_check.rb"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"529edb3b452dcaa6a0a37f09b71902396c909a1bda2f33f4dfa66752f28ae843"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/user_service.rb"},"region":{"startLine":1944}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed8cd9eef652cb1a49900872884403872c71cb6bfe6ecbb9bf3540a599bafc92"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue Exception, SystemCallError, IOError\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":"lib/hive/worktree.rb"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc4fa7962cf6d66cfea6e29db5f2b9d3cf5172cd0948ea55e9a94fd7217d394"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060\u2026 rescue 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":"lib/hive/workflow_package/mutation_lock.rb"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"92880e9e114215effb09357d848c1db53bd71a00b3daf97582a042f56d5b687b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060\u2026 rescue 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":"lib/hive/workflow_package/mutation_lock.rb"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb90542a8c4f7b9e5d69bb5f5b00033857d1027d692e67fef980a8d0bfe638a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060\u2026 rescue 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":"lib/hive/workflow_package/publish_lock.rb"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27dc9c2c81f418348612be85f6b4a45c3eeac714a4fdb73611410ad72b345d8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060\u2026 rescue 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":"lib/hive/workflow_package/publish_lock.rb"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fae44470cdb20d27f98bbdb883688a61f6f90e3b27d8e9c3fd6b202a276de3c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue Exception, ENOENT, EACCES, IOError\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":"lib/hive/workflow_package/publisher.rb"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"b157e4a2b4a4a45422029f3465cd87912306acf6e56b7f9d54a2db6c62476e64"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060\u2026 rescue {}\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":"lib/hive/web/service_status.rb"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c4ec816e5afeb2617bd325ab754e8e6b8135c79f826bc9d65c024dd1440c95"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/web/status_snapshot_store.rb"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"0768e04d1accb28bd5b7732af48ff69202ad32394714c187f1ef1b6c40cac5a4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/web/task_capture.rb"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"14fe91bc017a2e4771960ad087233d7074ee40d5871e1d5c2951937837886e87"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/web/task_capture.rb"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b92539e2ac6462a6be5d2d632227eb6831b8f97a888673677a45af89d82a49"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/user_service/manager.rb"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"314a826a4fd764e960e3231e0ac83f7982540042da77bc6561fd85823b3745aa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/update_check/state.rb"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99665c06eb5cf6882b0fc25eca8e861a228eb661b180047e22056e1e15e526e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/update_check/state.rb"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d66dad675792b0d0c7e489b7a870c17827e5ed211171ce3b860d1896a39fae"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/update_check/state.rb"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"4933e807e2b0674ea0e991c59e964f25b46290a82cbf6d5ab040db938182298b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue ConfigError, UnknownAgent, AgentError, InvalidTaskPath, Exception, SystemCallError, IOError\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":"lib/hive/tui/bubble_model.rb"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2be24b2a1a4261ad445a8a07195bebe61d136d19de71108d6038681baa5cf3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/tui/bubble_model.rb"},"region":{"startLine":2947}}}],"partialFingerprints":{"codehealthFindingId/v1":"350efdb5fbbad9f7f475002e8b766b0ba4304d48724b8f249f251a084c7d81f6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/tui/bubble_model.rb"},"region":{"startLine":2953}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede0b394ea4f315d45611a4746b0d28154db86431051bede7cf6b2e59a806343"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/tui/subprocess.rb"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab70af9300a63dbe547487b2659e6edaaee134595e25149e85f69afcadc827d0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/tui/subprocess.rb"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e3e3f1269948ea63b711294475c6168e49149b5e4b40be4475560f1118bb89"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/task_workspace/builder.rb"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0e2aa164150cb4ee2cc43c42f6659b90463e05e938ebc2ac046774730fba54"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/task_workspace/builder.rb"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d85866903d8c5c76eead4e896a0b19c0a7cca1f78a4199bd819c169d8dc47d9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/task_workspace/builder.rb"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0335cbd13a0c2aa847ff7c311dc2cf196963240bb0168b4b8636d565f7ff38"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/task_workspace/builder.rb"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"cceb7f59777ac5e7fe4230235c3eff54c1bc0e827fdf3eb22b42e387d698b07c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/task_workspace/builder.rb"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"d806cee26d5fde4af4524c25fb07044b1ae0420089a33658ea6b37c45a13a9a1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/task_workspace/provenance.rb"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c18f65f57c865d5f8b3329f93720766be5f4deb08d66f8f67940ff7b876c043"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060\u2026 rescue 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":"lib/hive/task_workspace/publication_cache.rb"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc6e1c58b282a0ea4f223def05c39abe919a7e23f206834690c683ca721d25b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060\u2026 rescue 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":"lib/hive/task_workspace/publication_cache.rb"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a005363f71ec30e7699022a361902793bbd683fb97d139695b0b14ec5ca9c78"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/task_workspace/resources.rb"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc7580e396f057f27e417ebfa3ad1015b0857e6b8b84dfe126b7049c083f94f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/task_workspace/timeline.rb"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d21b4e8965cf6f18f9336465ba9b5107bfb5ffd8284032338696ec4fca99ca"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/task_workspace/usage.rb"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d35eca11c5072e19d6276978eeac7fe30f11bf23643a386ef6e5dcaf69000d8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/stages/base.rb"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65fd3de24ec4a4c8722df3ce3c439f4fb38a948403400d782fade447d3f5654"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/stages/base.rb"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"208285f7af2226a33f092d83a596245c622913a1d5a0ef5f239e9c6ab17ad77d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/stages/base.rb"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"31aaf65824b0f42886308bde829c656311d77a9bf2ed924389019314087e4854"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/stages/base.rb"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace9a98d05de68ccd1cecec1ebaf373d72e94ead01fb9a4a3b28b4c70085e75b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/stages/execute.rb"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71ae5d772240f6c0c175a01e107a5d691658c3c8a22ab88dd91bbcc307dde94"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/review.rb"},"region":{"startLine":2205}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed619592673cd16c3980a5aa8b0e5e567d491943e750570d557fa940d08b27d9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/stages/review.rb"},"region":{"startLine":3290}}}],"partialFingerprints":{"codehealthFindingId/v1":"084667589be91fbc1ae14fac75418b7e0e5d1a8d8dee0c514147a6a115957334"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/stages/patrol_fix/runner.rb"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc2a54da9b80005423fd8ed1d740b4f92de69a1e2d434732e0f6b35dae5afe2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/runtime_control_plane/command_registration.rb"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6fb0acd1762a99d8d1a5e84ae3229135c6832e6613ccfd5d272c7ae1ba2cc0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/runtime_control_plane/command_registration.rb"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"396cb9ae02462ec4e03fb5e4260945069a262e2f9bfc3bc370b53f7eb696e402"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/runtime_control_plane/database.rb"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7befd78b9a205a2495c3b912b09ca675e3509478e74d313224389d6a276c6b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/runtime_control_plane/operational_repository.rb"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"33936ef497d124ce617817d0827db46b499b7c4f00bed4b55f1fe5af599ca378"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue Exception, SystemCallError, IOError\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":"lib/hive/runtime_control_plane/process_registry.rb"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03fd2529a075983e89705dc3f0e3f914ef957ef7016973d4542d58473b96797"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/runtime_control_plane/task_lease_repository.rb"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"d278a7d13eb3773175021b5645868d9afe6259c9446c757131f8b28347238651"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/refactor_patrol/discovery_transitions.rb"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"507ca7b72749dd2afaa93cd42aee10f8fe4d4567ea016846fba51d484cc1b436"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/refactor_patrol/job_store.rb"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0593251a6972267c56a4ff55dba39ba83d38b18ed6ff516e448adfdaa0910c5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/refactor_patrol/job_store.rb"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"f621e6499bf935f82449cbd018ce12b865d2ca7d526ec9e94860f78d54d48266"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/refactor_patrol/job_store.rb"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e08af419cfb00c28cf051fb90729f8bc46e9339693fa8bd30de994778235c5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/refactor_patrol/job_store.rb"},"region":{"startLine":1872}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2052bc4fa0c548fa9d06c879854d8122bdc92a04d3d3d6bada7bfdc9d1afd54"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/refactor_patrol/job_store.rb"},"region":{"startLine":1882}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd6ce547d91153caf6e4d41a6509627fd758ac4cf978847493a31cb96b21692e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/refactor_patrol/scheduled_slice_producer.rb"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"577c1e09e3f5dc2fff0cc93891b955450c5b116be53e4425652751fbbc28524b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/plan_review/disposable_worktree.rb"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac545aa53ec84cbfbdd3b9aa0349abe87cd6db75eb7b093339704ce9502e529"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/plan_review/disposable_worktree.rb"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3abe6d8b4e2a82980ae339f07dd392b363014ad6fb456df3a7ee8cd544f217"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/patrol_fix/attempt_diagnostic.rb"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf60e4e315b8811ec7338338d653fe11188a810fa97a510a230c44d7b58e679"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060\u2026 rescue {}\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":"lib/hive/patrol/mapper.rb"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7fd35be49679f36057b9b966157da718a3a76166d8b38545851eb70fd6b7535"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/one_shot/project_guard.rb"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcbc722d513b8b90d2957e9ec11e692f8dd2e1f08cfe36d3d6c5e62a04c1b3fc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue Error, Exception, SystemCallError, IOError, ArgumentError, TypeError\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":"lib/hive/one_shot/project_guard.rb"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f9307129192c981e6d17bb04e344d9106e35aeb43d94496d52f1d294c954ef"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/modules/daemon_runtime.rb"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"375f229b6d843cd0880e48474b333e5653d1dbf5a578a74668142ba44d2c3db7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/modules/dispatcher.rb"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6b25eb0203899fab23399d56e07debf20b6f2daf229b3e0abf4ca467d8c05a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/daily_digest/delivery_ledger.rb"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"3956622ff728590770dc93055e9fd65c350130532db4d95b9a49515b94e7b827"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue Exception, SystemCallError, IOError\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":"lib/hive/daily_digest/project_source.rb"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"730a490f6875210620bc0d4f961e64a08aca2b0545f1b0ac1fcaf9ddbfd5a5a7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/daemon/auto_retry_safety.rb"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"9010cabaee09bfe31d2a42052ff64c32b17bb6c801424697a7bd6a265fdcc44c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/daemon/checkpoint_maintenance.rb"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a36ff6d01e517a5c4934b858a845308a0f50973011eb1ba5f085205d90fb152"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":1448}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2bd890e21f6c4296c68b3007f1e7f97eeb6a202913f0257317f8337cc15a313"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":2154}}}],"partialFingerprints":{"codehealthFindingId/v1":"0160bce5ea258070185b5ab7b9563bac7ecef3c7e54a0ea3b3d63ca6ff955985"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":3051}}}],"partialFingerprints":{"codehealthFindingId/v1":"8702f87e690f2c29aecb47c58936fbc460ce66aa57ba6ed286a3723499603665"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":3061}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa3113a3257facfff78879227933028524a2c72b27012145de827acfa8391b3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":5451}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b840b93bf07d78906065b0f402f2d1074518d90d710d737d43b657c7293e1a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/daemon/finalization_proof.rb"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e6a64ec3e6915e9f25443ef9720594152276f282a25fe2eab34ad74b4a54c1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/daemon/logger.rb"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3bdbfd0744270e9458db2361bbda7924065b26d76e9de44d611375737b7a4d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/daemon/operational_snapshot.rb"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7d54b70c92fd346c4b16e72ec545962c5ba33200ff089605091230e0cb0bbe"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue ESRCH, EPERM, Exception, SystemCallError\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":"lib/hive/daemon/operational_snapshot.rb"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"145f9f2731b2f392b2ecbd615c5385d40215b7c05769cce04b3caa66d1c8b111"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/daemon/quiescence.rb"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c84a4b1e0209c230aabdd99856b65daece879152d7e408e503e992ecd4a5de2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/daemon/quiescence.rb"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae8a7d027dc7a70bcbb78b41b5a81c142b13a0bffe8f10445a868d64fcb80f3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/daemon/quiescence_finalizer.rb"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2507c6641ed1d31113befddd82e0c305128154350eab4202cd7f4ee486ae07"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/daemon/stale_agent_healer.rb"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c25d26f66b62074ff350f1a56f11692cfd9c4b8c659b43e294aa790e010142b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/daemon/stale_agent_healer.rb"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"51260206612785955877698032e656825b21a4a7aca1d01c1046d39046ad973f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/daemon/stale_agent_healer.rb"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf9c4647c42f18aa5c8832244b6a7b2291fdb6bfeb4b36cefb20a9a41e972ca"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/daemon/status_report.rb"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a73eef8f66a44c1d11019c4899973e8d4f1b588ddbf3510c2e05782b954ed8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/daemon/status_report.rb"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"a785d93e39b1135cab69cfed4d1c9775a316c63667f2709887a31a70f2e7fb9e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/commands/babysit.rb"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"1520afee37ce3996bf1cb4808e116e6976bea00f89e4778657a44498a268f581"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/commands/babysit.rb"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d2f4ae33f616b2679570f4920338636a3ea78cc3e8ef9d13c831c8f076c2c9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/commands/bot.rb"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"5473f30e6b9df77a80d5fbfa0c2b697adccb14e0ea5849e422ad19981b54c3a8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/commands/bot.rb"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b9fc5cf1ed58edaaedbc5327bd73fa0c4801b1843c588d80efab0c2ecdf6e9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/commands/bot.rb"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa71f8b2424a4ae45419bd065e7306cc39c8b22aef816ac0c1be1081124b94e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/commands/daemon.rb"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e53ce65c056da558027a0d18608bb618722efc2edcff04b742f6657991d9c3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/commands/new.rb"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dbb633f921b0545e5a951f55b69ca48321933b1745fb6fc665b0f46b7b17766"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/commands/refactor_patrol.rb"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df66df95f49bab7612b1e96d81bcd66fc317174d937cb62f95a49c8a2b93ce2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/commands/refactor_patrol.rb"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"7417c0b623e9f9b491c1e2534d1a1bb889b17ba00a1a301af9876f987f5e805c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/commands/refactor_patrol_classify.rb"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c40ba6c9cf941c0c923756abf8567a251ef37653705ea2d55063aedb84306c3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/commands/status.rb"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"dada8418dfa56783a9f283fac60767fa63743316591b327d8e6385301ae62083"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/commands/status.rb"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"8721d7442658bd89d0aa2eeb6e1e8376667e40cf8ab70f10ca55a2d08cd4fbe5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/commands/status.rb"},"region":{"startLine":1674}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e5faca8ced88795ee80fbdd72dc34773b1afb3a9e3bde4e9751312d3a403cd4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue ESRCH, ENOENT, Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/uninstall.rb"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2de56978f2f3d28f5b77b29fac75ca780285e1e0f4b31a27ea513067685683e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/commands/workflow/publish.rb"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4f420467a08ab93c0d3606733d024012c2711f0536f9e3b613fb0831f1ca0a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/commands/service_installer/base.rb"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d114fd7b6a58c9f9a24e60781703d35d2c0ea80e25ca669f69e95ef71a8253f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/commands/service_installer/result_presenter.rb"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8d9a7320fe3aaba17fb3c9998e8e2887dbeea2a98df1858adbde3e771a957c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/commands/service_installer/result_presenter.rb"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"20fcdc856d1cf94d0a6dd15631a1aee44240b0f28e9ed87420d7794d29a70fb8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/commands/service_installer/result_presenter.rb"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc81ea82efff11ef31d2a64d222bcf9b68e1990d85ab75a18ea4aea740e3b539"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/bot/alert_store.rb"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0b8f1c7eed13b58db5c9031567ec8ce45305f9d1a1bf458dc4f61bcff3e7f1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/bot/notification_dispatcher.rb"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd5afe7ccaaf1978719e8cbb8a5951b69efadb5d3b3a9aedb6c50623857b535"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/bot/pairing_approval_queue.rb"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d21a4b486091498d396d5fd0eb6d5ad72a8d7d8db9c4f16ba6697dc952dccc8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/bot/pairing_approval_queue.rb"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"e873874d724c2a5e2b34193850c6bf9419046374367da697a38a7873c64bf49a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/bot/supervisor.rb"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ed2afecd62fdd2fa7e5aa5430f03a774055d52875890fbc919db63e8b52e0a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/babysitter/logger.rb"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b15b5aa69dbd98a0922cadc7d9ff752932cee156c858a984cc7ae29aca14906"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/babysitter/pr_fixer.rb"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1ab816b7f6fa196722504d265777a37fac258cefa959858ba4eb2e4daa5573"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/babysitter/project_tick.rb"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"608d787821f769c95c51a252ca743de851742d34b2050d34a676b7e3b9013ece"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/babysitter/project_tick.rb"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"7701a4147cf2fcfec757089a773a00fe8361c633db800e6d26da451b3020474e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/babysitter/project_tick.rb"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae2fa112417b51a5073b1eb98c5906c0e32d5f0ae41474d3f253f412cb413a6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/attempts/finalization_maintenance.rb"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"9622ed0e3376b9f5d244c788e5266c267ea536308a5ec720e58de96faa341e16"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue Error, KeyError, Exception, SystemCallError, IOError\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":"lib/hive/attempts/finalization_maintenance.rb"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"2815c5bb67e1ccec765a6e2a60f70761fc37340f3f2c207df12e1e8455dfa9cb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/attempts/lost_outcome.rb"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1f9692fb6c2821efad1c7fd43dbbcec4ac1d8da5804f8dea93f778b828ba4f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/attempts/stream_log.rb"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bed7f3b8317ee651bb4c4b2fc6450e95ac1b6aa1880330375b5009e827c3b6c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/attempts/stream_log.rb"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"28990eae8e247b8d6f8f9129ddf6666c142839008b9ee7ca1471dacbd382e03a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/attempts/stream_log.rb"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"19085f0b6c41f75677f1ceb2d18fb8cac96be692df1e602527bd7a07735704e8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/attempts/supervisor.rb"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d488b174c465c48a594599f90b6e35f4b64dd8f91f303025cac9578d11f56ad"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/attempts/supervisor.rb"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"299bf729380c14c8ee20c3a5767eaa9194776624d85be968a65d4ee9a5de823c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/attempts/supervisor.rb"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6bf8c3369f8f13ab026ec551ba390f6964ba2ee051837874b535b658ff368e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"lib/hive/agent_support/codex.rb"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f162e09e09ff48452c85fd8001269415e128b616916cddc266f433c57772c19b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060\u2026 rescue 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":"lib/hive/agent_skills/directory_publisher.rb"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2566801c122ed95d452e6823ac91ac0c2ffedca738627061871365d3d13a0f7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"components/agent-cli-runtime/lib/agent_cli_runtime/profile.rb"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6dd4ef8ce0657c6534cbf9f140b617f5dc70488488241405bcdb5e787380ef0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"components/agent-cli-runtime/lib/agent_cli_runtime/profile.rb"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd3605e2e799a6fb1f5b5da4caf0260be102e07f57b1d9634ab8ea9ae8ce6a6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\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":"components/agent-cli-runtime/lib/agent_cli_runtime/runtime.rb"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae9f3ee8715973056b56c36326fd0b7d35d87e99cf562d6fc1eaa54eab3c034"}},{"ruleId":"X5","level":"note","message":{"text":"Ruby\u0027s type checker does not check nil everywhere: This repository commits no Sorbet configuration (\u0060sorbet/config\u0060) and no \u0060Steepfile\u0060, so nothing type-checks its 1088 Ruby product file(s): a nilable value reaches a method call silently and raises \u0060NoMethodError: undefined method \u2026 for nil\u0060 the first time it is nil. A \u0060# typed:\u0060 sigil does nothing without a \u0060sorbet/config\u0060 beside the code; a Steep run configured only on a command line is not something this check can read."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"32b27113b1bc22f400935e8620d19eae7fd3ef145cc36018609c445ea8cd4af1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060toml_string_array\u0060 answers \u0060[]\u0060 when \u0060ParserError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/agent_support/grok/skills.rb"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"2685c97c796a1ecab152ef4f89e8fb2fc80b1cc9e359b827733acf2a85d508cd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in rescue: \u0060safe_diagnostic\u0060 rescues every error into \u0060\u0022[REDACTION_FAILED]\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/artifact_firewall.rb"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"10961f064f937eedf6d345e0319da19f12d8242d5d2935245f2cff8ac0f521db"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in rescue: \u0060file_size_for_rotation\u0060 rescues every error into \u00600\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/babysitter/logger.rb"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"c733c76f0394f4af35c69c839c74d3a138340f49e4482bc0589251d1e339fa9a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060limit_holds\u0060 answers \u0060{}\u0060 when \u0060ENOENT | ParserError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/babysitter/pr_fixer.rb"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe16bdacc00cafdf468e5888aed40f1c03f6ea3a3fbdbfd20c76eae6e6c552d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in rescue: \u0060registered_project_names\u0060 rescues every error into \u0060[]\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/bot/supervisor.rb"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a5bbf882f3b877331c37b659802212fb7346b16303a8175ce8e543c5013ed4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060format_age\u0060 answers \u0060\u0022age unknown\u0022\u0060 when \u0060ArgumentError | TypeError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/digest.rb"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a5359649f45cffce40f696e598deebca4e85398671de3f3e605991e6bc3c5b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in rescue: \u0060service_manager_availability\u0060 rescues every error into \u0060:indeterminate\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/service_installer/base.rb"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"a736201d170a2a9fc1e2813abbca6fe53d60ac62d08c60cbee697d65df84d64b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in rescue: \u0060safe_install_platform\u0060 rescues every error into \u0060\u0022unsupported\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/service_installer/result_presenter.rb"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"074c8bed9bc7e0d0f66aa4a57c3294e33a16bceb552d38e7f391dfd5a0de772e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in rescue: \u0060safe_install_messages\u0060 rescues every error into \u0060[]\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/service_installer/result_presenter.rb"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d6c404eb8b04ad643c00752221cf92a4799cd522e3226ab3bd353354f8c3b3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in rescue: \u0060unanswered_question_count\u0060 rescues every error into \u00600\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/commands/status.rb"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"89aa85c6fa271bd06fbc117f110db3056fd220d82e510790b406ec4dd6049b5e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060shutdown_termination_grace\u0060 answers \u00600.0\u0060 when \u0060Error | ArgumentError | TypeError | SystemCallError | IOError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/dispatcher.rb"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"9887215d261ae7de26928ebd1e9fb0f6a2931704db614d99751f118121f723dd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in rescue: \u0060file_size_for_rotation\u0060 rescues every error into \u00600\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/logger.rb"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66d6d70efe72ac7c3eecd145a3c5f904deb3b13f0298f05e35e673764ac6f4c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060read_state\u0060 answers \u0060{}\u0060 when \u0060ParserError | SystemCallError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daemon/patrol_scheduler.rb"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"25cfaea88be473f59c20dad2e87ac8d4b9776610f355013a7d63747338a66eef"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060all\u0060 answers \u0060{}\u0060 when \u0060ParserError | SystemCallError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daily_digest/generation_failures.rb"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"755a0fcb8c9515f08326759b64a0a89df5387408a323c03d634148e1065293c2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in rescue: \u0060load_pr_core\u0060 rescues every error into \u0060{}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daily_digest/project_source.rb"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb1b0710c17c6269cbdb6c1a19a346fe0f71c43dcd2b4a9257632e510a04e02"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060age_label\u0060 answers \u0060\u0022age unknown\u0022\u0060 when \u0060ArgumentError | TypeError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/daily_digest/telegram_renderer.rb"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"665ea1bcf9e280f1b725e58bcf39d701ed7a9ba1e79c6021c1530fb9f0c56351"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060fetch_check_annotations\u0060 answers \u0060\u0022\u0022\u0060 when \u0060GhError | ParserError | KeyError | ArgumentError | TypeError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/gh.rb"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"728a4e3a8e82a6fc9cb5590b29cdc9ef7749d5100025126baa21a211deebbf7d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060commits_behind\u0060 answers \u00600\u0060 when \u0060ArgumentError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/git_ops.rb"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ae7aebb9025fec8f222f52b1436bdf21d955a7fee22c0976a6b4c84802a939"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060read_json_hash\u0060 answers \u0060{}\u0060 when \u0060ParserError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/llm_wiki_bootstrap.rb"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c480cde46450ed2062f24f0f6caeb928fba54ec64c33a229f34f05ad261945f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in rescue: \u0060thread_value\u0060 rescues every error into \u0060\u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/managed_git.rb"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c52bf011f5d75de62f2ea00914cfb02928ca60964abed8972ab24414b8b1ec9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060read_hooks\u0060 answers \u0060{}\u0060 when \u0060ENOENT | ParserError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/module_package/managed_store.rb"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"7700097e3f254cdb396377898ede776ea4c1f473daa56ef0c83055d73df2935c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060package_bin_entrypoints\u0060 answers \u0060[]\u0060 when \u0060ParserError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol/architecture_mapper.rb"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f815af4a01a83554eb5c0b73b0dd99f9fb7659677a6797efc75d724e26c49b1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060read_json\u0060 answers \u0060{}\u0060 when \u0060ParserError | SystemCallError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol/base_state_store.rb"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"026fadad7e03ac4269fbea56b0f13eff6d6d7dd64f938500e2c1be7935fa1c11"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060snippet_at\u0060 answers \u0060\u0022\u0022\u0060 when \u0060SystemCallError | ArgumentError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol/fingerprint.rb"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0dfb220449cc75da41ad28ad9c96622d60cbdb5c92e269f3d4699acfc0d86b0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060bounded_json_text\u0060 answers \u0060\u0022\u0022\u0060 when \u0060JSONError | TypeError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol/fix_admission_adapter.rb"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a353f84f6a398a549abf05bf2f5fe9577acfc1368f5f441f9343fb9544cce2d0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060finding_query_time\u0060 answers \u00600.0\u0060 when \u0060ArgumentError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/patrol/state_store.rb"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"e648823ada624854c05ee07b637aec138043e06750e6c0dada9a5bd238cb3584"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in rescue: \u0060execution_base\u0060 rescues every error into \u0060\u0022HEAD\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/plan_review/disposable_worktree.rb"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10cee6e7f81044926f4ef18a8afd5ab77501aec03a21f49384ce03acc94b863"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060review_stale_recovery_state\u0060 answers \u0060:operator\u0060 when \u0060SystemCallError | IOError | EncodingError | ArgumentError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/recovery.rb"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"335e1d03a2edd13bcf30c5088e05416df2ed40800315f655f6bfc3f4cd659edb"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060patrol_fingerprints\u0060 answers \u0060{}\u0060 when \u0060ParserError | SystemCallError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/collisions.rb"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"3039259dcf9da2940f9eca26ffcdda1af9a46ba333658ae4917fb5cd0c50f1ea"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060bounded_json_text\u0060 answers \u0060\u0022\u0022\u0060 when \u0060GeneratorError | TypeError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/fix_admission_adapter.rb"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee57df96e278d8c0d40d331bff32aac96105df387ef125389c7c90d1aaf1f35"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060call\u0060 answers \u0060:unresolved\u0060 when \u0060KeyError | ArgumentError | TypeError | EPERM\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/refactor_patrol/process_group_resolver.rb"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"957780466c200522e33a71970ae8f583124d7e989860457ab61673e5eac0a0d0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in rescue: \u0060task_frontmatter\u0060 rescues every error into \u0060{}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/review.rb"},"region":{"startLine":2205}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb304e703f428e4fa0d3633a7d2365d4e1173fc5b65872ea589444007fb2edd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060consume\u0060 answers \u0060{}\u0060 when \u0060SystemCallError | ParserError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/stages/review/reviewer_reuse.rb"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"d764be71ef6820b6dd4e2b867438c52a8a29aa6c14d67247009a9463ba0d3a82"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in rescue: \u0060state_file_frontmatter\u0060 rescues every error into \u0060{}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_action.rb"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea17f6341421d3be5164b62192e99d2f31b1640dbe3a93be7210e4c608ee0493"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in rescue: \u0060diagnostic_frontmatter\u0060 rescues every error into \u0060{}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_action/diagnostic.rb"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa62b3529290d95e451e0d4a323274c36f7b688ff3c4d1d78947b3423e975edf"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060integer\u0060 answers \u00600\u0060 when \u0060ArgumentError | TypeError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/task_workspace/resources.rb"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06ec475af778994ce90717d0be7ae4c07a772ada1a4820a6e06f6804fe8529e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in rescue: \u0060safe_thread_value\u0060 rescues every error into \u0060\u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/tui/subprocess.rb"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"5047ea5bee162a629baadc4d5213524ba19ea146cd1f4534b8584e929718289a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060retained_provider_media_paths\u0060 answers \u0060[]\u0060 when \u0060ParserError | SystemCallError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/hive/web/task_capture.rb"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"518ab6e0bc07da6818eebc2778678f41fe638bbebeb05ee45b2efe7de5bc33b3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060clamp\u0060 answers \u00600.0\u0060 when \u0060ArgumentError | TypeError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/builtins/bench/runtime/harness/judge.rb"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"11666496cb9206d9e4c8337e59acd0ddfe9cfebd83181f409e47c0b868e06eac"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in rescue: \u0060scan_usage_db\u0060 rescues every error into \u0060{}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/builtins/bench/runtime/harness/lib/token_report.rb"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68dd8568f7f81c5bea4e590f555eed6217809ceca47e052b7702a641c4a6e3f"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-116","guid":"c0134ca8-adc7-6959-bd17-5253a265d101","name":"Improper Encoding or Escaping of Output","shortDescription":{"text":"Improper Encoding or Escaping of Output"},"helpUri":"https://cwe.mitre.org/data/definitions/116.html"},{"id":"CWE-1265","guid":"9bfc5711-f2f2-6252-bd2e-ff21a1e98a6c","name":"CWE-1265","shortDescription":{"text":"CWE-1265"},"helpUri":"https://cwe.mitre.org/data/definitions/1265.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-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-311","guid":"51c30837-1e31-e25f-abf9-52b0cbfcbbae","name":"Missing Encryption of Sensitive Data","shortDescription":{"text":"Missing Encryption of Sensitive Data"},"helpUri":"https://cwe.mitre.org/data/definitions/311.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-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-601","guid":"9b8963d5-129b-475c-90cf-2d1766e66f2f","name":"URL Redirection to Untrusted Site (\u0027Open Redirect\u0027)","shortDescription":{"text":"URL Redirection to Untrusted Site (\u0027Open Redirect\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/601.html"},{"id":"CWE-639","guid":"fd233662-97cf-025a-972b-66c9473efbcd","name":"Authorization Bypass Through User-Controlled Key","shortDescription":{"text":"Authorization Bypass Through User-Controlled Key"},"helpUri":"https://cwe.mitre.org/data/definitions/639.html"},{"id":"CWE-73","guid":"43703bfd-8c43-f15f-9cba-58e5f73ea7e9","name":"External Control of File Name or Path","shortDescription":{"text":"External Control of File Name or Path"},"helpUri":"https://cwe.mitre.org/data/definitions/73.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-915","guid":"ec38bdce-3b41-7c53-a89e-debc2dd7da65","name":"Improperly Controlled Modification of Dynamically-Determined Object Attributes","shortDescription":{"text":"Improperly Controlled Modification of Dynamically-Determined Object Attributes"},"helpUri":"https://cwe.mitre.org/data/definitions/915.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"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":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":148,"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."]}]}