{"$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":"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"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"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":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"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"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"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"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"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"]}],"properties":{"cwe":["CWE-1357","CWE-494"]}}]}},"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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":1562}}}],"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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":4180}}}],"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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":949}}}],"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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":3586}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc11b036fdd2f32a44ac0721e4cf9527f1328d7dc3300d28cc30298c28ef5eb"}},{"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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":2796}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42e801795b3b2e9940b5ff7d9a3de3941b1a4e3f3dd5584e105d5090476420e"}},{"ruleId":"D1","level":"warning","message":{"text":"audit_docstrings.format_report (cyclomatic 22): audit_docstrings.format_report has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/audit_docstrings.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b9d73b5f47ec80368625a90c87974b2f57835fca2a09bd61bdd71d264b3de1"}},{"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":"Runtime.__init__ (cyclomatic 21): Runtime.__init__ has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd90f927034c36e5a57ad67e406755c6326007946653b2eeb894e2afb250896a"}},{"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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":1136}}}],"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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe09cb2f13165561db68662f0951251e83d45ca4997565e8c0488ea831e9c50"}},{"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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":3393}}}],"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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":2097}}}],"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 96, ternaries 29, boolean chains 15, error handling 15, loops 6 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":1562}}}],"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 41, loops 11, boolean chains 2, ternaries 2 (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 30, loops 12, ternaries 4, boolean chains 3 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":949}}}],"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 21, ternaries 13, boolean chains 6, loops 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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 26, boolean chains 8, ternaries 6, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":4180}}}],"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 27, loops 9, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":1262}}}],"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 23, loops 14, 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":"audit_docstrings.format_report (cognitive 39): audit_docstrings.format_report has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 16, if/else 14, loops 9 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/audit_docstrings.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ecb08fb3859d89ad096197e9204283bf2162eab409e01494848c22e68778e9"}},{"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 24, loops 6, boolean chains 5, error handling 2 (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":"audit_docstrings.collect_ring0 (cognitive 34): audit_docstrings.collect_ring0 has cognitive complexity 34 (threshold 15). Drivers by points: if/else 25, loops 6, error handling 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/audit_docstrings.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01bf8db4de2edada0563906813e76c41eed57d552ac2820b894bb6588f44d08"}},{"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 12, loops 8, 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 20, boolean chains 7, ternaries 5, 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 23, loops 5, 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 22, 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":"audit_types.collect_allowlist_modules (cognitive 30): audit_types.collect_allowlist_modules has cognitive complexity 30 (threshold 15). Drivers by points: if/else 19, loops 6, error handling 3, boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/audit_types.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"980eed812f4daae085b40c2f569ab657735a559b6e18569a3266b8ab982bc1f6"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime.promote (cognitive 29): Runtime.promote has cognitive complexity 29 (threshold 15). Drivers by points: loops 9, ternaries 9, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":3586}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfbb23d608edb082ae33216a2c01696dcb57edc8158f4dd6fafa0783d34f7f26"}},{"ruleId":"D2","level":"warning","message":{"text":"gate_docstrings.collect_ring1_coverage (cognitive 29): gate_docstrings.collect_ring1_coverage has cognitive complexity 29 (threshold 15). Drivers by points: if/else 23, loops 3, error handling 2, boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gate_docstrings.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"9681d4b669175e22c0d48f5caacaf160ec3fc380097eba222039a0b3fe808244"}},{"ruleId":"D2","level":"warning","message":{"text":"SinkHandle._run (cognitive 28): SinkHandle._run has cognitive complexity 28 (threshold 15). Drivers by points: if/else 21, boolean chains 3, loops 3, 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":"gate_docstrings.collect_ring0_status (cognitive 28): gate_docstrings.collect_ring0_status has cognitive complexity 28 (threshold 15). Drivers by points: if/else 19, loops 6, error handling 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gate_docstrings.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cff519dde5c6379218b1101d16a06d549dad231b1f2bd78d7273aa708a5e2df"}},{"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 21, 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 14, loops 6, ternaries 5, 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.disable_pack (cognitive 26): Runtime.disable_pack has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15, loops 6, ternaries 3, boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":2796}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5543ecef7b030f8559ef067d09c78c35b29a3e3d75aef858ee6cdb30405387a"}},{"ruleId":"D2","level":"warning","message":{"text":"audit_types.format_report (cognitive 26): audit_types.format_report has cognitive complexity 26 (threshold 15). Drivers by points: loops 15, if/else 8, error handling 2, ternaries 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/audit_types.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"abed8a8caf734bbda2dab7227fdf11c5ae9832f46d043b54572a762ae18805cf"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime.embed (cognitive 25): Runtime.embed has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14, boolean chains 5, ternaries 4, error handling 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c9bbc9054dd790ad5b6413e23a3fa0e9171b10a8eb6a88717f2ffe80cc3267a"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime.__init__ (cognitive 24): Runtime.__init__ has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 12, if/else 7, boolean chains 3, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded5c9fbf35038d8aa9be7a934e0ce56fb783761756eaa847603ff75c1d1e667"}},{"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 13, error handling 8, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":2097}}}],"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 9, error handling 5, loops 5, 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 15, loops 3, ternaries 3, boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":4101}}}],"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 13, boolean chains 5, loops 5 (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":"audit_docstrings.collect_ring1 (cognitive 23): audit_docstrings.collect_ring1 has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17, loops 3, error handling 2, boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/audit_docstrings.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2957be5eb830e18cedaf395a3263134fb197d4ed5e1acbc668baeb0f3f5b51"}},{"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 9, ternaries 8, 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 16, loops 5, 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 18, 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 15, 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":417}}}],"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 15, loops 4, 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":234}}}],"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 14, error handling 2, ternaries 2, 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 16, loops 3, 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":170}}}],"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 11, 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 14, loops 5, 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 18, 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 13, boolean chains 4, ternaries 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/promote.py"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"834b03076c8f8a914f8e94c03323745099779f96a72ba31efcc41802b75b0260"}},{"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 13, loops 2, ternaries 2, 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 4, boolean chains 2, ternaries 2, 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 7, boolean chains 5, ternaries 4, loops 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/cli/main.py"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"f011a7a8ec481214de46b6a4a78b602336fae91725899b8259d4e5367568ca40"}},{"ruleId":"D2","level":"warning","message":{"text":"gate_docstrings.main (cognitive 19): gate_docstrings.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, loops 6, boolean chains 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gate_docstrings.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7f247319ae8a967b314deceb3c56a619a238e386b009580d433e7df017203f"}},{"ruleId":"D2","level":"warning","message":{"text":"native._inject (cognitive 18): native._inject has cognitive complexity 18 (threshold 15). Drivers by points: loops 10, if/else 7, 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 14, loops 3, 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 12, 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 16, boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":1330}}}],"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 11, loops 3, boolean chains 2, ternaries 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/runtime/runtime.py"},"region":{"startLine":4444}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a7b05d8ed949e9b6d2f70775ddcea50e806fb48ebcba031e22e6d30a613c69"}},{"ruleId":"D2","level":"warning","message":{"text":"sandbox._run_forked_trial_local (cognitive 18): sandbox._run_forked_trial_local has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, boolean chains 2, loops 2, ternaries 2, error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/sandbox/__init__.py"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a3adb67cbd7195ccb03787f5fe0477e1ac01f75f6e91ca480677788f39bbc0c"}},{"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 6, loops 4, boolean chains 3, ternaries 3, 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":90}}}],"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 14, boolean chains 2, ternaries 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/store/url.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"2495c765af660bc001615fb681594bd477c47ee15a03e4bb0991eec058b25919"}},{"ruleId":"D2","level":"warning","message":{"text":"test_doc_links.test_docs_base_url_is_centralized (cognitive 18): test_doc_links.test_docs_base_url_is_centralized has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, loops 6, 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":"tests/test_doc_links.py"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f66ac2015a89be61e05ee272d2315f1605798627e7cb417522842176471ab5"}},{"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 6, error handling 3, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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 15, 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 10, boolean chains 3, loops 3, 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/runtime/runtime.py"},"region":{"startLine":2592}}}],"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 10, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":3393}}}],"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 6, loops 6, error handling 2, ternaries 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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 11, loops 4, 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 8, if/else 6, boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":4371}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ec0744aeb229771233a21de9524de5bc6b0d833dde3c732a61dba00fdda4fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime/runtime.py: FileTooLong \u2014 3000 significant lines (blank, comment-only and punctuation-only lines excluded). 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. 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":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c0c2ee6133d54651f8cfa1d0ff6c2dc81fd057bc5d51a04bb52d3202a68ee8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/main.py: FileTooLong \u2014 860 significant lines (blank, comment-only and punctuation-only lines excluded). 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: core/graph.py: FileTooLong \u2014 792 significant lines (blank, comment-only and punctuation-only lines excluded). 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: packs/__init__.py: FileTooLong \u2014 675 significant lines (blank, comment-only and punctuation-only lines excluded). 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). 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. 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":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4279fa6df4e3acd5d4588d3264e831ff7c08d95b7fcc00f1dcf2c6639c8ef4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): activegraph/core/graph.py:649-671 | activegraph/core/graph.py:705-730 \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:649\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/core/graph.py"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"044afacd89a6e1217d65c061be88f3e15eebb6e457147127b330bd7379b25acc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): activegraph/llm/anthropic.py:169-189 | activegraph/llm/openai.py:221-241 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. 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. 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/anthropic.py"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a16d6167903208a4ffd24e0a6e35c62a78c9f5339992d6ffd1b3244e62a892"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): activegraph/packs/__init__.py:940-957 | activegraph/tools/decorators.py:72-92 \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":"9c2666bc8a3d41b10f3a58ccbc3c08caf5486d3636fbbd14da80e6beaaea2bad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): activegraph/runtime/runtime.py:2908-2925 | activegraph/runtime/runtime.py:3071-3087 \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:2908\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":2908}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4d1ecb6d59164e04905e3373cf365fc290b5af33c9c370000d30e1d8f91dc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): activegraph/packs/__init__.py:757-775 | activegraph/packs/__init__.py:903-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:757\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":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db2220f9be9906f21cc92cce5850dc0ef5d7626a871505c6052a2a83ed6f831"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): activegraph/behaviors/decorators.py:319-333 | activegraph/packs/__init__.py:831-845 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/behaviors/decorators.py"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"975919cdfcb97723ec854ca817453b7c5ec007b13cbbbde4e9eb9915fcb51564"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): activegraph/runtime/registration_errors.py:107-121 | activegraph/runtime/registration_errors.py:222-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:107\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/registration_errors.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f196b10680bfe7329faeff8f674a8638d13c18eb721529f41e9ff42ccd7e4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): activegraph/behaviors/decorators.py:183-196 | activegraph/packs/__init__.py:738-751 \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/behaviors/decorators.py:183\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":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1ff663c047ab7c693df56ed899b165c4f6e732db8bcf453ea048af65a0f325"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): activegraph/behaviors/decorators.py:374-387 | activegraph/packs/__init__.py:883-896 \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/behaviors/decorators.py:374\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":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"029fdf02171d343820448352b1a5628c9d290494ffde7766f61b71e93d7b37d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): activegraph/llm/anthropic.py:46-61 | activegraph/llm/openai.py:69-82 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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":"activegraph/llm/anthropic.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78899c27c07dc07dad052200b71030bc6aa03b8785907520560a664a9ed9f70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): activegraph/llm/recorded.py:167-180 | activegraph/llm/recorded.py:319-332 \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/llm/recorded.py:319\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/llm/recorded.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"110c7cf14d2a025faa8bea99015df035f38bbc1673bd20371667d97d74a2aa69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): activegraph/packs/diligence/fixtures/__init__.py:216-229 | activegraph/packs/diligence/fixtures/__init__.py:239-252 \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/diligence/fixtures/__init__.py:216\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/diligence/fixtures/__init__.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0325c5d2fc281ab4f21fc99834c14a8a0ab59c7115feb50f3362c28f3bc637e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): activegraph/runtime/registration_errors.py:47-60 | activegraph/runtime/registration_errors.py:165-178 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060activegraph/runtime/registration_errors.py:47\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":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"971c799d06ae763d3ed75393b3a840ab0212344578a904ed81329701ca62747d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): activegraph/runtime/runtime.py:678-692 | activegraph/runtime/runtime.py:781-794 \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":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"38914d5e0201b2ea0c76575d1bdf78d03c490683ca2b0004dc65148c5e28304e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): activegraph/runtime/runtime.py:3310-3325 | activegraph/runtime/runtime.py:3485-3498 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":3310}}}],"partialFingerprints":{"codehealthFindingId/v1":"68452b5add37076dee44b74817e9826ee0d44f04b043de9c58669482087ff31d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): activegraph/store/postgres.py:409-422 | activegraph/store/sqlite.py:293-306 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060activegraph/store/postgres.py:409\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"b737228b63971f84d93fed51cf4bd28397b021c6f32dec8d0ffd4dd64935dd49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): examples/operate_a_run.py:73-86 | examples/resume_and_fork.py:55-68 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/resume_and_fork.py:55\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/operate_a_run.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f890ae5fefa692b3d01e0937c2410e1ddf4b106a3bf99ac090a624231509b936"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): scripts/audit_docstrings.py:91-103 | scripts/audit_types.py:77-89 | scripts/gate_docstrings.py:113-125 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0aacd6a2bd3676a29a5fa7cf59b4f6870c73198bd26bc6efddbf5b81f2e7538"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): activegraph/runtime/runtime.py:3070-3084 | activegraph/runtime/runtime.py:3102-3114 \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:3070\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/runtime.py"},"region":{"startLine":3070}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd55df2628ad63b0481ba46bc1d85e84f5427b93c61dac88b13ffe76b8247a41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): activegraph/llm/anthropic.py:190-202 | activegraph/llm/openai.py:242-253 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/llm/anthropic.py"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24aa9268a2b8880e79fa8db3a335d0f88dd1e217911658310204fd0f80d6f01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): activegraph/packs/__init__.py:263-274 | activegraph/packs/__init__.py:316-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:263\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":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"342f361e9e69cf003ee1e8e89407a682ba9213f6a257813ee9a5ef16609e8b16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): activegraph/runtime/runtime.py:1390-1401 | activegraph/runtime/runtime.py:2523-2535 \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":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"b258d788bde9385012fc4ed020b49cd45905d36b84a4cce900870dc9d57442e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): activegraph/core/graph.py:742-752 | activegraph/core/graph.py:763-773 \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":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"565bf32f44fab821bc8e6cffefa84488f58f38a34279e026f76262602b1afe35"}},{"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":"661d7d5b0f462f2f3f973f231745c89784e2b363fedcb130431282ef83e48cf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): activegraph/store/postgres.py:239-249 | activegraph/store/sqlite.py:134-144 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060activegraph/store/postgres.py:239\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/store/postgres.py"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97a7a81b6f44dc08d2434fbf41a4f63e4c78937c302cb5b6029c806984dda3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): activegraph/runtime/runtime.py:2331-2340 | activegraph/runtime/runtime.py:2353-2362 | activegraph/runtime/runtime.py:2400-2409 \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":2331}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b85b3caa8e78fa49aa1f5a5ef11bdf18e249e56d2f8ee5d735ab7e775db51c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): activegraph/store/falkordb.py:292-301 | activegraph/store/falkordb.py:391-400 | activegraph/store/falkordb.py:414-423 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060activegraph/store/falkordb.py:292\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":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b5f2dfb498ce555f675807ea24da7327f7658dda6485117153ee6a2fd139dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): activegraph/packs/loader.py:658-667 | activegraph/packs/loader.py:677-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:658\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/packs/loader.py"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"179730fc07cdb45acf3b3c8c21bb76224482dfb0e9185f3ced443f97e2dff415"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): activegraph/llm/anthropic.py:380-388 | activegraph/llm/openai.py:519-527 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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":"activegraph/llm/anthropic.py"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a51d7d20585a49272553e939c7138ffbacb4b22a81e99cbe67c0f52e5c9171d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): activegraph/store/falkordb.py:371-379 | activegraph/store/falkordb.py:506-514 \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/falkordb.py"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"1021a1f9c56ba3e64269a28da1266c9d3b150adbc8789422c9871b92c46422d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): activegraph/cli/main.py:517-524 | activegraph/cli/main.py:834-841 \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/cli/main.py:517\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/cli/main.py"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b5b0627858a2d830cac8bec5cff7ec6b5d0978d0a672b29ec01750c5993a28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): activegraph/llm/embedding_cache.py:102-111 | activegraph/runtime/runtime.py:4461-4468 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/llm/embedding_cache.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7671fe9db606e7539797cdb9bb1f7d5eb8e9977878e22e1003ac167cc7dbacd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): activegraph/store/graph_conformance.py:304-311 | activegraph/store/graph_conformance.py:334-341 \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":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"56fa8648fcaa356e8a7fd9c416205a171ec8bb646ff3ca664bb51288de9478ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): activegraph/store/graph_conformance.py:421-428 | activegraph/store/graph_conformance.py:443-452 \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":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e147613fa0b6b0edf09a6621f87181cc87565cff5e0f31be5b58c05493f910c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): activegraph/store/postgres.py:351-358 | activegraph/store/sqlite.py:248-255 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/store/postgres.py"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"232bba35524c29ea6aaa315afc4b94a78b5945d7d5e6b26f09cd392f2082deb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): activegraph/packs/loader.py:624-630 | activegraph/packs/loader.py:656-662 | activegraph/packs/loader.py:675-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":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2cbec962fbc8e670854703fd4ab5e64dc68a34e3f18d68953d5fe16a4e1f44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): activegraph/llm/cache.py:176-182 | activegraph/llm/recorded.py:236-242 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/llm/cache.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"9771e02dab3636a8b364af2083338b6e743af7b1998473b95852c53116b73717"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): activegraph/runtime/registry.py:75-81 | activegraph/runtime/runtime.py:874-883 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/registry.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"214aff4c23589a69875932400a72ee71ad045321d8fbc440a6b0629aa730abe8"}},{"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":"ab6899a64dba32efbec9eb33d420025bdfb71d0aa49d00bbe21858b667b0d06a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): activegraph/store/graph_conformance.py:324-329 | activegraph/store/graph_conformance.py:349-353 \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":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16e51c3a3ce9ed1b84103c08849c6e710e47b9fc1c336ed66a022a628b875fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: activegraph/runtime/runtime.py: activegraph/runtime/runtime.py changed 35 times in last 90 days, max complexity 71. 3 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, cover the area it touches with tests, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/runtime/runtime.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ba7e595af3e452b3a830723786c094b239c8022e104b52465f7a7a93e157c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: activegraph/core/graph.py: activegraph/core/graph.py changed 17 times in last 90 days, max complexity 15. 1 of those changes was a fix/bug commit, so the churn is repair rather than feature work. Before the next change lands here, cover the area it touches with tests, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/core/graph.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0d7bd7e0140e1d87182cd80480ff1c340e08a7d9ce346a799116a420dff32d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: activegraph/packs/__init__.py: activegraph/packs/__init__.py changed 11 times in last 90 days, max complexity 21. 1 of those changes was a fix/bug commit, so the churn is repair rather than feature work. Before the next change lands here, cover the area it touches with tests, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/packs/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3471622fdb0dc4d04e812ca6987e9c171e73821b5542b31d47ce6c03581c605a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: activegraph/packs/loader.py: activegraph/packs/loader.py changed 8 times in last 90 days, max complexity 28. 1 of those changes was a fix/bug commit, so the churn is repair rather than feature work. Before the next change lands here, cover the area it touches with tests, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/packs/loader.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd0a3cc7bc5af1cb80d9380dba09b821c10d91532982a5f148ff1a8565dfcc5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: activegraph/cli/main.py: activegraph/cli/main.py changed 8 times in last 90 days, max complexity 20. 1 of those changes was a fix/bug commit, so the churn is repair rather than feature work. Before the next change lands here, cover the area it touches with tests, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/cli/main.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16206ecc2c8cb955179d0520c5029c095807c7854b0862b5717fad9d0dd3559d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: activegraph/packs/manifest.py: activegraph/packs/manifest.py changed 4 times in last 90 days, max complexity 30. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, behind tests written first."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/packs/manifest.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4858deee9f242c05c9456663b59907dbc67d2439cc91c2a9cc6e12c2ee1097"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: activegraph/llm/openai.py: activegraph/llm/openai.py changed 5 times in last 90 days, max complexity 18. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, behind tests written first."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/llm/openai.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15eeb6c516f4e2441a9e129f85bce959fd2de6ab7805e18b2ee4c9fb7be035eb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: activegraph/trace/causal.py: activegraph/trace/causal.py changed 3 times in last 90 days, max complexity 26. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, behind tests written first."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/trace/causal.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad7903a8896d03b53f30f56eced92fec64518c6b1ea74b8d532ca2b1adb75d2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: activegraph/llm/prompt.py: activegraph/llm/prompt.py changed 3 times in last 90 days, max complexity 25. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, behind tests written first."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/llm/prompt.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e93bea425981ff13b6c7de78cc357250281f8fe1f54e49b9787de5925f8c0be"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: activegraph/core/ids.py: activegraph/core/ids.py changed 3 times in last 90 days, max complexity 18. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, behind tests written first."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"activegraph/core/ids.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c771777b9dd4dad0375b5797e0f08c24351a037773e13f0b8575968e2ef2d5fe"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 35 significant file(s) lose their only recent owner: activegraph/packs/__init__.py, activegraph/store/sqlite.py, activegraph/store/postgres.py, activegraph/llm/prompt.py, activegraph/runtime/exec_errors.py, activegraph/behaviors/decorators.py, activegraph/observability/migration.py, activegraph/llm/anthropic.py (\u002B27 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9b3ba8832c165a7e0bfbe33971e4c3aa27324036e17e50a7c5a88bad01095905"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 1 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (36 single-owned of 85 analysed files in total, counted over production source files of roughly 100 lines or more, excluding tests, vendored, generated and example/demo trees, largest first). They are anonymized user #2 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"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":"2d16b263404e85e7665490fb2f27918c0657096f0e8f8de896d3171d0b18bb39"},"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"}}]},{"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":"5c75469546128e484d2e17a1ff8a6249666bb2774cfb8e1347869edef88a3827"},"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"}}]},{"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":"ed6fdc226c4d3b560a6765bd753130fbd1dbb00e11437de41604f04caeeea5a7"},"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"}}]},{"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":"654fbbca25b3d4312c9620f9e60e1460304d3473bab4f5107a659ad2cc2826f9"},"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"}}]},{"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":"8cac62aa76c37ce66766e5640c1bb9a863e1a97fa528d5aa7328f853dbf10b51"},"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"}}]},{"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":"8f78cc937e3224ad68b6179fb2d33a59b49eb02ad210dca990b44cfed49bff56"},"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"}}]},{"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":"bdc07ab4cf281e2f763b258237eec49c5f8d62e45b2693b748fb49c6c1b3a091"},"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"}}]},{"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":"dc6b78bdc4aa87f1c6eb772cef19f841b90a3829a2134b4ec7c500e85d027af8"},"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"}}]},{"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":"1f6c12d6105dcbf80340a81f9a86b18ef5a4cc172248d15aa8b41e736ba1ffc4"},"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"}}]},{"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":"030b081cce463af32a2260163ea17d12a2b5c558816224cd3a7bc37cc1c02b91"},"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"}}]},{"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":"cadcd2d518b5ec1b7c65e72957a20800a7c23dbcea42182c78ae13c3d704ce12"},"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"}}]},{"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":"11cbac4f7c075bbdd49bd1df885576838634e52a7b3c5fa2833890981a588457"},"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"}}]},{"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":"38295e378525d17e6be1e4b368633ef7fef8ecc61e5431888a6193a724735acd"},"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"}}]},{"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":"28beeea8b830c4234cff641e4f11087d8b05295c6d852a59531d12444e57d11f"},"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"}}]},{"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":"e5fda6590d8f36b100f61f8bec088ad8d8bcbb49d57c4a13c11413ed61e14b20"},"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"}}]},{"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":"6e27fcf72d4f10a5a52520121c2839b37020c227fe75695afe9c3030e67dff43"},"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"}}]},{"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":"06cf221a063b9ab8fa125c3bb7e953069b0fa341a7e8eadd49c319e913bce503"},"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"}}]},{"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"}},{"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"}},{"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":"0752d0df7434000fcabf1048e2de30a7a1a8b982b3db9a19898c4dec199856b4"}}],"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":"CWE-353","shortDescription":{"text":"CWE-353"},"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":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"SQL Injection","shortDescription":{"text":"SQL Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"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":20,"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."]}]}