{"$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":"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":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"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":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"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":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"Runtime._invoke_llm_body (cyclomatic 71): Runtime._invoke_llm_body has cyclomatic complexity 71 (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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: activegraph/runtime/runtime.py holds 10 of the 26 methods over the threshold \u2014 including the worst \u2014 and 117 of the 223 points over it (52%), 7.8\u00D7 the next-largest file (activegraph/packs/manifest.py at 15). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":1567}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6fa7b906c21c3f812639c56ed9264755fde627d25345e2a8bf0f71659367bc"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime._verify_replay (cyclomatic 31): runtime._verify_replay 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: activegraph/runtime/runtime.py holds 10 of the 26 methods over the threshold \u2014 including the worst \u2014 and 117 of the 223 points over it (52%), 7.8\u00D7 the next-largest file (activegraph/packs/manifest.py at 15). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":4309}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd13479e156a83a28b45f3b8e776a3443e7e244a4d61e99cdacb07f578f8953f"}},{"ruleId":"D1","level":"warning","message":{"text":"manifest.load_manifest (cyclomatic 30): manifest.load_manifest 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":"activegraph/packs/manifest.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8bdfbb4ebbb7f5970e6ad769702f54a505dce8cf71e9b8444062459467378dd"}},{"ruleId":"D1","level":"warning","message":{"text":"native._node_compatible (cyclomatic 29): native._node_compatible 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":"activegraph/llm/native.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"144d18ee0a9287fbcacefa08381014c0214561b6312f32b200fa91b46bd7c859"}},{"ruleId":"D1","level":"warning","message":{"text":"loader.load_pack_into_runtime (cyclomatic 28): loader.load_pack_into_runtime 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":"activegraph/packs/loader.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe99d9bad3dc5bd9397e4b6e07b367f75c2fd9dcd19f27b43c95a1ac0793a21"}},{"ruleId":"D1","level":"warning","message":{"text":"Runtime._ensure_registry (cyclomatic 26): Runtime._ensure_registry 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: activegraph/runtime/runtime.py holds 10 of the 26 methods over the threshold \u2014 including the worst \u2014 and 117 of the 223 points over it (52%), 7.8\u00D7 the next-largest file (activegraph/packs/manifest.py at 15). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3746ea43f76ecaf009f51c7d968b63332ad5980dff36fe169b059de6b71d4fd"}},{"ruleId":"D1","level":"warning","message":{"text":"causal.causal_chain (cyclomatic 26): causal.causal_chain 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":"activegraph/trace/causal.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c436f910b48c4790a2b41ee3678e5007983718bac15e011bcd92054e57ce767"}},{"ruleId":"D1","level":"warning","message":{"text":"prompt._example_instance (cyclomatic 25): prompt._example_instance 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":"activegraph/llm/prompt.py"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d25b8fd508a84fae0a1600a438d3db3c7c2cc72cf86c76ed1b4190d8276ae0"}},{"ruleId":"D1","level":"warning","message":{"text":"Runtime.promote (cyclomatic 24): Runtime.promote 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: activegraph/runtime/runtime.py holds 10 of the 26 methods over the threshold \u2014 including the worst \u2014 and 117 of the 223 points over it (52%), 7.8\u00D7 the next-largest file (activegraph/packs/manifest.py at 15). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":3627}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc11b036fdd2f32a44ac0721e4cf9527f1328d7dc3300d28cc30298c28ef5eb"}},{"ruleId":"D1","level":"warning","message":{"text":"Runtime.__init__ (cyclomatic 23): Runtime.__init__ 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: activegraph/runtime/runtime.py holds 10 of the 26 methods over the threshold \u2014 including the worst \u2014 and 117 of the 223 points over it (52%), 7.8\u00D7 the next-largest file (activegraph/packs/manifest.py at 15). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd90f927034c36e5a57ad67e406755c6326007946653b2eeb894e2afb250896a"}},{"ruleId":"D1","level":"warning","message":{"text":"Runtime.disable_pack (cyclomatic 22): Runtime.disable_pack 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: activegraph/runtime/runtime.py holds 10 of the 26 methods over the threshold \u2014 including the worst \u2014 and 117 of the 223 points over it (52%), 7.8\u00D7 the next-largest file (activegraph/packs/manifest.py at 15). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":2801}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42e801795b3b2e9940b5ff7d9a3de3941b1a4e3f3dd5584e105d5090476420e"}},{"ruleId":"D1","level":"warning","message":{"text":"renderers.print_memo_section (cyclomatic 21): renderers.print_memo_section 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":"activegraph/cli/renderers.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b285562ecebe767a2c3efa7d5090cf82843aa1504a4184b689ba6dd41806fd24"}},{"ruleId":"D1","level":"warning","message":{"text":"Pack.__post_init__ (cyclomatic 21): Pack.__post_init__ 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":"activegraph/packs/__init__.py"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15de6fc243fe87f16b169613fdd18578f9ae7dce261303bec0f49904cebad60"}},{"ruleId":"D1","level":"warning","message":{"text":"retention.pins (cyclomatic 21): retention.pins 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":"activegraph/store/retention.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12b2d147984efdd34e5845958194d4094b58db425dca5b296761d482d6063f9"}},{"ruleId":"D1","level":"warning","message":{"text":"main.cmd_promote (cyclomatic 20): main.cmd_promote 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":"activegraph/cli/main.py"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e185b90c6252734a29a1f618c67605193d94be9bfe2030f49499fe1fc5d089"}},{"ruleId":"D1","level":"warning","message":{"text":"EmbeddingCache.from_events (cyclomatic 20): EmbeddingCache.from_events 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":"activegraph/llm/embedding_cache.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22221c0dc046d039100ccebf24bb3624fedc1c44e2936627a3ac16d570f685a"}},{"ruleId":"D1","level":"warning","message":{"text":"Runtime.embed (cyclomatic 19): Runtime.embed 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: activegraph/runtime/runtime.py holds 10 of the 26 methods over the threshold \u2014 including the worst \u2014 and 117 of the 223 points over it (52%), 7.8\u00D7 the next-largest file (activegraph/packs/manifest.py at 15). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9aee3aeb14d2341b8a8c38b39fd6cfb1c37233cc2ccac379c5cdff66eabfcc"}},{"ruleId":"D1","level":"warning","message":{"text":"main.cmd_inspect (cyclomatic 18): main.cmd_inspect 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":"activegraph/cli/main.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bffde3880c78d3bce9b2fddd83ef22afcc000ba74e196a861841d4d60a9fcfd"}},{"ruleId":"D1","level":"warning","message":{"text":"IDGen.reseed_from_events (cyclomatic 18): IDGen.reseed_from_events 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":"activegraph/core/ids.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"79daf2150b913fbb819e269a2b60ddce3a48eb7a77d6d4797e6f6419e400c77d"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAIProvider.complete (cyclomatic 18): OpenAIProvider.complete 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":"activegraph/llm/openai.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"c790b143e1246b63d0e36592497ea0113c6a52c69ece32b4b381486f9d366291"}},{"ruleId":"D1","level":"warning","message":{"text":"Runtime._loop (cyclomatic 18): Runtime._loop 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: activegraph/runtime/runtime.py holds 10 of the 26 methods over the threshold \u2014 including the worst \u2014 and 117 of the 223 points over it (52%), 7.8\u00D7 the next-largest file (activegraph/packs/manifest.py at 15). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe09cb2f13165561db68662f0951251e83d45ca4997565e8c0488ea831e9c50"}},{"ruleId":"D1","level":"warning","message":{"text":"FalkorDBGraphStore._compile_indexed_where (cyclomatic 18): FalkorDBGraphStore._compile_indexed_where 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":"activegraph/store/falkordb.py"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f56a3833086e2f838c5767f9a9bcde850e85b6aa3bcedca11fbfb4d1568a03d"}},{"ruleId":"D1","level":"warning","message":{"text":"main.cmd_fork (cyclomatic 17): main.cmd_fork 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":"activegraph/cli/main.py"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"e94c420e6114bd78d3d1064f498382dc23ce83d0b0c6f1974f29433300a945e1"}},{"ruleId":"D1","level":"warning","message":{"text":"Runtime.fork (cyclomatic 17): Runtime.fork 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: activegraph/runtime/runtime.py holds 10 of the 26 methods over the threshold \u2014 including the worst \u2014 and 117 of the 223 points over it (52%), 7.8\u00D7 the next-largest file (activegraph/packs/manifest.py at 15). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":3423}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be964508f73b2d4ecb1dfc0d16f0357de9425c53ebcfa4e701e39338d38242b"}},{"ruleId":"D1","level":"warning","message":{"text":"Runtime._invoke_tool (cyclomatic 16): Runtime._invoke_tool 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: activegraph/runtime/runtime.py holds 10 of the 26 methods over the threshold \u2014 including the worst \u2014 and 117 of the 223 points over it (52%), 7.8\u00D7 the next-largest file (activegraph/packs/manifest.py at 15). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":2102}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57be12e27a6dbe323cc426560d9370a555ec38f1dc97abb56596b4d7d2177e4"}},{"ruleId":"D1","level":"warning","message":{"text":"SinkHandle._run (cyclomatic 16): SinkHandle._run 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":"activegraph/sinks/dispatch.py"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6dd1e298a2235f2606b163d4ef211df0cc23fdb9f20d6c166b70d7bbf191fe8"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime._invoke_llm_body (cognitive 161): Runtime._invoke_llm_body has cognitive complexity 161 (threshold 15). Drivers by points: if/else 33 (96 pts), ternaries 10 (29 pts), boolean chains 15, error handling 8 (15 pts), loops 4 (6 pts) (nesting depth added 91). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: activegraph/runtime/runtime.py holds 15 of the 52 methods over the threshold \u2014 including the worst \u2014 and 307 of the 646 points over it (48%), 7\u00D7 the next-largest file (activegraph/llm/native.py at 44). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":1567}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f27d4cb8eb9a3fe98cfcd4dace3a2f7b1ef784ad63260543b7adfb9134fda3c"}},{"ruleId":"D2","level":"warning","message":{"text":"native._node_compatible (cognitive 56): native._node_compatible has cognitive complexity 56 (threshold 15). Drivers by points: if/else 19 (41 pts), loops 6 (11 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/llm/native.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"65144730bc8f2bba491644f9204efa98e2cd5d5ffe732c88dffb5a0a23b3150a"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime._ensure_registry (cognitive 49): Runtime._ensure_registry has cognitive complexity 49 (threshold 15). Drivers by points: if/else 15 (30 pts), loops 7 (12 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: activegraph/runtime/runtime.py holds 15 of the 52 methods over the threshold \u2014 including the worst \u2014 and 307 of the 646 points over it (48%), 7\u00D7 the next-largest file (activegraph/llm/native.py at 44). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99a5649135ade6636bce6a713db491149949018eaf2c7ef9e58ad16205908bf"}},{"ruleId":"D2","level":"warning","message":{"text":"causal.causal_chain (cognitive 43): causal.causal_chain has cognitive complexity 43 (threshold 15). Drivers by points: if/else 11 (21 pts), ternaries 4 (13 pts), boolean chains 6, loops 3 (nesting depth added 19). 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":"activegraph/trace/causal.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b67f707569518f5931a7bbf70c01dad55828797553af6e3a8830de1415bf9e1b"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime._verify_replay (cognitive 42): runtime._verify_replay has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (26 pts), boolean chains 8, ternaries 3 (6 pts), loops 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: activegraph/runtime/runtime.py holds 15 of the 52 methods over the threshold \u2014 including the worst \u2014 and 307 of the 646 points over it (48%), 7\u00D7 the next-largest file (activegraph/llm/native.py at 44). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":4309}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf0592ff9aff32ec4723eba9d2b84bdfc5177581c189c0b3730eae1494f597a"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime._loop (cognitive 41): Runtime._loop has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (27 pts), loops 3 (9 pts), boolean chains 5 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: activegraph/runtime/runtime.py holds 15 of the 52 methods over the threshold \u2014 including the worst \u2014 and 307 of the 646 points over it (48%), 7\u00D7 the next-largest file (activegraph/llm/native.py at 44). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d0fc9e5a715142fbcc5a1afaa69acdbec8511a7ae6cd7d5418c1978d4747161"}},{"ruleId":"D2","level":"warning","message":{"text":"loader.load_pack_into_runtime (cognitive 40): loader.load_pack_into_runtime has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 12 (14 pts), boolean chains 2, ternaries 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":"activegraph/packs/loader.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"802241198cac5f492bf52f462a7783acc47ad9d652e882de6acfe758074f938b"}},{"ruleId":"D2","level":"warning","message":{"text":"EmbeddingCache.from_events (cognitive 37): EmbeddingCache.from_events has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 3 (6 pts), boolean chains 5, error handling 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/llm/embedding_cache.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c92d0b7df2ef8403a12f24d1d77bbde06672a048e656f76bbce09ea7b307e5"}},{"ruleId":"D2","level":"warning","message":{"text":"renderers.print_memo_section (cognitive 33): renderers.print_memo_section has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 4 (12 pts), loops 4 (8 pts), boolean chains 7, if/else 6 (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":"activegraph/cli/renderers.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0aacaba021b1eb9c31d8db42fa8b98d01b4bda2575a6ce099c8ecc714868c2"}},{"ruleId":"D2","level":"warning","message":{"text":"prompt._example_instance (cognitive 33): prompt._example_instance has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 7, ternaries 2 (5 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":"activegraph/llm/prompt.py"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"7240af47745a7f4f107a1ac7779639de194c19463783a8fc3ccb54db198072ef"}},{"ruleId":"D2","level":"warning","message":{"text":"Pack.__post_init__ (cognitive 32): Pack.__post_init__ has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 4 (5 pts), boolean chains 4 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/packs/__init__.py"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc04b1136d9600bfd786101ebdb590864ec62d10c90879b7eb8580e2ea367569"}},{"ruleId":"D2","level":"warning","message":{"text":"manifest.load_manifest (cognitive 32): manifest.load_manifest has cognitive complexity 32 (threshold 15). Drivers by points: if/else 19 (22 pts), boolean chains 7, error handling 2, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/packs/manifest.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"4631ffb1bc78ad5be733a641b63cee6ce61b119bd99452d2636fb9272545d048"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime.promote (cognitive 29): Runtime.promote has cognitive complexity 29 (threshold 15). Drivers by points: loops 7 (9 pts), ternaries 5 (9 pts), if/else 8, boolean chains 2, error handling 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition. This file is where this pass\u0027s cognitive complexity CONCENTRATES: activegraph/runtime/runtime.py holds 15 of the 52 methods over the threshold \u2014 including the worst \u2014 and 307 of the 646 points over it (48%), 7\u00D7 the next-largest file (activegraph/llm/native.py at 44). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":3627}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfbb23d608edb082ae33216a2c01696dcb57edc8158f4dd6fafa0783d34f7f26"}},{"ruleId":"D2","level":"warning","message":{"text":"SinkHandle._run (cognitive 28): SinkHandle._run has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 3, loops 2 (3 pts), error handling 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":"activegraph/sinks/dispatch.py"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c9c8d154a1db34d073c1f46c2e2fa67e5ab605715a82faacf539998a2a6c05"}},{"ruleId":"D2","level":"warning","message":{"text":"IDGen.reseed_from_events (cognitive 27): IDGen.reseed_from_events has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (21 pts), boolean chains 5, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/core/ids.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d553e8b14f5f51b0580ba6f9d0874f9326a34d990e5be61fc326344b04668d9"}},{"ruleId":"D2","level":"warning","message":{"text":"main.cmd_migrate (cognitive 26): main.cmd_migrate has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (6 pts), ternaries 3 (5 pts), error handling 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":"activegraph/cli/main.py"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"11662ac1d0fe56044c6f62151b2f55ff2e698494b754e0ae6b87c99838d2fd49"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime.__init__ (cognitive 26): Runtime.__init__ has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 9 (12 pts), if/else 7 (8 pts), boolean chains 4, error handling 1, loops 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: activegraph/runtime/runtime.py holds 15 of the 52 methods over the threshold \u2014 including the worst \u2014 and 307 of the 646 points over it (48%), 7\u00D7 the next-largest file (activegraph/llm/native.py at 44). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded5c9fbf35038d8aa9be7a934e0ce56fb783761756eaa847603ff75c1d1e667"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime.disable_pack (cognitive 26): Runtime.disable_pack has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 6, ternaries 2 (3 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: activegraph/runtime/runtime.py holds 15 of the 52 methods over the threshold \u2014 including the worst \u2014 and 307 of the 646 points over it (48%), 7\u00D7 the next-largest file (activegraph/llm/native.py at 44). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":2801}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5543ecef7b030f8559ef067d09c78c35b29a3e3d75aef858ee6cdb30405387a"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime.embed (cognitive 25): Runtime.embed has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 5, ternaries 3 (4 pts), error handling 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: activegraph/runtime/runtime.py holds 15 of the 52 methods over the threshold \u2014 including the worst \u2014 and 307 of the 646 points over it (48%), 7\u00D7 the next-largest file (activegraph/llm/native.py at 44). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c9bbc9054dd790ad5b6413e23a3fa0e9171b10a8eb6a88717f2ffe80cc3267a"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime._invoke_tool (cognitive 24): Runtime._invoke_tool has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (13 pts), error handling 4 (8 pts), boolean chains 3 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: activegraph/runtime/runtime.py holds 15 of the 52 methods over the threshold \u2014 including the worst \u2014 and 307 of the 646 points over it (48%), 7\u00D7 the next-largest file (activegraph/llm/native.py at 44). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":2102}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba5a95493b159ed89a2a7b47af0c83f327eadad1b097e7eaa381d331f9cdc6b"}},{"ruleId":"D2","level":"warning","message":{"text":"main.cmd_promote (cognitive 23): main.cmd_promote has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (9 pts), error handling 5, loops 4 (5 pts), boolean chains 2, ternaries 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/cli/main.py"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c999838a93149a4b74b5694dc20c54178e4ec5e2118082de07e1f081be062dd"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime._requeue_unfired (cognitive 23): runtime._requeue_unfired has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 3, ternaries 1 (3 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: activegraph/runtime/runtime.py holds 15 of the 52 methods over the threshold \u2014 including the worst \u2014 and 307 of the 646 points over it (48%), 7\u00D7 the next-largest file (activegraph/llm/native.py at 44). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":4230}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49ccac9c57a9564a465520a41e11cb7851a76e9831ff56b9831537e7a88ac6d"}},{"ruleId":"D2","level":"warning","message":{"text":"retention.pins (cognitive 23): retention.pins has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 5, loops 4 (5 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":"activegraph/store/retention.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"0050cb2ea9176934542f86ddb686973005bf34342edb5b818f36a03816fc41aa"}},{"ruleId":"D2","level":"warning","message":{"text":"diff.compute_diff (cognitive 22): diff.compute_diff has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 4 (8 pts), loops 3, 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":"activegraph/runtime/diff.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3cba83fbb53c3eb7dfb66a27ac25bc7c2e45cae179d71f01c140915144bd04b"}},{"ruleId":"D2","level":"warning","message":{"text":"patterns._eval_where (cognitive 22): patterns._eval_where has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2 (5 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":"activegraph/runtime/patterns.py"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d45bd53fe8dbe3e30a5139bdaffd3925550696ab4f2a2b8a194e2d8e764420"}},{"ruleId":"D2","level":"warning","message":{"text":"Registry.match (cognitive 22): Registry.match has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (18 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":"activegraph/runtime/registry.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"7497eb21c3779ac6c0c2701b8b4320af002b9873a0a8a492af8c3d99520cc55a"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.remove_sink (cognitive 21): Graph.remove_sink has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 5, 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":"activegraph/core/graph.py"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"702e78af6fcea4ad2194745f0babd16815bc327bac732f5e24583b0c03275df6"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphStore._extend_chain_match (cognitive 21): GraphStore._extend_chain_match has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/core/graph_store.py"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3dc952c6df276a36caa0479a23d6207fed47a8bc8eab513c98a91f3f7d8e456"}},{"ruleId":"D2","level":"warning","message":{"text":"main.cmd_fork (cognitive 20): main.cmd_fork has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (14 pts), error handling 2, ternaries 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"activegraph/cli/main.py"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc5cb8bfb6b88689fa8acf4cc6bb227620da94ff84df558b88b9720f218bec1"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphStore.neighborhood (cognitive 20): GraphStore.neighborhood has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/core/graph_store.py"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"9baad1a718d23565e4097ecca2144cf0dde3ac6b731e097bb7c08fc15b863cea"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAIProvider.complete (cognitive 20): OpenAIProvider.complete has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 7, error handling 1, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"activegraph/llm/openai.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30c08dd907da484796bee3ffad48fa5c655e7b7cfc62d05af248577d18734b8"}},{"ruleId":"D2","level":"warning","message":{"text":"behaviors.risk_identifier (cognitive 20): behaviors.risk_identifier has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/packs/diligence/behaviors.py"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7066fea2ba44ea6a2e5c18d83d266c4646ce5f4db85959c17a79f8cc60eb9e"}},{"ruleId":"D2","level":"warning","message":{"text":"Budget.remaining (cognitive 20): Budget.remaining has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/budget.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9649180cb42bf97d336f14aa4acc751dc90a420801367562d274336950a87a"}},{"ruleId":"D2","level":"warning","message":{"text":"promote.promote_warnings (cognitive 20): promote.promote_warnings has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, ternaries 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/promote.py"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"834b03076c8f8a914f8e94c03323745099779f96a72ba31efcc41802b75b0260"}},{"ruleId":"D2","level":"warning","message":{"text":"FalkorDBGraphStore._compile_indexed_where (cognitive 20): FalkorDBGraphStore._compile_indexed_where has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 8, 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":"activegraph/store/falkordb.py"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f468b91e412d793180f5ffbac1f69ad1288538b6bfe2dfb2230f74c2a02cf39"}},{"ruleId":"D2","level":"warning","message":{"text":"_signature.validate_handler_signature (cognitive 19): _signature.validate_handler_signature has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2, ternaries 1 (2 pts), boolean chains 1, 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":"activegraph/_signature.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ca9fb6ca09bd703acb4db755eee6436182be12736d40030ff81811dcb94149"}},{"ruleId":"D2","level":"warning","message":{"text":"main.cmd_inspect (cognitive 19): main.cmd_inspect has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10, loops 3 (4 pts), boolean chains 2, ternaries 1 (2 pts), error handling 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":"activegraph/cli/main.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b25b994828a4eb601ca3e1864ca6861c2c00714b445c3bd4160e251c1d6956"}},{"ruleId":"D2","level":"warning","message":{"text":"main._print_pack_versions (cognitive 19): main._print_pack_versions has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 5, ternaries 1 (4 pts), loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/cli/main.py"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"f011a7a8ec481214de46b6a4a78b602336fae91725899b8259d4e5367568ca40"}},{"ruleId":"D2","level":"warning","message":{"text":"native._inject (cognitive 18): native._inject has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 5 (7 pts), boolean chains 1 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/llm/native.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4b024a44cdf2a3f33b302a68695825f99a820c66d6093a7add8f57574e2c85"}},{"ruleId":"D2","level":"warning","message":{"text":"loader._locate_pack_manifest (cognitive 18): loader._locate_pack_manifest has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/packs/loader.py"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b70dad27eb8376080182e5ce373763c8023fbbf61513271fb352226046ae6d"}},{"ruleId":"D2","level":"warning","message":{"text":"loader._wrap_with_injection (cognitive 18): loader._wrap_with_injection has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, error handling 2, loops 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":"activegraph/packs/loader.py"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"81deecb4a1cf40625d4a9c90672dc2bcdaecbbfb73aef0da0b7744b2d1366ecb"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime._fire_due_delayed (cognitive 18): Runtime._fire_due_delayed has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (16 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: activegraph/runtime/runtime.py holds 15 of the 52 methods over the threshold \u2014 including the worst \u2014 and 307 of the 646 points over it (48%), 7\u00D7 the next-largest file (activegraph/llm/native.py at 44). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"454d0437553bc2a847e8a0bb009c17b1f44ebac8af472cf437e107b2a3075f1d"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime._validate_embedding_vectors (cognitive 18): runtime._validate_embedding_vectors has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: activegraph/runtime/runtime.py holds 15 of the 52 methods over the threshold \u2014 including the worst \u2014 and 307 of the 646 points over it (48%), 7\u00D7 the next-largest file (activegraph/llm/native.py at 44). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":4573}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a7b05d8ed949e9b6d2f70775ddcea50e806fb48ebcba031e22e6d30a613c69"}},{"ruleId":"D2","level":"warning","message":{"text":"serde._find_non_serializable (cognitive 18): serde._find_non_serializable has cognitive complexity 18 (threshold 15). Drivers by points: error handling 2 (6 pts), loops 2 (4 pts), boolean chains 3, ternaries 1 (3 pts), if/else 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/store/serde.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1684f59ea3779979078b1564875ebda67997408ad733fc73a188fcb91b09cbb"}},{"ruleId":"D2","level":"warning","message":{"text":"url.parse_store_url (cognitive 18): url.parse_store_url has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, 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":"activegraph/store/url.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"2495c765af660bc001615fb681594bd477c47ee15a03e4bb0991eec058b25919"}},{"ruleId":"D2","level":"warning","message":{"text":"openai._extract_tool_calls (cognitive 17): openai._extract_tool_calls has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 7, if/else 5 (6 pts), error handling 1 (3 pts), loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/llm/openai.py"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7353756a2a4febe1fda02e6067de4ade32bd60e46273b39f5479adeb4bfdd2"}},{"ruleId":"D2","level":"warning","message":{"text":"loader._wrap_behavior_for_pack (cognitive 17): loader._wrap_behavior_for_pack has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 9 (15 pts), if/else 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":"activegraph/packs/loader.py"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67adb1a9f531c9d3fbbf847f74ff36ad683e22b4fb58336e7601d04a1aef163"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime.status (cognitive 17): Runtime.status has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, loops 2 (3 pts), 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: activegraph/runtime/runtime.py holds 15 of the 52 methods over the threshold \u2014 including the worst \u2014 and 307 of the 646 points over it (48%), 7\u00D7 the next-largest file (activegraph/llm/native.py at 44). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":2597}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc184faf80c321effce4c15692fb07d61dcd956e33dd079bfcf092e75993b097"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime.fork (cognitive 17): Runtime.fork has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 9 (10 pts), boolean chains 3, if/else 3, 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: activegraph/runtime/runtime.py holds 15 of the 52 methods over the threshold \u2014 including the worst \u2014 and 307 of the 646 points over it (48%), 7\u00D7 the next-largest file (activegraph/llm/native.py at 44). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":3423}}}],"partialFingerprints":{"codehealthFindingId/v1":"4359f3ca44517e5538de4b0e2cf734bd9fa7665c15afccbb2f3ce8a256168f1e"}},{"ruleId":"D2","level":"warning","message":{"text":"main.cmd_export_trace (cognitive 16): main.cmd_export_trace has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (6 pts), loops 2 (6 pts), error handling 2, 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":"activegraph/cli/main.py"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8c153c66dc8c1f985b34b967029705239359bed78a3e303de8d2b8b0ca032b"}},{"ruleId":"D2","level":"warning","message":{"text":"quickstart._prepare_interactive_subdir (cognitive 16): quickstart._prepare_interactive_subdir has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/cli/quickstart.py"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d275e9f41e3a87aac530ba0e085e863f28200f6773eab8bee113505665a7e88"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime._recorded_wall_stop (cognitive 16): runtime._recorded_wall_stop has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 3 (6 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: activegraph/runtime/runtime.py holds 15 of the 52 methods over the threshold \u2014 including the worst \u2014 and 307 of the 646 points over it (48%), 7\u00D7 the next-largest file (activegraph/llm/native.py at 44). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":4500}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ec0744aeb229771233a21de9524de5bc6b0d833dde3c732a61dba00fdda4fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime/runtime.py: FileTooLong \u2014 3070 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2570 over it, 6.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":"activegraph/runtime/runtime.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32efe998b7ac3a0284d1c294b84e985b364799796c8ec2fbfc6a89233df697bb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Runtime: 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":"activegraph/runtime/runtime.py"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c0c2ee6133d54651f8cfa1d0ff6c2dc81fd057bc5d51a04bb52d3202a68ee8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/graph.py: FileTooLong \u2014 872 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 372 over it, 1.74\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":"activegraph/core/graph.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb07879b73fe25845994ecfc6e14c33b93193836e12f54a965641570bc0b397"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/main.py: FileTooLong \u2014 860 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 360 over it, 1.72\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":"activegraph/cli/main.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98bcce11b54e00c696aab79e61d483c7beeea15833cc0eda832be6560d9f809d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: packs/__init__.py: FileTooLong \u2014 675 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 175 over it, 1.35\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":"activegraph/packs/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a84be5277d761510fbb677bdc277ad29a2a505f9910bee941af93c8f937b0d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: packs/loader.py: 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":"activegraph/packs/loader.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"277102e10c39cf5b31008a91a6f228994c20efbc7d79b97b992201a31896471d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Graph: 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":"activegraph/core/graph.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4279fa6df4e3acd5d4588d3264e831ff7c08d95b7fcc00f1dcf2c6639c8ef4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GraphStoreConformance: 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":"activegraph/store/graph_conformance.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d039aa671c8c3ee475a05ba94a104867743b35ecc84037fd15ed97219d0510c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): activegraph/runtime/registration_errors.py:95-137 | activegraph/runtime/registration_errors.py:210-247 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/registration_errors.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0abd1b8af5bda6117da1e195865e8c7a09eb833d3b6b8b5d50b90ef71dcf15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): activegraph/packs/__init__.py:256-298 | activegraph/packs/__init__.py:309-344 \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":"activegraph/packs/__init__.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf47987ce842e8e75c8ab62e3e807823bfc27862b065cb2b3a410ad5b203492"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): activegraph/behaviors/decorators.py:164-212 | activegraph/behaviors/decorators.py:238-345 | activegraph/behaviors/decorators.py:361-404 | activegraph/packs/__init__.py:729-775 | activegraph/packs/__init__.py:801-858 | activegraph/packs/__init__.py:874-918 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/behaviors/decorators.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c496a93035c793b95d247b0bdf3f923915331be188ba07fec865eddb43b2ebf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): activegraph/behaviors/decorators.py:301-335 | activegraph/packs/__init__.py:813-847 \u2014 before extracting anything, compare \u0060activegraph/behaviors/decorators.py\u0060 and \u0060activegraph/packs/__init__.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 154 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060activegraph/behaviors/decorators.py:299\u0060 calls \u0060_validate_output_schema\u0060 and \u0060activegraph/packs/__init__.py:811\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/behaviors/decorators.py"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ab28f944f687314a7a22de9086cfd9af04c3e43f1fcae35479e1f497c85494"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201328 lines \u00D7 2): activegraph/packs/__init__.py:940-964 | activegraph/tools/decorators.py:72-99 \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 \u0060activegraph/packs/__init__.py:940\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":"activegraph/packs/__init__.py"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d3a341c7ded95d75059464e092dd8bae1b7fb5f6edbb1b0b548465979a0a2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): activegraph/behaviors/decorators.py:370-396 | activegraph/packs/__init__.py:879-905 \u2014 before extracting anything, compare \u0060activegraph/behaviors/decorators.py\u0060 and \u0060activegraph/packs/__init__.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 154 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 \u0060activegraph/behaviors/decorators.py:370\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":"activegraph/behaviors/decorators.py"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec8a5f7e104342ab9eb8100e47ea5aa535fd643a0ea15acc32db0772ae6a56a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): activegraph/runtime/registration_errors.py:95-121 | activegraph/runtime/registration_errors.py:210-236 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060activegraph/runtime/registration_errors.py:95\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":"activegraph/runtime/registration_errors.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3dbb9a58ea40551787f75b8f74a0764d2e32de325fa30295943aae7e056b157"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): activegraph/runtime/runtime.py:1395-1420 | activegraph/runtime/runtime.py:2528-2554 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060activegraph/runtime/runtime.py:1425\u0060 calls \u0060counter\u0060 and \u0060activegraph/runtime/runtime.py:2556\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":"activegraph/runtime/runtime.py"},"region":{"startLine":1395}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89c721badb57ddf7e25220dc0532a1520813e704ad8fc45b178f887e1abc33f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): activegraph/behaviors/decorators.py:179-204 | activegraph/packs/__init__.py:734-759 \u2014 before extracting anything, compare \u0060activegraph/behaviors/decorators.py\u0060 and \u0060activegraph/packs/__init__.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 154 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 \u0060activegraph/behaviors/decorators.py:179\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":"activegraph/behaviors/decorators.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"a534c0eab613aa294d754c252e3cf70970aa04585e4e4273c6d005ded94c20c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): activegraph/core/graph.py:718-740 | activegraph/core/graph.py:774-799 \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 \u0060activegraph/core/graph.py:718\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":"activegraph/core/graph.py"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa71c032f5d03a3cd9a4f37b0bab7627b97de0702869bcbe3345c6780dd9411"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): activegraph/store/postgres.py:379-401 | activegraph/store/sqlite.py:284-306 \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":"activegraph/store/postgres.py"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5bd7fb2ce06766cfbb0f63272429f5f2c8ea692a376b1c06c6be22205024fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201322 lines \u00D7 2): activegraph/llm/anthropic.py:190-211 | activegraph/llm/openai.py:242-259 \u2014 before extracting anything, compare \u0060activegraph/llm/anthropic.py\u0060 and \u0060activegraph/llm/openai.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/llm/anthropic.py"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e51be434b14ba4a8d0b7b543125394debe86d5307595a7b820ebec25ae3ae38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): activegraph/llm/anthropic.py:169-188 | activegraph/llm/openai.py:221-240 \u2014 before extracting anything, compare \u0060activegraph/llm/anthropic.py\u0060 and \u0060activegraph/llm/openai.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060activegraph/llm/anthropic.py: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":"activegraph/llm/anthropic.py"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f43472769a91cd62d6547b436d626edf9f4040f5cd0fefb5f36fda481847b56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201320 lines \u00D7 2): activegraph/packs/__init__.py:756-775 | activegraph/packs/__init__.py:902-918 \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 \u0060activegraph/packs/__init__.py:756\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":"activegraph/packs/__init__.py"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"5264b87619ca4613d816195e084cb317d0e223b1a8c6d77d91b9c3a3aad1f99a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): activegraph/packs/__init__.py:256-274 | activegraph/packs/__init__.py:309-327 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060activegraph/packs/__init__.py:256\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":"activegraph/packs/__init__.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df77f366063d79bfe8dc5ce5cd72ea71a28513b6cdf87e000bb981b65ee6f32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 3): activegraph/runtime/runtime.py:2912-2929 | activegraph/runtime/runtime.py:3075-3091 | activegraph/runtime/runtime.py:3107-3121 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":2912}}}],"partialFingerprints":{"codehealthFindingId/v1":"955bed96e0787cd6ba5e317441a6fd760979f8b8969a3d55104b3488cdb3c278"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): activegraph/runtime/runtime.py:682-698 | activegraph/runtime/runtime.py:786-800 \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 \u0060activegraph/runtime/runtime.py:682\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":"activegraph/runtime/runtime.py"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe9b12532804bf7eb53870e4b8115c4015b27ab6fc67089bb7b706ae4cbbe9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): activegraph/llm/anthropic.py:46-61 | activegraph/llm/openai.py:69-82 \u2014 before extracting anything, compare \u0060activegraph/llm/anthropic.py\u0060 and \u0060activegraph/llm/openai.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060activegraph/llm/openai.py:85\u0060 calls \u0060OpenAIProvider\u0060 and \u0060activegraph/llm/anthropic.py:68\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/llm/anthropic.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc34105e56358d9b7255a085523bd5da5a7a5fba2ad7fb5883be545b84cff02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): activegraph/store/postgres.py:345-360 | activegraph/store/postgres.py:449-464 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060activegraph/store/postgres.py:345\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":"activegraph/store/postgres.py"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"33fb49abf01cbe2df852e759eac444f9fff32705b059348eb4b3cdc429b5f276"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): activegraph/store/postgres.py:521-536 | activegraph/store/sqlite.py:418-432 \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 \u0060activegraph/store/postgres.py:521\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":"activegraph/store/postgres.py"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"3760887ef96a6cecd1eb88d6c64d4fd945d4a8ff7ae4bf6a5feed7f47759f32c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u201315 lines \u00D7 3): activegraph/runtime/registration_errors.py:46-60 | activegraph/runtime/registration_errors.py:164-178 | activegraph/tools/errors.py:181-182 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060activegraph/runtime/registration_errors.py:46\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":"activegraph/runtime/registration_errors.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a00943977ae543607d97493b415dbc73b3110d803ff3368e357be24d63897e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): activegraph/store/sqlite.py:259-272 | activegraph/store/sqlite.py:345-358 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/store/sqlite.py"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e96b98d75e1fa0cc4c462f4a813f65e90a6032a947b90967de2531661c11847"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): activegraph/llm/recorded.py:167-179 | activegraph/llm/recorded.py:319-331 \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":"activegraph/llm/recorded.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cee1d1e871199f656e5bb6564715654cd1ace11e41e087a6b7aab39435a61f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): activegraph/store/graph_conformance.py:397-409 | activegraph/store/graph_conformance.py:427-437 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/store/graph_conformance.py"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c29ac65db75a95b28a267e64c663ff7f141e9cb8310c28762cb0b43f5f73cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): activegraph/behaviors/decorators.py:201-212 | activegraph/behaviors/decorators.py:393-404 \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 \u0060activegraph/behaviors/decorators.py:201\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":"activegraph/behaviors/decorators.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"61888a6f31c8a87a9f731b20b2b5c44945756cce3575158d2dea51ca95e27016"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): activegraph/store/postgres.py:252-263 | activegraph/store/sqlite.py:135-146 \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 \u0060activegraph/store/postgres.py:252\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":"activegraph/store/postgres.py"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69c7ca6b28764003ff0c699d2a5bf5b330111772285119cc529077d8d4f80cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6): activegraph/behaviors/decorators.py:164-184 | activegraph/behaviors/decorators.py:238-293 | activegraph/behaviors/decorators.py:361-375 | activegraph/packs/__init__.py:729-739 | activegraph/packs/__init__.py:801-811 | activegraph/packs/__init__.py:874-884 \u2014 before extracting anything, compare \u0060activegraph/behaviors/decorators.py\u0060 and \u0060activegraph/packs/__init__.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 154 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 \u0060activegraph/behaviors/decorators.py:164\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060activegraph/behaviors/decorators.py:299\u0060 calls \u0060_validate_output_schema\u0060 and \u0060activegraph/behaviors/decorators.py:186\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/behaviors/decorators.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e1a0cff63cbb0f563296df5d1cc301ead06d07cab6895f553162f8be0e3667"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): activegraph/runtime/runtime.py:2336-2346 | activegraph/runtime/runtime.py:2358-2368 | activegraph/runtime/runtime.py:2405-2415 \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 \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":2336}}}],"partialFingerprints":{"codehealthFindingId/v1":"331e8ec7581ab42e5c4156355ca3060b39ec107fadb194fae1f438238eb96a82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): activegraph/core/graph.py:811-821 | activegraph/core/graph.py:832-842 \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":"activegraph/core/graph.py"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"70fd9154b289d6d5bfdb32951862e7aa9e8e5c015326342c01577b31af129d03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): activegraph/llm/anthropic.py:379-389 | activegraph/llm/openai.py:518-528 \u2014 before extracting anything, compare \u0060activegraph/llm/anthropic.py\u0060 and \u0060activegraph/llm/openai.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"activegraph/llm/anthropic.py"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d9e06d0f1a63e085b80c2f32830dbc925c939025e14dd28098e6e636f2a9d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): activegraph/packs/loader.py:657-667 | activegraph/packs/loader.py:676-686 \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 \u0060activegraph/packs/loader.py:657\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/packs/loader.py"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69ade89c4705f144d8123bd516c44ba7d5cd9374ab9b67d4972c98470cd1724"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): activegraph/store/falkordb.py:439-449 | activegraph/store/falkordb.py:659-669 \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 \u0060activegraph/store/falkordb.py:439\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":"activegraph/store/falkordb.py"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"237151926029db64c33a303496b6f0541b5f0cefd0c5a7f9fd152f567476b997"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): activegraph/behaviors/decorators.py:199-208 | activegraph/behaviors/decorators.py:391-400 | activegraph/packs/__init__.py:754-763 | activegraph/packs/__init__.py:900-909 \u2014 before extracting anything, compare \u0060activegraph/behaviors/decorators.py\u0060 and \u0060activegraph/packs/__init__.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 154 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 \u0060activegraph/behaviors/decorators.py:199\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":"activegraph/behaviors/decorators.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f75ccc379442fe8988aa380a499b50f218f8534dfe2acf0c3380edc4259ca7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): activegraph/llm/cache.py:175-184 | activegraph/llm/recorded.py:235-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060activegraph/llm/cache.py:175\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/llm/cache.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee572ead43b4cc6e35141267634a0cc04b56e8c19ae1aaeec81414cbfd37823"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): activegraph/runtime/runtime.py:3344-3353 | activegraph/runtime/runtime.py:3526-3535 \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":"activegraph/runtime/runtime.py"},"region":{"startLine":3344}}}],"partialFingerprints":{"codehealthFindingId/v1":"047483edccce184709d03c17a17c0686c38232b6d49f3d5720c536aa132006d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): activegraph/store/falkordb.py:518-527 | activegraph/store/falkordb.py:751-760 \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 \u0060activegraph/store/falkordb.py:518\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":"activegraph/store/falkordb.py"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95c8d67a08ffc9596f91c9246dfa7d507cc07a590899cc61667c028a2bac493"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): activegraph/store/graph_conformance.py:514-521 | activegraph/store/graph_conformance.py:536-545 \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":"activegraph/store/graph_conformance.py"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"79013982e34b575cfece49800bfc5497f7980dc138e4b5a237e0c9c70afd8654"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): activegraph/packs/loader.py:623-630 | activegraph/packs/loader.py:655-662 | activegraph/packs/loader.py:674-681 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/packs/loader.py"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"3058caedf57bcfc0167dfb6f1565813e7a888bf86c95e55640b03e4b1392aa35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): activegraph/store/postgres.py:410-417 | activegraph/store/sqlite.py:319-326 \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":"activegraph/store/postgres.py"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"543ebb92e9a61c071746c5e7b90d9b67da08156c6ec5cdad7311e7af8f79aac5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): activegraph/cli/main.py:516-522 | activegraph/cli/main.py:922-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":"activegraph/cli/main.py"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"4068a2d90e21afd66da3bcfdfd967c2562589c553fbe42bd5afca20b10b36c35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): activegraph/llm/embedding_cache.py:102-110 | activegraph/runtime/runtime.py:4590-4596 \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":"activegraph/llm/embedding_cache.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"1133d7a03f95e512037d6c06c67352b64876a24fe9ba8030d30a06b70cded5a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): activegraph/cli/main.py:517-522 | activegraph/cli/main.py:834-839 \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":"activegraph/cli/main.py"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"8037c3cddb3c672de42cca8c366e9d1c510c99b002dc5821181ee29e0c91c911"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 2): activegraph/store/graph_conformance.py:513-518 | activegraph/store/graph_conformance.py:557-561 \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 \u0060activegraph/store/graph_conformance.py:513\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":"activegraph/store/graph_conformance.py"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba23015974cf1c6c7d34ef68319456fa0f24366feccd1c9f5cacee06f7278a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): activegraph/trace/printer.py:163-168 | activegraph/trace/printer.py:191-196 \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":"activegraph/trace/printer.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd6e47d522d41da3b8ddc9e2cc9fb9488f0924d0f68ab9d86572378010cdd01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): activegraph/runtime/registration_errors.py:41-45 | activegraph/runtime/registration_errors.py:159-163 | activegraph/tools/errors.py:176-180 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/registration_errors.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b70758183b4b4ac63b776bc55c5aca929b5fd9a10bf9c06b8c4db3a4a4a0b84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): activegraph/store/graph_conformance.py:420-424 | activegraph/store/graph_conformance.py:444-448 \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":"activegraph/store/graph_conformance.py"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"383522701885f1db4f2ccc74e324d4977b1e5a5aa4982d0794fb8038746e44ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): activegraph/llm/anthropic.py:239-243 | activegraph/llm/openai.py:297-301 \u2014 before extracting anything, compare \u0060activegraph/llm/anthropic.py\u0060 and \u0060activegraph/llm/openai.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"activegraph/llm/anthropic.py"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d0f4cedf08c256b26212acf0809accff2ac7c5f5eeacd42f84e10c0768b23d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): activegraph/observability/otel.py:97-108 | activegraph/observability/prometheus.py:103-114 \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 \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/observability/otel.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba1ce2af7e4802fa0112218eb5a5c1dc653f8d7718cb47a6846ab4aa81b2a31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201333 lines \u00D7 2): examples/operate_a_run.py:58-88 | examples/resume_and_fork.py:40-72 \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":"examples/operate_a_run.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d19a3c98a70093d02d2c93e3df2efa2b15b153c869b01003d4eb45f9cd953ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): activegraph/packs/diligence/fixtures/__init__.py:216-231 | activegraph/packs/diligence/fixtures/__init__.py:239-254 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060activegraph/packs/diligence/fixtures/__init__.py:235\u0060 calls \u0060_first_doc_url_from_history\u0060, \u0060_final_research\u0060 and \u0060activegraph/packs/diligence/fixtures/__init__.py:215\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":"activegraph/packs/diligence/fixtures/__init__.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a11a1e0568b3d6dc1aaf13b4805064c568d0c216ca2e25d6eec077d8fe3b6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): scripts/audit_docstrings.py:90-104 | scripts/audit_types.py:76-90 | scripts/gate_docstrings.py:112-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 all 3 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":"scripts/audit_docstrings.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"15320b2dae8429ed6c9f12174d05466ee0e150850ae5c3a0621315a0ede4ff03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): activegraph/packs/diligence/fixtures/__init__.py:330-340 | examples/diligence_with_tools.py:398-408 \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":"activegraph/packs/diligence/fixtures/__init__.py"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6b18e3b304d0cbe7b16ac94d0a57b2eb4145edd41a21a89921f3804e2987c4"}},{"ruleId":"D16","level":"warning","message":{"text":"bus factor 1 \u2014 one contributor carries this repository: 2 contributor(s) have commits in this repository (automation and bot accounts excluded), but the commits of a single one of them cover most of its history \u2014 91% of the 247 commit(s) sampled \u2014 so the number of people who actually carry it is 1. This is not the ambient state of a solo project: there ARE other contributors, and if the one who carries the repository becomes unavailable, the knowledge behind most of its history goes with them. Spread the next changes deliberately \u2014 have a second contributor review or pair on them \u2014 and write down the parts only one person can currently change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a99f114ab4dfee37ae0bf0665b44c7468d85b809d361949e2b6258101fa1e5a2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: parse the text for a growth percentage and emit \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/cli/quickstart.py"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da8fedbabf797de145b606d953a501727f8437332e50208400deccd12e5f96f"}},{"ruleId":"D27","level":"note","message":{"text":"Scattered collaborators: 89 % of calls cross a namespace and only 44 % of collaborators are co-located \u2014 group each feature\u0027s code into a vertical slice so a call\u0027s collaborators sit together."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5aad4a4530bac3928d3a065a664be89d023ecfc865f9bf79ac05754b3bffe322"}},{"ruleId":"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":"aaa4a03d79b3f1baf6c5f49330da58bf7e19ae8e7bee480be805a81aa0b676d3"},"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":"c6930a0834226d63c56d142516b4b7ca2d53d03aba9fe4fcbdfc3af7acc27ce3"},"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":"defc8a1f30f678403ae62282c33f0a4e9c147f63b638a15b8f7b5cdd37fb667f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","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":"8500bd444dd29b22a2b7ee47bd5fb7323de7a5296fca9e95d0d7da12354cfcad"},"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":"c4d3234c3b4ed3d3f13a454592776037d87730cbd3b990fb4b107f763acfef49"},"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":"3e9e9d938b2c8da22bea3ca1a54d8a9c4f22108683329559c9cdd3187495ca2c"},"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":"50adbcd711dca68f872cf2be71adcafe71227cad845e99d760eb77a975a1047e"},"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":"b327e28ad39506b227e92b7252806b91ce95b4241860dcdbe2089002ced52fa9"},"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":"6ac4f1e692c8e1ce4bc934fa159ba82df582bd51ff06671e5ad7a700f7b1e629"},"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":"0368062220b7d03a1fa9e9d2bccb854d86c67fc9ecc0cc9ff48703e4ad75233a"},"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":"b76302d18983e3c0cee9775f03774a94229c7acc75fcce0c17820ebd1b7afbf3"},"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":"dc8a0b6a29052aa48bc18119bec50c3d6534e9f540be1132524d3deef2404b78"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","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":"d89ff8be40979a750f71a1b1785d33a78ab956aa773c1a40e692751cfa2edca2"},"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":"f1b6f882d88cc52942c6902541aa85aa6ae1071cc7ec9160d1e5b6ed40c98ed5"},"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":"d818e944899ba27da1fbc623858eb1f91f4682165316fc5b831f8d206800cdd7"},"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":"b63c93c76e40dda3d12442ae65377889e912bc68f6b1de302d22e4f7ba477bfc"},"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":"1bc6ed4cef9b5a2b1213c4e99c76c9d1dee0350e1fbcf6223f9649f5649b160c"},"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":"aeee24cd5ad32dff2269bf8bbadb0a99d926c1db36cf21f9bf6d7db13a5ddac3"},"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":"80481f006e40fb8af0d3f8bf5bafc3429ab01526da927ff2fe61fcc26a89123d"},"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":"3dd6fc14add60de7627b8304996cecb23ecfa9dba2acbadf0d1947882a62edb7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","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":"dcae5c635eeb877e3df5107ae95a08a343c41a8f704cf48435c0b828a62fb0d7"},"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":"9933b87ffd525cc2390f9fb230fc7b4c151aae0822a7337bbc770ad97558a432"},"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":"d156139017b9c6e9b34077e9de54214a4b7bba31da08960410c6ad15b5afde44"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1565883df75385a1b207f5259f3dbab918cdee06070ebc6950ed5da06d6b66ca"},"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":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 18 of 86 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 86 of the 105 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: activegraph/packs/diligence/behaviors.py, scripts/audit_types.py, scripts/gate_docstrings.py, activegraph/packs/scaffold.py, activegraph/runtime/scheduler.py, activegraph/store/conformance.py, activegraph/tools/recorded.py, activegraph/llm/native.py (and 10 more). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/packs/diligence/behaviors.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42697e4310405de8c8c2d79cd9791d917c15e78b2eae1bb332e0b105ced49853"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/audit_types.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90db3d18ecb3652cdb0cc257b1b221d3f8b4f950074b077cb007c2bc3db6d139"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gate_docstrings.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f91098cf6c2073f838654279ecb7355b3f05ae3f7f80f20b9b840803cb3f41"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/packs/scaffold.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"263b2d950c54ebbee7a1439fdb3cd1090c853e8a4187cbe83d83c5e3066e736c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/scheduler.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97717e450de054f3ae4db14839cc7a3c6db8d82dcf5b7a6fc3aa983dd5859b09"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/store/conformance.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0362dd6298faab05fd4a9aab6df5a73b80e380470606dfd00119644b96ceff"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/tools/recorded.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be98fbf39d31dcb69e50f5911c986591126124d158f3d33ab7e83e6c572615e2"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/llm/native.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb95238ce3b73464466a72f72913aba209e0f2bf86f0877c9c4242dc50b5520"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/context_reads.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76933bd8626c83de004ded8b7f61e910b674df94050c2126ce9aa06f8a3e1d58"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/llm/wire.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9afdaa7c8840b957d6bb581654f86910aef321348718c11e98ae4ef77af279ed"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/tools/cache.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"779fc223db5ff690f90453a86f0d0628cd99093fa9d9dfe68f1b7dc71570fe23"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/packs/diligence/object_types.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa01b934aed1e3a4730e4eadef37060f5f229c9f28dfbcc0aec59df472d8a55"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/trace/causal.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b93d470db4ae7712aff61d2b8c67396209bafac09f06855208eae041e781c8"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/config_errors.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce73406a0a4ee6b8404131d546d02402398019dcf97a73413421436a5ec502e1"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/packs/diligence/tools.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a152fdf2c66356e49080067ec2e9b45925690f8e4f3d62d11b543cf4ac7be33"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/llm/parsing.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0c0ac7ffa4c7b768b8caeea08ffab2ffcbefaeb98b346ed95ccf24ca2f851f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/packs/diligence/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a8c854d5530e2a8ebc7b2d781ceb22e587c595fd68b367278a5d243ac4e4f2"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/tools/web_fetch.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90bd60b3e9fe2a66810a54009195d8bb2ba42534d8f5a34b3f8123d645ca2e6a"}},{"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":"9b023c6d87bfee3837828bcb79b4a8db331513314a5c41765a5b6e37b1db30db"},"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":"421374c2c8d78a9eab4ec421c76ee92933214f35d9971f773e738257baf11fa7"},"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":"4fc50f47bc5977d6571e15b6fb5974ce0c6d79e24149d8f6bb254276a6fd8d9e"},"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":"0421a340645a9484d66d35d86267895347bb950ac57ea2fdbd9ab8e151a17452"},"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":"767a0a503dec1a17bb018cc6d9192a298f06b7bb0497e171ebece5ca7b6c65be"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"M2","level":"note","message":{"text":"ADRs not easily discoverable: 2 ADR-shaped document(s) detected by content \u2014 \u0060CONTRACT.md\u0060, \u0060promote-design.md\u0060. They are not under a conventional ADR folder (docs/adr/) and are not named NNNN-title.md, and this check found them by their decision signature rather than by where they live \u2014 so a reader who does not already know these paths has no route to them. Detected by content signature only: records kept outside the repository, or written without a Status/Decision/Consequences shape, are not visible to this check and are not counted here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ea921cf64dae701abd877090b3279ff10d03c2e3250e26c8c299d7c5665e0d3f"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add bandit, \u0060semgrep --config=p/python\u0060, or CodeQL\u0027s python pack as a CI step. What was searched, so you can tell an absence from a miss: the 7 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/deploy-verification.yml"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060best_key is None or len(key) \u003E len(best_key)\u0060 appears character-identically in 2 files \u2014 activegraph/llm/anthropic.py, activegraph/llm/openai.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/llm/anthropic.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"03190d0235d4db14e93a79d021705678454403e03a53688c1ffe55ee9086c7d3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060getattr(provider, \u0022default_model\u0022, None) or \u0022claude-sonnet-4-5\u0022\u0060 appears character-identically in 2 files \u2014 activegraph/runtime/_live.py, activegraph/runtime/runtime.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/_live.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b634678ab4236583dd3a76a8064871da4009e6dcf882768d28e0f961e4f0d2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060inspect.isfunction(obj) or inspect.isclass(obj)\u0060 appears character-identically in 2 files \u2014 scripts/audit_docstrings.py, scripts/gate_docstrings.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/audit_docstrings.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ab42a1f7bb88d6d431c2f94a0234fc6f009acd44a057135d4b90c2680440f2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(annotation, type) and issubclass(annotation, BaseModel)\u0060 appears character-identically in 2 files \u2014 activegraph/_signature.py, activegraph/packs/loader.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/_signature.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"d98f47607d589189e65c594e1eb4daf884fe1140772556d7aa6e7fd96e025342"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(value, str) or not value.strip()\u0060 appears character-identically in 2 files \u2014 activegraph/runtime/dev_override.py, activegraph/runtime/runtime.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/dev_override.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"230a5413296912235ccf3011ea628aa44966bbd77ea6088c0b99fc42e708fe8c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060output_schema is not None and not tool_calls\u0060 appears character-identically in 2 files \u2014 activegraph/llm/anthropic.py, activegraph/llm/openai.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/llm/anthropic.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb18cf05e4b783fc94abf6ae9a412d6667010cd069d1d7e6c029d7cf55983679"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060plan.result_mode == \u0022exists\u0022 and not residual\u0060 appears character-identically in 2 files \u2014 activegraph/core/graph_store.py, activegraph/store/falkordb.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/core/graph_store.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"120bf880eff2f5015788c78bbd053dcbdaeb78e5a35f0c6756a1c418e1284205"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060structured_output_mode == \u0022native\u0022 and output_schema is not None\u0060 appears character-identically in 2 files \u2014 activegraph/llm/anthropic.py, activegraph/llm/openai.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/llm/anthropic.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ee94ddfe68c1f8ad41aec45af73f0a7abeaa08c2aeec2a998474065c3cb264"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tool.get(\u0022type\u0022) == \u0022function\u0022 and isinstance(tool.get(\u0022function\u0022), dict)\u0060 appears character-identically in 2 files \u2014 activegraph/llm/openai.py, activegraph/llm/wire.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/llm/openai.py"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63509592f2d6398c7949601ccfd017fc2ca078fa81872be9a76f89ebf6dcbe6"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060canonicalize_args\u0060 is public and takes \u0060args: Any\u0060 from its caller, and it calls itself at line 48 (\u0060canonicalize_args\u0060) with a piece of \u0060args\u0060 (and at line 50) \u2014 and nowhere in \u0060canonicalize_args\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame 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. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060canonicalize_args\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/tools/cache.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b560c3f8632fd6138626d1f00d8ae07c082e3b638c984f9d0273c483192df03"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060encode_payload\u0060 is public, takes a document from its caller (line 52) and hands it to \u0060_find_non_serializable\u0060, which calls itself at line 104 (\u0060_find_non_serializable\u0060) with a piece of \u0060payload\u0060 (and at line 112) \u2014 and nowhere in \u0060_find_non_serializable\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame 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. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_find_non_serializable\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/store/serde.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"5995fb82cc577687a43038dfbe1618d16a21325dbe688c51a9bd14c425fe9606"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/_signature.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aaa4f1d030708cc5d322a465936e129beef766f09acade3aa4fceb4ee5c386b"}},{"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. On a teardown path letting it propagate is not an option (throwing out of \u0060close()\u0060 masks the failure already in flight and abandons the rest of the cleanup), so make the swallow deliberate instead: narrow the catch to the exception this release can actually raise, and record it through whatever this codebase already uses to report problems \u2014 or, if it truly cannot matter, say why in a comment on the catch."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/store/postgres.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9d697d396850ab48915168c81c589e869feabc42385c2f6b569e29b2e4777f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/sinks/dispatch.py"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"7914d99bc8e9de03985c64d777347bf9ad32dde88f1afcbd3f4fc335022e59a1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/sinks/dispatch.py"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f63cbef319bfc060b09abdd220db95e91e31e58e345ae16be8421274b43504"}},{"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":"activegraph/runtime/runtime.py"},"region":{"startLine":3207}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ef7ca542e943f3d41b7d4ebaabf0e9c7ed0e7de27a573eb0a4eea31b36a48c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/packs/loader.py"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ad1cbecfdc79aff56ec12e85d8787b5e1fa33c9ed7e6280443a95aa020642f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/llm/anthropic.py"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f04425cebaa5611501d24e4297613593600cf5a17349ff38c619fa4de3f32a1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/llm/openai.py"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"175e96e91cf07ce64d195a998a1c5972ed9b61cc1707de7a2be9ad0059896730"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 2507 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":2507}}}],"partialFingerprints":{"codehealthFindingId/v1":"8361267537a8631db3423bbb78c7616969067c4075439a306bab0806b8f1c9e0"}}],"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-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-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-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-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-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"}]},{"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-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":32,"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."]}]}