{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"Injector._run (cyclomatic 120): Injector._run has cyclomatic complexity 120 (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":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d40774d46ba05200d6bfd8541f9a7e831573669d39fee69b4833b9b544ec3c"}},{"ruleId":"D1","level":"warning","message":{"text":"Injector._run (cyclomatic 120): Injector._run has cyclomatic complexity 120 (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":".codebuddy/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8826b4cdd6a7632a84a1036513e9b6583c0056f80525dc3a1960bf03202a69"}},{"ruleId":"D1","level":"warning","message":{"text":"Injector._run (cyclomatic 120): Injector._run has cyclomatic complexity 120 (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":".codex/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceba746e1f71a91b6454139135a5bb823d681e902ee436ad732c5178a1f9d2bf"}},{"ruleId":"D1","level":"warning","message":{"text":"Injector._run (cyclomatic 120): Injector._run has cyclomatic complexity 120 (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":".cursor/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b08c1c0b4cadadc9637fb0db5a76ce4bb2f70ff43214735d67f3cbd9e910c6a"}},{"ruleId":"D1","level":"warning","message":{"text":"Injector._run (cyclomatic 120): Injector._run has cyclomatic complexity 120 (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":".factory/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0650a6aa02dd65f1dfb6ac16b4fa8721d6423823f6efa5a7518f78a4781223"}},{"ruleId":"D1","level":"warning","message":{"text":"Injector._run (cyclomatic 120): Injector._run has cyclomatic complexity 120 (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":".mastracode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"41031f1a3eff5d144800cb38d4e80cd29b8e39d35535a8ede85077777d827437"}},{"ruleId":"D1","level":"warning","message":{"text":"Injector._run (cyclomatic 120): Injector._run has cyclomatic complexity 120 (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":".opencode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2642fda016b9a0a4c43b4f19b9a7eab1664703c3c8201106e0b4257c592f74c"}},{"ruleId":"D1","level":"warning","message":{"text":"Injector._run (cyclomatic 120): Injector._run has cyclomatic complexity 120 (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":".pi/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc78cf79721a9e9a9e81fcd2ff3806f3d0c1b62a3cabb97e343195a2146130a"}},{"ruleId":"D1","level":"warning","message":{"text":"Injector._run (cyclomatic 120): Injector._run has cyclomatic complexity 120 (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":"skills/i18n/planning-with-files-ar/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"254ede258f58fdf49dd78fad9ada302ce280d11cbdc4a5b1b713e8599c8ba744"}},{"ruleId":"D1","level":"warning","message":{"text":"Injector._run (cyclomatic 120): Injector._run has cyclomatic complexity 120 (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":"skills/i18n/planning-with-files-de/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"3109d7a1fb7fb1622c0f315a27c0081c566bdddef1e02cf6b8a4dceb3404260e"}},{"ruleId":"D1","level":"warning","message":{"text":"Injector._run (cyclomatic 120): Injector._run has cyclomatic complexity 120 (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":"skills/i18n/planning-with-files-es/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"2745e9899de2fd7e24972742404d4c182c96c02d2c4d8a853643f608e23a69ba"}},{"ruleId":"D1","level":"warning","message":{"text":"Injector._run (cyclomatic 120): Injector._run has cyclomatic complexity 120 (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":"skills/i18n/planning-with-files-zh/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"0087c5a9248204391230712bf297b69f274a924af7dc805fef8dcb2b72a16352"}},{"ruleId":"D1","level":"warning","message":{"text":"Injector._run (cyclomatic 120): Injector._run has cyclomatic complexity 120 (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":"skills/i18n/planning-with-files-zht/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a8a43948a5ef0de9378d0c2c74a1ce08d3c5faf5a988d778dadaf5c53098e7"}},{"ruleId":"D1","level":"warning","message":{"text":"Injector._run (cyclomatic 120): Injector._run has cyclomatic complexity 120 (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":"skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"5641928f15f2230fd0f841e26f76b1c42d62752fbc9974fa123fafbaf5cc1076"}},{"ruleId":"D1","level":"warning","message":{"text":"hooks._auto_bind (cyclomatic 38): hooks._auto_bind has cyclomatic complexity 38 (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":".hermes/plugins/planning-with-files/hooks.py"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b0cac96a82738382cd1162691d42a6a4471fdd837a475ec853a99a79401180"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.smart_plan_extract (cyclomatic 37): inject-plan.smart_plan_extract has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff153f2003da516c3ae0be2ba1313636e44d194513e0c900c1e8043267dcfc8a"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.smart_plan_extract (cyclomatic 37): inject-plan.smart_plan_extract has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codebuddy/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"1919a1cbf2ab6b5bbba48509d7838ac4fe4f03d17d399b9336c702494a43d5ad"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.smart_plan_extract (cyclomatic 37): inject-plan.smart_plan_extract has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73659a54657cf4809ccdc1ed865896630bd144cc78acfb26d0f0622edf315fd"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.smart_plan_extract (cyclomatic 37): inject-plan.smart_plan_extract has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".cursor/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a10e33048da0c3befffd3d9b9abecd9bfce996da9a2a4def3608cbccdb0ee35"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.smart_plan_extract (cyclomatic 37): inject-plan.smart_plan_extract has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".factory/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a467dff7e5d9a8e05fc2a2173f406219bbeae662ceccc8d6c1d0e5456e60e02"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.smart_plan_extract (cyclomatic 37): inject-plan.smart_plan_extract has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".mastracode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0187f45e59e9746949571984373cd225fe5c82e6712edee8a04a2626872793d"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.smart_plan_extract (cyclomatic 37): inject-plan.smart_plan_extract has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".opencode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d158f78b119d12d98226808e199121b75f584c1316efac520ddaa998987b66"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.smart_plan_extract (cyclomatic 37): inject-plan.smart_plan_extract has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".pi/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a1bd3801e06769b12a7b097ad85989449d44ef36c68b4d5788d0798da906e7"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.smart_plan_extract (cyclomatic 37): inject-plan.smart_plan_extract has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-ar/scripts/inject-plan.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"9545df6383cab623c5e3270f72c83af2d8aab7acbbe034c998fbc43c389604cb"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.smart_plan_extract (cyclomatic 37): inject-plan.smart_plan_extract has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-de/scripts/inject-plan.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee89d5c159d2ba4b2a0af5ffc0bdbf4cacf78c5cc626bdf3085b46a5ce1d7293"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.smart_plan_extract (cyclomatic 37): inject-plan.smart_plan_extract has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-es/scripts/inject-plan.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb74c131f8858172bcbc15cfa08980b3462643b15f2c7f6b3b85bf6adbfa138c"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.smart_plan_extract (cyclomatic 37): inject-plan.smart_plan_extract has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zh/scripts/inject-plan.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d85574c72943b0da23b4b122d1df8109447feed3604d31dac76671d666b7a39"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.smart_plan_extract (cyclomatic 37): inject-plan.smart_plan_extract has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zht/scripts/inject-plan.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e796bfba9cb7180e78c813f2d60c87bda384d7038c968603f26644de375a6b"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.smart_plan_extract (cyclomatic 37): inject-plan.smart_plan_extract has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e74d3c17e681fa7e293d82c6a107267c5d54fbd5eb5c498dc7dbd689569b0f8"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.secure_progress_marker (cyclomatic 32): inject-plan.secure_progress_marker has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"05bef32c129291acb96141d59eb34c9d6331f1f8aa065bb62f2604d435dfc86d"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.secure_progress_marker (cyclomatic 32): inject-plan.secure_progress_marker has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codebuddy/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc47ac1cb7b2318bba7f2d0dd5d4213a0d968758c3eb1ab623554c81dff0157b"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.secure_progress_marker (cyclomatic 32): inject-plan.secure_progress_marker has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d83fcf4abb7b82700afcf4dec02680d3a8ab8acc3be8e21f5fb02a34b6984e"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.secure_progress_marker (cyclomatic 32): inject-plan.secure_progress_marker has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".cursor/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2376a1ba5d350463464628732b5ff1776188f8d89dc64a73d0e0a00962b039"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.secure_progress_marker (cyclomatic 32): inject-plan.secure_progress_marker has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".factory/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ffba04e98cee4837ebcee6487a3c450cbf65e63fddccadeb1853bebb60d6b0"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.secure_progress_marker (cyclomatic 32): inject-plan.secure_progress_marker has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".mastracode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b6ecb3ccaab0e845ba840f42b187765abef82f5f68d9ba3d0048b1649fe091"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.secure_progress_marker (cyclomatic 32): inject-plan.secure_progress_marker has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".opencode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c93a29c2fb46268f3cd6b59f4f5ee1cded991d73dbe5d371af9906ad510a77"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.secure_progress_marker (cyclomatic 32): inject-plan.secure_progress_marker has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".pi/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"708ccebc9ce45f535a40fc463343e74aee48bc0edb382c0d2ad6772d641124df"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.secure_progress_marker (cyclomatic 32): inject-plan.secure_progress_marker has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-ar/scripts/inject-plan.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5b2fff3ad9050c8c54019b283d2f195ed1c80a9f72675d13fa1835696b4efb"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.secure_progress_marker (cyclomatic 32): inject-plan.secure_progress_marker has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-de/scripts/inject-plan.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f1bfb457997813d02265be3099bca2d07714bf8243d2558764d90a93748bf1"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.secure_progress_marker (cyclomatic 32): inject-plan.secure_progress_marker has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-es/scripts/inject-plan.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"69fd5085ae6cd98dfe4eb47362dd822f5f4fa686c6da444f580c6e58ca51ceef"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.secure_progress_marker (cyclomatic 32): inject-plan.secure_progress_marker has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zh/scripts/inject-plan.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e2dc4645a538383b12367caff4d979a59734bb1301ae529ed0891afc7e5199"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.secure_progress_marker (cyclomatic 32): inject-plan.secure_progress_marker has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zht/scripts/inject-plan.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"626546f8a1af4a703900bdc28c3f7460ab35901fcd371dc612a89002563523c1"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.secure_progress_marker (cyclomatic 32): inject-plan.secure_progress_marker has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94dd29e5415fa63876fd9d29903ef75fdcb5010f4dee8af4008590d413d5fb9"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.extract_messages_after (cyclomatic 31): session-catchup.extract_messages_after 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":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4cbb755d4d965fd5625319f022972fa136ac70ff2ceaf345f6247e3084b3f26"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.extract_messages_after (cyclomatic 31): session-catchup.extract_messages_after 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":".codebuddy/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5d706d5071df30bdcd75bae1248ea4c061eb4624076a9bc4644c9c43c6755b"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.extract_messages_after (cyclomatic 31): session-catchup.extract_messages_after 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":".codex/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"76aa63bae0ea5b67ae9375692af6ce74d1a2b9a3b0ea36d9032458f28e5de468"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.extract_messages_after (cyclomatic 31): session-catchup.extract_messages_after 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":".continue/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"c542ff05e4b841c2ed80fe3de4e155ed0293b76e6189d606fc5d602a394bdfea"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.extract_messages_after (cyclomatic 31): session-catchup.extract_messages_after 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":".cursor/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd65fc75584fd8619681ac2022a4a178f6d4cda0557a1f3336aea2fa3c6d3997"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.extract_messages_after (cyclomatic 31): session-catchup.extract_messages_after 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":".factory/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06467168f6c4a0f690b8e25e19527e1cc28943175c00f5a6777cdddcb9dae55"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.extract_messages_after (cyclomatic 31): session-catchup.extract_messages_after 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":".gemini/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa38016a3fb04b9fa87603d0f7f0bfb2727aa977a1ae0c9cb4145cefd7feb0b9"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.extract_messages_after (cyclomatic 31): session-catchup.extract_messages_after 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":".pi/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a810edab1887d5d695e1abfbd720df18d0fccd91deba57669bd257511685ddf"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.extract_messages_after (cyclomatic 31): session-catchup.extract_messages_after 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":"skills/i18n/planning-with-files-zh/scripts/session-catchup.py"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ca947b937b5099f574a621cf8e14b709312e44111a7d5ffee208c6171be331"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.extract_messages_after (cyclomatic 31): session-catchup.extract_messages_after 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":"skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8f8420cc372fda03cb6de37dcc70424680b0612f3cf1787951131fc0de5e48"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.extract_messages_after (cyclomatic 30): session-catchup.extract_messages_after has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".opencode/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d5a43280cf23f3eb96de23ba0a3d1786b39f0346477ffb3a0873c7b7a0f055"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.extract_messages_after (cyclomatic 30): session-catchup.extract_messages_after has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-ar/scripts/session-catchup.py"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"21fbb3a0181f5d1be344eaf6468a855da77688b916f1fd1379e99d55381b99f4"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.extract_messages_after (cyclomatic 30): session-catchup.extract_messages_after has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-de/scripts/session-catchup.py"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f2fb8bb69bbce30bf2cbd3f7eea6b5ac5fc5279e4ff0c3d5377b0c57c7746c6"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.extract_messages_after (cyclomatic 30): session-catchup.extract_messages_after has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-es/scripts/session-catchup.py"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0422cf58cffed8bc85b329c966d054f0d3b88de64806af78e5c7107203ff09b"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.extract_messages_after (cyclomatic 30): session-catchup.extract_messages_after has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zht/scripts/session-catchup.py"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"556c482ff04211f7edd89adc2c331a413ba48bc74afb056d8da4dac53b086d22"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.opencode_catchup (cyclomatic 29): session-catchup.opencode_catchup 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":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f246761bdd12511c9647f91ab9b694decbe3a09d1b47b3517d566d605ad4731"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.opencode_catchup (cyclomatic 29): session-catchup.opencode_catchup 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":".codebuddy/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc8a4d3396268baddc9d77742a4ed912e3e7d10d4cc9578c437af748f2c6aa2b"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.opencode_catchup (cyclomatic 29): session-catchup.opencode_catchup 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":".codex/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb60e53d365bd62de771868009635aa07b8d18e88cba5b91166a8f0fea161ad"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.opencode_catchup (cyclomatic 29): session-catchup.opencode_catchup 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":".continue/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"d17ef30cad5d35e3b8bfd1cbaa43d22a1fa2548941e8e023190a2259c8b2356c"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.opencode_catchup (cyclomatic 29): session-catchup.opencode_catchup 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":".cursor/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee522e563107f83852cb2424b33faf19d73444af19220dbd0637bbce4e9b7cd"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.opencode_catchup (cyclomatic 29): session-catchup.opencode_catchup 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":".factory/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2aa169fe57258651546b388c039ba12cad08a45cd74a22d54161eaae7f5c22"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.opencode_catchup (cyclomatic 29): session-catchup.opencode_catchup 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":".gemini/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"9afca04051ddfa3492f78af0eab8afc874c0e12b34f6d2296d38ff27abe829a8"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.extract_messages_from_session (cyclomatic 29): session-catchup.extract_messages_from_session 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":".hermes/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f64adecc26292ca2ddb62e014679361c6bc6891c8f673e11654a4ebcf2d66bb"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.opencode_catchup (cyclomatic 29): session-catchup.opencode_catchup 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":".opencode/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d67f32e270fcf100a0a23a54523576430f90823fe65515dfba206a4a8fe6ba5"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.opencode_catchup (cyclomatic 29): session-catchup.opencode_catchup 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":".pi/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"2355518397a11accae6ded9e4cb4771c6a76b7c52375d6ebe002284866244e84"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.opencode_catchup (cyclomatic 29): session-catchup.opencode_catchup 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":"skills/i18n/planning-with-files-zh/scripts/session-catchup.py"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d7a367143063401b1a36d342a8f34ebe2777bff36e361bf049b1f8f00ed802"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.opencode_catchup (cyclomatic 29): session-catchup.opencode_catchup 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":"skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fabeb22a1e2efa478a3f6abcc22dbc519eee55dc32fa01b4c9b2bfdbd7c9cdf"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.resolve_plan_dir (cyclomatic 28): inject-plan.resolve_plan_dir 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":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e3bec5253519ddfa5042a0a8fb54bbbe2fc10e3a7d4724ca7b5acec59f2025"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.resolve_plan_dir (cyclomatic 28): inject-plan.resolve_plan_dir 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":".codebuddy/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7310efaf261009c464d28b09adb0f168c426f7e6cc845221c2853344750c965"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.resolve_plan_dir (cyclomatic 28): inject-plan.resolve_plan_dir 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":".codex/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7298cb546b778419b839851b4fe0c893d95c0694dba7fd81f9d90e13681b91"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.resolve_plan_dir (cyclomatic 28): inject-plan.resolve_plan_dir 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":".cursor/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb5d6dfaed52b7f9c510a106eef78afaf7d523f4a85b39eed2c5c2f702f5781"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.resolve_plan_dir (cyclomatic 28): inject-plan.resolve_plan_dir 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":".factory/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93fb91fb8df890a2d70e4174f7d9162dbe1e11aa68cf0305de4a6fdd6f10e4c"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.resolve_plan_dir (cyclomatic 28): inject-plan.resolve_plan_dir 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":".mastracode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b0adcc7bbec06f44de3d5518c5734d9fd42dff5750df1302ff42b7f401e631"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.resolve_plan_dir (cyclomatic 28): inject-plan.resolve_plan_dir 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":".opencode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7d32f7ccc488735bc06be6bb5e591a963cbeccb3b1954ca2ea4d666f34a3bb"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.resolve_plan_dir (cyclomatic 28): inject-plan.resolve_plan_dir 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":".pi/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b72279a9bf40f2a519411cba6e35db5ccde0b0a4dacf586f662a2bd9745f7b"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.resolve_plan_dir (cyclomatic 28): inject-plan.resolve_plan_dir 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":"skills/i18n/planning-with-files-ar/scripts/inject-plan.py"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda379fe42073f295e094bce8152db41c78f378387875027ef33cdd4a276a85c"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.resolve_plan_dir (cyclomatic 28): inject-plan.resolve_plan_dir 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":"skills/i18n/planning-with-files-de/scripts/inject-plan.py"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74844bcba3ffa9255890e66a05ec1a75f42fbf2ca7f1359cf15875bab95f663"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.resolve_plan_dir (cyclomatic 28): inject-plan.resolve_plan_dir 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":"skills/i18n/planning-with-files-es/scripts/inject-plan.py"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b9965babe597ab446bed7975df1a1e4073df0e86d604c73869ed1233b0ce12"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.resolve_plan_dir (cyclomatic 28): inject-plan.resolve_plan_dir 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":"skills/i18n/planning-with-files-zh/scripts/inject-plan.py"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab678c78815aa6b149ffe6ba28dc4a64f9813b69ad0c6d34b8b0a1db5f6bf764"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.resolve_plan_dir (cyclomatic 28): inject-plan.resolve_plan_dir 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":"skills/i18n/planning-with-files-zht/scripts/inject-plan.py"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"f76adee83ca3ee09aa820ccae2eb74fc30ea831de162341794adbb9abcf150e9"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.resolve_plan_dir (cyclomatic 28): inject-plan.resolve_plan_dir 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":"skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d3a11ed4248424b2f6597d5c82d25e1c6d9b15e14233d78fe73cc358b7107b"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.pretool_cache (cyclomatic 27): inject-plan.pretool_cache has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fbc2d318734e7f60995fe2618b717e8dc65d4ad88aa1b6941412ebc32859778"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.pretool_cache (cyclomatic 27): inject-plan.pretool_cache has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codebuddy/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a30fa5dd19e430fd2d656fa785d535b6035a8b205f89ac42efff1e1f1eb2c8"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.pretool_cache (cyclomatic 27): inject-plan.pretool_cache has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"1465ed99d5132b10443e35e266660ffde39f530e283798de9cd2e1cf76bccbe6"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.pretool_cache (cyclomatic 27): inject-plan.pretool_cache has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".cursor/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"958a44bdf23f2a07182ccedf33ef518d96c3d8ef471dcf17160430b98879ac25"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.pretool_cache (cyclomatic 27): inject-plan.pretool_cache has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".factory/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ca510eb6b8ebb04ba4707d4618003f29725a13e08a3eecda2d56706c2469f3"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.pretool_cache (cyclomatic 27): inject-plan.pretool_cache has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".mastracode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a675f4a5df4040dc745e559ecf51544b7412dafefa5852be3ec863c85dd4c7a"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.pretool_cache (cyclomatic 27): inject-plan.pretool_cache has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".opencode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a23ca50a5f61d0b2fff3bbb2e82aa54c98976a27aea9ff580e4b4409e4783a"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.pretool_cache (cyclomatic 27): inject-plan.pretool_cache has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".pi/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"e355ba511a6dd0d6a92d9b12605991df9f3113a10919db3380b79469ef7174a5"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.pretool_cache (cyclomatic 27): inject-plan.pretool_cache has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-ar/scripts/inject-plan.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07209b6f04b7dbfd058e637afe5973eea0a4ecfa0ca508e5745fb744d408f49"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.pretool_cache (cyclomatic 27): inject-plan.pretool_cache has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-de/scripts/inject-plan.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"427cac7cc55eae4e61a576ba974d6823c9aaca8b04b5a74361c1f9232a126a35"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.pretool_cache (cyclomatic 27): inject-plan.pretool_cache has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-es/scripts/inject-plan.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"9518d294064b39548b13feb63fdb32f9579aae2e3883ccfd8832c9b590e86550"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.pretool_cache (cyclomatic 27): inject-plan.pretool_cache has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zh/scripts/inject-plan.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa1a0bb6195021a91765fd43a47609181195821fc0c8ecdf3b48eac044c35ba"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.pretool_cache (cyclomatic 27): inject-plan.pretool_cache has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zht/scripts/inject-plan.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e41a9262119256533a0e9ba12251ad99f835243ea8d953cd5e38f3bb78ffc55"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.pretool_cache (cyclomatic 27): inject-plan.pretool_cache has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1306d76d289badc363f456ce26b84c9c68936e941280753bb291dc8d544abc2"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.extract_messages_after (cyclomatic 25): session-catchup.extract_messages_after 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":".mastracode/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c607bb49a2ac876a2ad7af139b328edf582ed877bff085775bdddb2c4655cc3"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.safe_snapshot (cyclomatic 23): inject-plan.safe_snapshot has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"e382ed0e9b699f6b3b703a3d25096012f505d2d8e29f51eca548a68a8bd94adb"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.safe_snapshot (cyclomatic 23): inject-plan.safe_snapshot has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codebuddy/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bcb738bfe7c301bb6eae02a2e31564b612f1fbf0f0b1566a0f4a9126faa1ebc"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.safe_snapshot (cyclomatic 23): inject-plan.safe_snapshot has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d5595f7df23da3d90ae692afce0ca6ba93090284f76fd14570ced6f14bb15d"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.safe_snapshot (cyclomatic 23): inject-plan.safe_snapshot has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".cursor/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"17988774afafb3a453e399b332c54d9ebefb0f81e133a51c92f2875a64450573"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.safe_snapshot (cyclomatic 23): inject-plan.safe_snapshot has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".factory/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"90bdd41371b13ad7a85f3e8400f4282e52b39c62ba0516874f1aa7205f087e6f"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.safe_snapshot (cyclomatic 23): inject-plan.safe_snapshot has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".mastracode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab48d38f9617eb64a9696bbaaadb9a3dbbeb3ba0861813a99dbc5dc848c8ccf"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.safe_snapshot (cyclomatic 23): inject-plan.safe_snapshot has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".opencode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"05cf4f3f484091c9e5d5bfc592196dcf07a73af5777294655b6b812e3041076f"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.safe_snapshot (cyclomatic 23): inject-plan.safe_snapshot has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".pi/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"05980b9e80d7bfcf3b918e61b4e82288ed2fa7bedcca4da5fb67b529c3c07a2f"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.safe_snapshot (cyclomatic 23): inject-plan.safe_snapshot has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-ar/scripts/inject-plan.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce5736db9120ffc4952aaa3913b090ae277b2a44d5b9794853ed6f865bef105"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.safe_snapshot (cyclomatic 23): inject-plan.safe_snapshot has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-de/scripts/inject-plan.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"425778e6b7696ef63bbc622417a3959d4b8e224ef1aa292b06ed3ac384cba5d2"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.safe_snapshot (cyclomatic 23): inject-plan.safe_snapshot has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-es/scripts/inject-plan.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aec23b49c959a88c9f7103e1aa835795af1025f1f3df2d2905dd47cc4657772"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.safe_snapshot (cyclomatic 23): inject-plan.safe_snapshot has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zh/scripts/inject-plan.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"b675e8496fa4c87c61c2226f322d4821d8f16c83e64ed7a59d992a09e0c9db36"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.safe_snapshot (cyclomatic 23): inject-plan.safe_snapshot has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zht/scripts/inject-plan.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2979faa7347cef39291e08b28d0a357b54a5f2962eeb4a3d3660e19eaf466a0"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.safe_snapshot (cyclomatic 23): inject-plan.safe_snapshot has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67f6aeb9874eab35285ed7b35e48f36d374ad79c5135d9466e10ebf498905fb"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.main (cyclomatic 22): session-catchup.main 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":".kiro/skills/planning-with-files/assets/scripts/session-catchup.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"857738a19036de8334d38f93041a48091269fd3be718a43e7377168d052a901e"}},{"ruleId":"D1","level":"warning","message":{"text":"planning_files.extract_current_phase (cyclomatic 21): planning_files.extract_current_phase 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":".hermes/plugins/planning-with-files/planning_files.py"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc9a199b0656a41c06336787c2c5d4033e730df7f7274af9c567a933beafda3"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.main (cyclomatic 20): session-catchup.main 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":".hermes/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"a478b308060af805759eb6d5cebbba3d47a6654640384ede947a7bf38c9730f7"}},{"ruleId":"D1","level":"warning","message":{"text":"planning-with-files.pwf_command (cyclomatic 19): planning-with-files.pwf_command has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/plugins/planning-with-files/__init__.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e9779ee6dde60b0b59870b7fe122f32fa7b2543602aebeaf7a1b23b758987e"}},{"ruleId":"D1","level":"warning","message":{"text":"tools.planning_with_files_select (cyclomatic 19): tools.planning_with_files_select 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":".hermes/plugins/planning-with-files/tools.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"696b53332d50549bfe55e00395b3114b9f51331185c7a06410495b38e04e87ec"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.main (cyclomatic 19): session-catchup.main 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":".mastracode/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"eabce157674d0150cbeea7dfb79b86cc38c9fbb101be37509e0cb265f915d732"}},{"ruleId":"D1","level":"warning","message":{"text":"paths.resolve_plan (cyclomatic 18): paths.resolve_plan 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":".hermes/plugins/planning-with-files/paths.py"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06c9ddf45a870f1727942746039905565d06f4943ce176bd035d5268062d2cb"}},{"ruleId":"D1","level":"warning","message":{"text":"planning_files.phase_counts (cyclomatic 18): planning_files.phase_counts 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":".hermes/plugins/planning-with-files/planning_files.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"81dd3d238dcf99d8d7c73adbbc5c60a395b3dd32a7453a1b6783cbd74821966b"}},{"ruleId":"D1","level":"warning","message":{"text":"sync-ide-folders.main (cyclomatic 18): sync-ide-folders.main 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":".hermes/skills/planning-with-files/scripts/sync-ide-folders.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"07cf3addc3dfa37bf982c9ce86a6edd28ab70141302f257c47158d133b85cc06"}},{"ruleId":"D1","level":"warning","message":{"text":"Injector.prepare_ledger_snapshot (cyclomatic 16): Injector.prepare_ledger_snapshot 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":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e59fbd8e340781a87aca9cf0e0bc00aa92ee90b7a81c308a611eff795c707e"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.main (cyclomatic 16): inject-plan.main 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":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"477e4a8a7b33d74c3a091dfc6c1868b9932543a5453e3dab4251bf9117bad95e"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.main (cyclomatic 16): session-catchup.main 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":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec691f04b0b7864a9d70102bb7f5ea024f259f941d76b06c12c59f2a5db5e5c3"}},{"ruleId":"D1","level":"warning","message":{"text":"Injector.prepare_ledger_snapshot (cyclomatic 16): Injector.prepare_ledger_snapshot 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":".codebuddy/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"669af91b68604fae8533ffb4e4748210eb4b377682ba1dcd44c73d41cd03e561"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.main (cyclomatic 16): inject-plan.main 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":".codebuddy/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd4f8c941eaf18382d32d425aaae549e65d5171454cc1f0325c179028b94fcb"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.main (cyclomatic 16): session-catchup.main 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":".codebuddy/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d2daef10823c50a363a7ea49eb7c137eeff0b490ec0dde28ee58d59bf531be"}},{"ruleId":"D1","level":"warning","message":{"text":"codex_hook_adapter.is_session_attached (cyclomatic 16): codex_hook_adapter.is_session_attached 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":".codex/hooks/codex_hook_adapter.py"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef2aafdfa87bb48b6a4cbc1831d5ca6aa880f36c4c9bb06f24b7f590bcd2635"}},{"ruleId":"D1","level":"warning","message":{"text":"Injector.prepare_ledger_snapshot (cyclomatic 16): Injector.prepare_ledger_snapshot 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":".codex/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7664146c6045c6ff98c4c2eb828bdad4f01bc9b086460ecf683dd3a573e0c18"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.main (cyclomatic 16): inject-plan.main 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":".codex/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c01a03c05062e3c9e7ef3041e437953c2add50887c130f61951155fa90648f9"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.main (cyclomatic 16): session-catchup.main 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":".codex/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3beb6cf56c93e28b12192e67ac6666cbf095497f2864f4b0844c46088c7e3f4"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.main (cyclomatic 16): session-catchup.main 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":".continue/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"440a2a44e9fa20df2c4dc4dc1177c4b07e03875f546ed5fa401355cbbc1dc6a3"}},{"ruleId":"D1","level":"warning","message":{"text":"Injector.prepare_ledger_snapshot (cyclomatic 16): Injector.prepare_ledger_snapshot 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":".cursor/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3f646a866fa61f6057f8b5822b9c3bf5d59eda5a87cc1acb4695c022bbac07"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.main (cyclomatic 16): inject-plan.main 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":".cursor/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ec6c9da8df65a6e74253e162f5b239f803853402c7930d4727eb0549d2a03b"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.main (cyclomatic 16): session-catchup.main 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":".cursor/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a125347a52fe676b10fc7fbca3f9b4ffc4857733e5420119304e14d9a399b0"}},{"ruleId":"D1","level":"warning","message":{"text":"Injector.prepare_ledger_snapshot (cyclomatic 16): Injector.prepare_ledger_snapshot 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":".factory/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"829eb1c4509534faa11afd94f37c4de9578377ad000080b4fec135b91cde2eea"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.main (cyclomatic 16): inject-plan.main 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":".factory/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"647766b9ddb591d0c2fa1407dd851c88654ae93a43305647594f48e31fa16d70"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.main (cyclomatic 16): session-catchup.main 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":".factory/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3fe3d3ec14bcfc8d08ef6cde745c6af150b687ccdc8607acdc7c8288ecc805c"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.main (cyclomatic 16): session-catchup.main 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":".gemini/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64e660f7dd83ae5a92ab8b24f4dfd99cc60d2cc84a7b9422a76dbe4b8550639"}},{"ruleId":"D1","level":"warning","message":{"text":"hooks._successful_file_result (cyclomatic 16): hooks._successful_file_result 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":".hermes/plugins/planning-with-files/hooks.py"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4da66fd0bd7e11482d5e86198db5ea845e481116187a02463ec5e98006c1365"}},{"ruleId":"D1","level":"warning","message":{"text":"Injector.prepare_ledger_snapshot (cyclomatic 16): Injector.prepare_ledger_snapshot 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":".mastracode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2d72eac8ab8677152b7c56263c3472ac1fab3d7564ed61db6f23df06027577"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.main (cyclomatic 16): inject-plan.main 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":".mastracode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b21b5dfcde1eb87fb112fff55d3e25b8fb51ed35ec87a940304b9124ec2776"}},{"ruleId":"D1","level":"warning","message":{"text":"Injector.prepare_ledger_snapshot (cyclomatic 16): Injector.prepare_ledger_snapshot 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":".opencode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc4fc25b1697349dd9cf587c8dcf71ed99163ee2aaaae560e6fd388f717f043"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.main (cyclomatic 16): inject-plan.main 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":".opencode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b75e840480271e0e7ec1cc465c309d61c22d3230b33bdc399bc1c7cb1c166f"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.main (cyclomatic 16): session-catchup.main 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":".opencode/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"3acbeee281eb84630fb250e6eb6cc6ab74389d8cce3e4fb8d63aaac758c0fa20"}},{"ruleId":"D1","level":"warning","message":{"text":"Injector.prepare_ledger_snapshot (cyclomatic 16): Injector.prepare_ledger_snapshot 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":".pi/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d68a5ba0006246bf12166c9498e0a214f96eb33ae2b0934bc0d7ffb67111a6"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.main (cyclomatic 16): inject-plan.main 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":".pi/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04c54331d8c8df6e987c3104da829ed28a1d7f0b0faf6d91f5c0775ef685f4a"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.main (cyclomatic 16): session-catchup.main 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":".pi/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"0103877795efb628d38b2e1f9cfa710049845c2182d283ec4f8268397e841483"}},{"ruleId":"D1","level":"warning","message":{"text":"Injector.prepare_ledger_snapshot (cyclomatic 16): Injector.prepare_ledger_snapshot 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":"skills/i18n/planning-with-files-ar/scripts/inject-plan.py"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0097dea290bbc59214a8091b1b7f9a5b5cf02f7f55e68035e05eff1a9e4500"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.main (cyclomatic 16): inject-plan.main 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":"skills/i18n/planning-with-files-ar/scripts/inject-plan.py"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"f313000d0d9746c0cd5337db79db9f29da5bcd33fa7760f3fd7c647997847e63"}},{"ruleId":"D1","level":"warning","message":{"text":"Injector.prepare_ledger_snapshot (cyclomatic 16): Injector.prepare_ledger_snapshot 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":"skills/i18n/planning-with-files-de/scripts/inject-plan.py"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"62cba7cbcc3789fb75718fa7cd94dd06b9323c3069d8c67e8e76b8494bfd362d"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.main (cyclomatic 16): inject-plan.main 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":"skills/i18n/planning-with-files-de/scripts/inject-plan.py"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb87f86aa055ac69cb0b2b24b44b266e4162f2c0344c9b8ad6c7e4c241b0fac"}},{"ruleId":"D1","level":"warning","message":{"text":"Injector.prepare_ledger_snapshot (cyclomatic 16): Injector.prepare_ledger_snapshot 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":"skills/i18n/planning-with-files-es/scripts/inject-plan.py"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfcd9a0ed03e6586fa982d2e4fd9c1b7ba88b9741ab360ace8ac970504c69ace"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.main (cyclomatic 16): inject-plan.main 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":"skills/i18n/planning-with-files-es/scripts/inject-plan.py"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c86835b9338ad426b2b350cd21be78859c3e011aaf13bd7fc0554abb223f72"}},{"ruleId":"D1","level":"warning","message":{"text":"Injector.prepare_ledger_snapshot (cyclomatic 16): Injector.prepare_ledger_snapshot 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":"skills/i18n/planning-with-files-zh/scripts/inject-plan.py"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"add166bed4e0c47c07b4d5c74989d12c36974e7a95422c8b545674150f87da89"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.main (cyclomatic 16): inject-plan.main 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":"skills/i18n/planning-with-files-zh/scripts/inject-plan.py"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64d97a815d740bdbd36111cb7dfc993b2ee5e1ed56999b0f9d8f2b381853425"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.main (cyclomatic 16): session-catchup.main 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":"skills/i18n/planning-with-files-zh/scripts/session-catchup.py"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ccdfb8d2b32a18ace669dfa2ea4e245549805d4d965eeeccb96a897b5bb28cb"}},{"ruleId":"D1","level":"warning","message":{"text":"Injector.prepare_ledger_snapshot (cyclomatic 16): Injector.prepare_ledger_snapshot 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":"skills/i18n/planning-with-files-zht/scripts/inject-plan.py"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"318d1e1f07f6c64b687388ba695ded6ed528321dfd92ae553449d56cacc02f15"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.main (cyclomatic 16): inject-plan.main 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":"skills/i18n/planning-with-files-zht/scripts/inject-plan.py"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b135a2a7ee662a95281285b6f8e4d361548137649c69238cd0a4077f2464869"}},{"ruleId":"D1","level":"warning","message":{"text":"Injector.prepare_ledger_snapshot (cyclomatic 16): Injector.prepare_ledger_snapshot 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":"skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"0403771fcd32ea6e50135521fa7a9bc59050d600d9abf050a092ff38e0d1e125"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-plan.main (cyclomatic 16): inject-plan.main 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":"skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b2caebfb501e7d8983020227db31900c8a9b32456076a45cd334124e5606d8"}},{"ruleId":"D1","level":"warning","message":{"text":"session-catchup.main (cyclomatic 16): session-catchup.main 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":"skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b36d716f888d43f6bcde07efbb389f41738d6efdf4171e06557a00e460dc98e"}},{"ruleId":"D2","level":"warning","message":{"text":"Injector._run (cognitive 205): Injector._run has cognitive complexity 205 (threshold 15). Drivers by points: if/else 90 (154 pts), boolean chains 15, ternaries 7 (14 pts), error handling 8 (13 pts), loops 4 (9 pts) (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ef7c9b17c00a463816d401a1490002cbd243f0816697eb93ddc786e8288ef2"}},{"ruleId":"D2","level":"warning","message":{"text":"Injector._run (cognitive 205): Injector._run has cognitive complexity 205 (threshold 15). Drivers by points: if/else 90 (154 pts), boolean chains 15, ternaries 7 (14 pts), error handling 8 (13 pts), loops 4 (9 pts) (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codebuddy/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"e357eca40dfe2796ac913f43b23fea5133b04a9559712a01e5470f000dd56023"}},{"ruleId":"D2","level":"warning","message":{"text":"Injector._run (cognitive 205): Injector._run has cognitive complexity 205 (threshold 15). Drivers by points: if/else 90 (154 pts), boolean chains 15, ternaries 7 (14 pts), error handling 8 (13 pts), loops 4 (9 pts) (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"721c6e44995793cffa09d4bc8ef121ab26b62ab141a0d35187f5ef93e212a307"}},{"ruleId":"D2","level":"warning","message":{"text":"Injector._run (cognitive 205): Injector._run has cognitive complexity 205 (threshold 15). Drivers by points: if/else 90 (154 pts), boolean chains 15, ternaries 7 (14 pts), error handling 8 (13 pts), loops 4 (9 pts) (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".cursor/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"bccf798cb0650d50f53fae1cdd271487cce62a9699a699fa117a171172dde4ce"}},{"ruleId":"D2","level":"warning","message":{"text":"Injector._run (cognitive 205): Injector._run has cognitive complexity 205 (threshold 15). Drivers by points: if/else 90 (154 pts), boolean chains 15, ternaries 7 (14 pts), error handling 8 (13 pts), loops 4 (9 pts) (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".factory/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea17eabc83fa894fdbc52211d1ec1c0f324984d95e23db63f4383c5d89a6f89b"}},{"ruleId":"D2","level":"warning","message":{"text":"Injector._run (cognitive 205): Injector._run has cognitive complexity 205 (threshold 15). Drivers by points: if/else 90 (154 pts), boolean chains 15, ternaries 7 (14 pts), error handling 8 (13 pts), loops 4 (9 pts) (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".mastracode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e871859d066656a4c73e11ebdfd0ddb005ad148e36234c5c4e311824aede0e6"}},{"ruleId":"D2","level":"warning","message":{"text":"Injector._run (cognitive 205): Injector._run has cognitive complexity 205 (threshold 15). Drivers by points: if/else 90 (154 pts), boolean chains 15, ternaries 7 (14 pts), error handling 8 (13 pts), loops 4 (9 pts) (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".opencode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd4fb2b512810d7e8a9c838ba18b25f63d6be9b1734362d7ca1561983f850b4"}},{"ruleId":"D2","level":"warning","message":{"text":"Injector._run (cognitive 205): Injector._run has cognitive complexity 205 (threshold 15). Drivers by points: if/else 90 (154 pts), boolean chains 15, ternaries 7 (14 pts), error handling 8 (13 pts), loops 4 (9 pts) (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".pi/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c840166d00465b75fd0c237358a9d5ba6dad416fc24db6fb288807b4c49f67e"}},{"ruleId":"D2","level":"warning","message":{"text":"Injector._run (cognitive 205): Injector._run has cognitive complexity 205 (threshold 15). Drivers by points: if/else 90 (154 pts), boolean chains 15, ternaries 7 (14 pts), error handling 8 (13 pts), loops 4 (9 pts) (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-ar/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d748b6ee8f4a1c8858c8c10e9e17706f9b7a8462063f1ecf78990d4b546d1d"}},{"ruleId":"D2","level":"warning","message":{"text":"Injector._run (cognitive 205): Injector._run has cognitive complexity 205 (threshold 15). Drivers by points: if/else 90 (154 pts), boolean chains 15, ternaries 7 (14 pts), error handling 8 (13 pts), loops 4 (9 pts) (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-de/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"d816bba504a10ca9ecce39a66d612ef32f20e951bf3d9d3a922f422f46e27a52"}},{"ruleId":"D2","level":"warning","message":{"text":"Injector._run (cognitive 205): Injector._run has cognitive complexity 205 (threshold 15). Drivers by points: if/else 90 (154 pts), boolean chains 15, ternaries 7 (14 pts), error handling 8 (13 pts), loops 4 (9 pts) (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-es/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"494f8ce138bb2c869ec6d78f62f89300ae04b12ba003a0174b1979a78c7a91f3"}},{"ruleId":"D2","level":"warning","message":{"text":"Injector._run (cognitive 205): Injector._run has cognitive complexity 205 (threshold 15). Drivers by points: if/else 90 (154 pts), boolean chains 15, ternaries 7 (14 pts), error handling 8 (13 pts), loops 4 (9 pts) (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zh/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"246ab1459c45aba87503e3383ae6420f5981abab5676da245ecbc4c73a27a26c"}},{"ruleId":"D2","level":"warning","message":{"text":"Injector._run (cognitive 205): Injector._run has cognitive complexity 205 (threshold 15). Drivers by points: if/else 90 (154 pts), boolean chains 15, ternaries 7 (14 pts), error handling 8 (13 pts), loops 4 (9 pts) (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zht/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"326dbf1f81fd62bb3f8a1a8965f5bfcf6dd1a825c320443a89266f49f661ee5e"}},{"ruleId":"D2","level":"warning","message":{"text":"Injector._run (cognitive 205): Injector._run has cognitive complexity 205 (threshold 15). Drivers by points: if/else 90 (154 pts), boolean chains 15, ternaries 7 (14 pts), error handling 8 (13 pts), loops 4 (9 pts) (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee25f94261e0286883616daa5d59685317ac7c3485a15694b2d51cf14df165ab"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.extract_messages_after (cognitive 82): session-catchup.extract_messages_after has cognitive complexity 82 (threshold 15). Drivers by points: if/else 17 (63 pts), ternaries 2 (10 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 57). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"9096cf0fd22eb14081236a5644a32d4c3a9bafd8265b0c81a8787cac881bf9af"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.extract_messages_after (cognitive 82): session-catchup.extract_messages_after has cognitive complexity 82 (threshold 15). Drivers by points: if/else 17 (63 pts), ternaries 2 (10 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 57). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codebuddy/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce43cb1093b406c73166245db853681531c98602064ddcab1b38786fb5089e37"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.extract_messages_after (cognitive 82): session-catchup.extract_messages_after has cognitive complexity 82 (threshold 15). Drivers by points: if/else 17 (63 pts), ternaries 2 (10 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 57). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"551992a568bf5751b5b45c3264f1291d6c4f0af3cf3e53a45c919874bea79a49"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.extract_messages_after (cognitive 82): session-catchup.extract_messages_after has cognitive complexity 82 (threshold 15). Drivers by points: if/else 17 (63 pts), ternaries 2 (10 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 57). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".continue/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe647d0f9a30e3b0e5db5417e68014deb1d3b29620c3e316156050056ee3e7ff"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.extract_messages_after (cognitive 82): session-catchup.extract_messages_after has cognitive complexity 82 (threshold 15). Drivers by points: if/else 17 (63 pts), ternaries 2 (10 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 57). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".cursor/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda42036c9b7d9c5f0f0b5ed9becf20aa9c201a3b264670f58815c41b736cc48"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.extract_messages_after (cognitive 82): session-catchup.extract_messages_after has cognitive complexity 82 (threshold 15). Drivers by points: if/else 17 (63 pts), ternaries 2 (10 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 57). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".factory/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0f88d9f1f160ac2a960cac847f06152b0fe7c0558faa83956452090e9730ad"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.extract_messages_after (cognitive 82): session-catchup.extract_messages_after has cognitive complexity 82 (threshold 15). Drivers by points: if/else 17 (63 pts), ternaries 2 (10 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 57). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".gemini/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"567500e6af8b327e9725c17cb6c4b1687189a0121d106226fb99eb43c1d0e51f"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.extract_messages_after (cognitive 82): session-catchup.extract_messages_after has cognitive complexity 82 (threshold 15). Drivers by points: if/else 17 (63 pts), ternaries 2 (10 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 57). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".pi/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"103d6dfef0fa5d6aa0476ed4c987a61f02af1ea1aaf0713176e5ae090fdc673f"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.extract_messages_after (cognitive 82): session-catchup.extract_messages_after has cognitive complexity 82 (threshold 15). Drivers by points: if/else 17 (63 pts), ternaries 2 (10 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 57). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zh/scripts/session-catchup.py"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b2a3d9eea9e360a507d29487a775655d0c812acb35482e31fb591df1f6df10"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.extract_messages_after (cognitive 82): session-catchup.extract_messages_after has cognitive complexity 82 (threshold 15). Drivers by points: if/else 17 (63 pts), ternaries 2 (10 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 57). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad7400857eb3a3767a87db0f50971c51d36d6f90bcccef4d0c3e4f10ea17463"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.extract_messages_after (cognitive 76): session-catchup.extract_messages_after has cognitive complexity 76 (threshold 15). Drivers by points: if/else 17 (63 pts), loops 2 (5 pts), boolean chains 4, ternaries 1 (4 pts) (nesting depth added 52). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".opencode/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f961b91bca19c17fc554f68537a4dc1dd8ab1b743f2ebccb01fc6ada4d35c6"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.extract_messages_after (cognitive 76): session-catchup.extract_messages_after has cognitive complexity 76 (threshold 15). Drivers by points: if/else 17 (63 pts), loops 2 (5 pts), boolean chains 4, ternaries 1 (4 pts) (nesting depth added 52). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-ar/scripts/session-catchup.py"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba211a3f5aadead102545a67464233b1f25aced0d4e215b7523c8e0df64df121"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.extract_messages_after (cognitive 76): session-catchup.extract_messages_after has cognitive complexity 76 (threshold 15). Drivers by points: if/else 17 (63 pts), loops 2 (5 pts), boolean chains 4, ternaries 1 (4 pts) (nesting depth added 52). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-de/scripts/session-catchup.py"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d29973412c3db4e0b4429c33c6c973c33c52a41e937e01c255089c41b961155"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.extract_messages_after (cognitive 76): session-catchup.extract_messages_after has cognitive complexity 76 (threshold 15). Drivers by points: if/else 17 (63 pts), loops 2 (5 pts), boolean chains 4, ternaries 1 (4 pts) (nesting depth added 52). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-es/scripts/session-catchup.py"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb59a450421a9219026cb19c760819b2679f9c3ff1afea53e3c35982c0de1b1"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.extract_messages_after (cognitive 76): session-catchup.extract_messages_after has cognitive complexity 76 (threshold 15). Drivers by points: if/else 17 (63 pts), loops 2 (5 pts), boolean chains 4, ternaries 1 (4 pts) (nesting depth added 52). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zht/scripts/session-catchup.py"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc94335f7bb978d6a58b65cf45e17ee9e077c3f2c9c300c9479fd51d90202bf"}},{"ruleId":"D2","level":"warning","message":{"text":"hooks._auto_bind (cognitive 64): hooks._auto_bind has cognitive complexity 64 (threshold 15). Drivers by points: if/else 20 (43 pts), boolean chains 9, loops 4 (7 pts), error handling 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/plugins/planning-with-files/hooks.py"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f99cc9bd127935f803113254211e4ba73e80673e19c942f190c64bbefed6190"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.extract_messages_from_session (cognitive 62): session-catchup.extract_messages_from_session has cognitive complexity 62 (threshold 15). Drivers by points: if/else 12 (41 pts), loops 3 (9 pts), boolean chains 5, ternaries 1 (4 pts), error handling 2 (3 pts) (nesting depth added 39). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03772b1b7453dc3cb2c78b84e8a174a6871b60fa2aa72e298a23639d9f0a64c"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.smart_plan_extract (cognitive 59): inject-plan.smart_plan_extract has cognitive complexity 59 (threshold 15). Drivers by points: if/else 23 (45 pts), boolean chains 10, loops 2 (3 pts), ternaries 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de354635e25f82f7d2d3768697db85e081f620800f140d363db0f47b0f2973c"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.smart_plan_extract (cognitive 59): inject-plan.smart_plan_extract has cognitive complexity 59 (threshold 15). Drivers by points: if/else 23 (45 pts), boolean chains 10, loops 2 (3 pts), ternaries 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codebuddy/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2102d66556c195212e9c3625694e8c48d2dd6f8364433cfe82134ecf1aca448"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.smart_plan_extract (cognitive 59): inject-plan.smart_plan_extract has cognitive complexity 59 (threshold 15). Drivers by points: if/else 23 (45 pts), boolean chains 10, loops 2 (3 pts), ternaries 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa882e8fbf611bf57781b9d3bf0f34ee1b2f09601c1043211262ed7cf835bca6"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.smart_plan_extract (cognitive 59): inject-plan.smart_plan_extract has cognitive complexity 59 (threshold 15). Drivers by points: if/else 23 (45 pts), boolean chains 10, loops 2 (3 pts), ternaries 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".cursor/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f2518cf5ed8d50fafeba5fea02dab1cdbb5ce3865ab37ad18fdc7ccac4bb77"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.smart_plan_extract (cognitive 59): inject-plan.smart_plan_extract has cognitive complexity 59 (threshold 15). Drivers by points: if/else 23 (45 pts), boolean chains 10, loops 2 (3 pts), ternaries 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".factory/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a589598fdc42e0efa307848a1dc0e21231806554724c1b3a9e6f872e3d88c41"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.smart_plan_extract (cognitive 59): inject-plan.smart_plan_extract has cognitive complexity 59 (threshold 15). Drivers by points: if/else 23 (45 pts), boolean chains 10, loops 2 (3 pts), ternaries 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".mastracode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a96dfc6ec97f979aaa628901e4af627e63fa197cdaa15685f1a58bfbe91cf8d"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.smart_plan_extract (cognitive 59): inject-plan.smart_plan_extract has cognitive complexity 59 (threshold 15). Drivers by points: if/else 23 (45 pts), boolean chains 10, loops 2 (3 pts), ternaries 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".opencode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"982aec89dad1c5464688efdcc20b2cf128927463f693c20ee8265d6bb10f207d"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.smart_plan_extract (cognitive 59): inject-plan.smart_plan_extract has cognitive complexity 59 (threshold 15). Drivers by points: if/else 23 (45 pts), boolean chains 10, loops 2 (3 pts), ternaries 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".pi/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"79bba057ec3b46b644b45344dad587a3f7b3353a841301a6759f0b31e8aad1bd"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.smart_plan_extract (cognitive 59): inject-plan.smart_plan_extract has cognitive complexity 59 (threshold 15). Drivers by points: if/else 23 (45 pts), boolean chains 10, loops 2 (3 pts), ternaries 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-ar/scripts/inject-plan.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5b61f5f2e623cab9641b7bbdc265f34d69470240ec4053a2147ade8264b9ed"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.smart_plan_extract (cognitive 59): inject-plan.smart_plan_extract has cognitive complexity 59 (threshold 15). Drivers by points: if/else 23 (45 pts), boolean chains 10, loops 2 (3 pts), ternaries 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-de/scripts/inject-plan.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8aff7bd1c5298533d64a7461f95fa370569317818287406c31dfb11cbbda03a"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.smart_plan_extract (cognitive 59): inject-plan.smart_plan_extract has cognitive complexity 59 (threshold 15). Drivers by points: if/else 23 (45 pts), boolean chains 10, loops 2 (3 pts), ternaries 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-es/scripts/inject-plan.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c5e281a0cba7aa2102e4c89d106d8b3d4121021c73510eb80fd20f2ba55100"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.smart_plan_extract (cognitive 59): inject-plan.smart_plan_extract has cognitive complexity 59 (threshold 15). Drivers by points: if/else 23 (45 pts), boolean chains 10, loops 2 (3 pts), ternaries 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zh/scripts/inject-plan.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"682f82088ceaab693cacab71bf7338cf8f7287dcf5a27ed43706bb6d98a2b8d5"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.smart_plan_extract (cognitive 59): inject-plan.smart_plan_extract has cognitive complexity 59 (threshold 15). Drivers by points: if/else 23 (45 pts), boolean chains 10, loops 2 (3 pts), ternaries 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zht/scripts/inject-plan.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f2f019cef4535b18eaf503725e29fdd69f7ffc1008ed41b677fcdc8bbd7e67"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.smart_plan_extract (cognitive 59): inject-plan.smart_plan_extract has cognitive complexity 59 (threshold 15). Drivers by points: if/else 23 (45 pts), boolean chains 10, loops 2 (3 pts), ternaries 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b2e30374fea110a9bb898dc52ad4a3df8ef3db7e0c7094f10ec8ce977f5bc4"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.extract_messages_after (cognitive 58): session-catchup.extract_messages_after has cognitive complexity 58 (threshold 15). Drivers by points: if/else 12 (41 pts), loops 3 (9 pts), boolean chains 4, ternaries 1 (4 pts) (nesting depth added 38). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".mastracode/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec3f7c1380fc62b7264ff348e3052ec581d3093441f017b73a92679b26390a7"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.resolve_plan_dir (cognitive 54): inject-plan.resolve_plan_dir has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (43 pts), error handling 2 (4 pts), boolean chains 3, loops 1 (2 pts), ternaries 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa855f8b2c559a8fda40e1d3cd1e1f66f77789952a733bc19f8799cb7f68333"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.resolve_plan_dir (cognitive 54): inject-plan.resolve_plan_dir has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (43 pts), error handling 2 (4 pts), boolean chains 3, loops 1 (2 pts), ternaries 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codebuddy/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"141252188dd25567876f183abd57973bf1d9c8e9d415920b8fce74e6475e2379"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.resolve_plan_dir (cognitive 54): inject-plan.resolve_plan_dir has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (43 pts), error handling 2 (4 pts), boolean chains 3, loops 1 (2 pts), ternaries 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd036f8e28b58c1b85a1cde0c682ea8af2dd328dddebac9ea778547f5e11ccd3"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.resolve_plan_dir (cognitive 54): inject-plan.resolve_plan_dir has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (43 pts), error handling 2 (4 pts), boolean chains 3, loops 1 (2 pts), ternaries 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".cursor/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c0bfce6d866009d2b2ef491c9856362ca8ac6a68f987d9929d2ef7b9c0db22"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.resolve_plan_dir (cognitive 54): inject-plan.resolve_plan_dir has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (43 pts), error handling 2 (4 pts), boolean chains 3, loops 1 (2 pts), ternaries 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".factory/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0d6044fc2a87b1c0e25fbe081c2adfa0cf14d12d831945edc49960dd2992ae"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.resolve_plan_dir (cognitive 54): inject-plan.resolve_plan_dir has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (43 pts), error handling 2 (4 pts), boolean chains 3, loops 1 (2 pts), ternaries 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".mastracode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed24a500baa311f81aba9008846b6dde9e6afa610ad2280ccc38a24f41b5f4c"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.resolve_plan_dir (cognitive 54): inject-plan.resolve_plan_dir has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (43 pts), error handling 2 (4 pts), boolean chains 3, loops 1 (2 pts), ternaries 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".opencode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1405420182fad29e2382e4decd2e46e25c57bff57875fb0d695f0ab53dbe92"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.resolve_plan_dir (cognitive 54): inject-plan.resolve_plan_dir has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (43 pts), error handling 2 (4 pts), boolean chains 3, loops 1 (2 pts), ternaries 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".pi/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"189368c5a07b4448b481e10c6da70f375fcbf182702cf32f8b3889572c1a2fbe"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.resolve_plan_dir (cognitive 54): inject-plan.resolve_plan_dir has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (43 pts), error handling 2 (4 pts), boolean chains 3, loops 1 (2 pts), ternaries 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-ar/scripts/inject-plan.py"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd96df7f3f87cdb351b10608a32f5fafa259428cbed05c6320cdc6e1bcd69db"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.resolve_plan_dir (cognitive 54): inject-plan.resolve_plan_dir has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (43 pts), error handling 2 (4 pts), boolean chains 3, loops 1 (2 pts), ternaries 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-de/scripts/inject-plan.py"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea313015a4b84fe22aa6a017fe15e8b90f75cb60ce7fc00d145c86f0b1f098b4"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.resolve_plan_dir (cognitive 54): inject-plan.resolve_plan_dir has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (43 pts), error handling 2 (4 pts), boolean chains 3, loops 1 (2 pts), ternaries 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-es/scripts/inject-plan.py"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f0d438197445ec9c034ad07a1a4418ee1a8cbad7cbc86a1eb75e7da4b82e9c"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.resolve_plan_dir (cognitive 54): inject-plan.resolve_plan_dir has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (43 pts), error handling 2 (4 pts), boolean chains 3, loops 1 (2 pts), ternaries 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zh/scripts/inject-plan.py"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"40df6bba689f8e374c7d69069e5725db1cbb4a4650f2f206eea384cf8bc96430"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.resolve_plan_dir (cognitive 54): inject-plan.resolve_plan_dir has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (43 pts), error handling 2 (4 pts), boolean chains 3, loops 1 (2 pts), ternaries 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zht/scripts/inject-plan.py"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"387187429f404ac9d814f03652234b53d4a1bc9867d7849c411a2ecbc6132cb1"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.resolve_plan_dir (cognitive 54): inject-plan.resolve_plan_dir has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (43 pts), error handling 2 (4 pts), boolean chains 3, loops 1 (2 pts), ternaries 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"d01279bd56757f502bdbad8c695eb8528de439253a3b1ee156cbcf7b313103b5"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.opencode_catchup (cognitive 47): session-catchup.opencode_catchup has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 6 (8 pts), error handling 4 (7 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"193f39667baa34156f792a2342b07665de155bdfd218a6bc8f215f928320a3a4"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.opencode_catchup (cognitive 47): session-catchup.opencode_catchup has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 6 (8 pts), error handling 4 (7 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codebuddy/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bce463dc9830903fa91989ae90f26be7ee5e02d77e46378988f88ed6d0fb797"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.opencode_catchup (cognitive 47): session-catchup.opencode_catchup has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 6 (8 pts), error handling 4 (7 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a84aba3a704567eeeb4f0f73d93caf6b644d8277676ebe190070edc7a626ca"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.opencode_catchup (cognitive 47): session-catchup.opencode_catchup has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 6 (8 pts), error handling 4 (7 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".continue/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"5641c313c05e374fff5104286c3aad9d612526a12147a0503a5624c7f98c6bae"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.opencode_catchup (cognitive 47): session-catchup.opencode_catchup has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 6 (8 pts), error handling 4 (7 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".cursor/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c3e73f66d1c6cba8796bd2bb9ba00b28a4b40f5803a952b6887966dab4a94b"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.opencode_catchup (cognitive 47): session-catchup.opencode_catchup has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 6 (8 pts), error handling 4 (7 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".factory/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca542671707480c140ef56dde3da3142207db8a74c3b27a498af47c78db2457a"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.opencode_catchup (cognitive 47): session-catchup.opencode_catchup has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 6 (8 pts), error handling 4 (7 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".gemini/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a081281caef7527353d8ba05500cc8fcacedce2506aacaba30b32436d3e32f"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.main (cognitive 47): session-catchup.main has cognitive complexity 47 (threshold 15). Drivers by points: if/else 12 (33 pts), loops 3 (8 pts), ternaries 2 (4 pts), boolean chains 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":".kiro/skills/planning-with-files/assets/scripts/session-catchup.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8c7cc80cbe209a0147ba2177e2705900557e1141106d3555037b3f4288509e"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.opencode_catchup (cognitive 47): session-catchup.opencode_catchup has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 6 (8 pts), error handling 4 (7 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".opencode/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b9d8146e723ba70a633156f35e58727860b6e03d326cb98fe4d7d2acda9060"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.opencode_catchup (cognitive 47): session-catchup.opencode_catchup has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 6 (8 pts), error handling 4 (7 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".pi/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"3403366667fe7869caf6da09950fc163343029104961a78384cdcde664201089"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.opencode_catchup (cognitive 47): session-catchup.opencode_catchup has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 6 (8 pts), error handling 4 (7 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zh/scripts/session-catchup.py"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"1234e3b10562e035e30a610683c5154c7a59688fd65bf1c4ecb06cd3229d3daa"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.opencode_catchup (cognitive 47): session-catchup.opencode_catchup has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 6 (8 pts), error handling 4 (7 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d60d560392299f79fd4d787aabeaf84950110569cdd06518b9775d98922d838"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.secure_progress_marker (cognitive 44): inject-plan.secure_progress_marker has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (28 pts), error handling 4 (7 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"288ffdce32bc491db11768179cf0281ddb56b10c306c62ed49077c8163a6509a"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.secure_progress_marker (cognitive 44): inject-plan.secure_progress_marker has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (28 pts), error handling 4 (7 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codebuddy/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"09673d10c8ada3f42c3c4d66e744560ac97eed819f932e9d4049a1739b9f7404"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.secure_progress_marker (cognitive 44): inject-plan.secure_progress_marker has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (28 pts), error handling 4 (7 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"7817846ea4583d0507f43f53efc42d27d6fac1ca120cfb26b939e9fd018fac9e"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.secure_progress_marker (cognitive 44): inject-plan.secure_progress_marker has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (28 pts), error handling 4 (7 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".cursor/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"8331e0e1000775a0575e8177d90fe79e03be97f36ddbbd5774928e528245c58b"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.secure_progress_marker (cognitive 44): inject-plan.secure_progress_marker has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (28 pts), error handling 4 (7 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".factory/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"5075d4cec977817216ed697ec01fb04b3cc9b58f25292068267746d83dab093f"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.secure_progress_marker (cognitive 44): inject-plan.secure_progress_marker has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (28 pts), error handling 4 (7 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".mastracode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"3447494c5334df8b2b139ec08bf2095a84067a8b9e909913c3d4682b0ce70469"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.secure_progress_marker (cognitive 44): inject-plan.secure_progress_marker has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (28 pts), error handling 4 (7 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".opencode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e700e2c4f83938bfa73336d28856b068e0a7b4f0b47230579e1d0eca52f8d4"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.secure_progress_marker (cognitive 44): inject-plan.secure_progress_marker has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (28 pts), error handling 4 (7 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".pi/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cfaf4d7695d1a83fbf4271c671130ffd767251bb4480593618846252eb9a92d"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.secure_progress_marker (cognitive 44): inject-plan.secure_progress_marker has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (28 pts), error handling 4 (7 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-ar/scripts/inject-plan.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e9af20a304202aeedbac929275781f8a40a2154a2410dea118b64b8ea5bf5d"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.secure_progress_marker (cognitive 44): inject-plan.secure_progress_marker has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (28 pts), error handling 4 (7 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-de/scripts/inject-plan.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfeed63e4f65a30174e4043022b9ef078aacc96cb6936ebd3c1c7e8bee9f1411"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.secure_progress_marker (cognitive 44): inject-plan.secure_progress_marker has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (28 pts), error handling 4 (7 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-es/scripts/inject-plan.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c421e5a99abd82a6dd4b4b9004eca5d395d237c38a55eac4b9f7a5cc8fcbf62"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.secure_progress_marker (cognitive 44): inject-plan.secure_progress_marker has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (28 pts), error handling 4 (7 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zh/scripts/inject-plan.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed48fa38cdb5f9cd4448b539c6f889a8d4b9d1e937787855bfbb751b825b7dc4"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.secure_progress_marker (cognitive 44): inject-plan.secure_progress_marker has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (28 pts), error handling 4 (7 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zht/scripts/inject-plan.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a4be3822fb669ff2a1af997a07ac66156e3d851612c295140c20ee2f9a07b8"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.secure_progress_marker (cognitive 44): inject-plan.secure_progress_marker has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (28 pts), error handling 4 (7 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb9fed06d471fd5e5df795faedc7c68493292ecbef356c8b553e296699bf548"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.find_last_planning_update (cognitive 43): session-catchup.find_last_planning_update has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (38 pts), loops 2 (5 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"08171ea283823b2e5463f5877f9a65444b4f5336c6b1785a93c6da541b415128"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.find_last_planning_update (cognitive 43): session-catchup.find_last_planning_update has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (38 pts), loops 2 (5 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codebuddy/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"c693570f3c87201f8bbda7ac5b24e15fe6bb7504d4685b5a5e811eac046ac09b"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.find_last_planning_update (cognitive 43): session-catchup.find_last_planning_update has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (38 pts), loops 2 (5 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e005a2fe2fee8a4dc8d013d74884d39bbc26d4b8a01b42e7eb85686f1b9294"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.find_last_planning_update (cognitive 43): session-catchup.find_last_planning_update has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (38 pts), loops 2 (5 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".continue/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d667784867010e5e4412444d1cd248bb4f9eaeab5a655536d8bdce9b57872b"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.find_last_planning_update (cognitive 43): session-catchup.find_last_planning_update has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (38 pts), loops 2 (5 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".cursor/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"245de704d5ed0b34d9973be33126bf425db02eb230ec5d3af146aeea153467d6"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.find_last_planning_update (cognitive 43): session-catchup.find_last_planning_update has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (38 pts), loops 2 (5 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".factory/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"02287896cdabebe58911c6a987cae01baab422461aeff0ea1a8932324b437c75"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.find_last_planning_update (cognitive 43): session-catchup.find_last_planning_update has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (38 pts), loops 2 (5 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".gemini/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca98225a0b14d816726010b106e9151ba44933bac8e4dfb9333889b78c8d90e7"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.find_last_planning_update (cognitive 43): session-catchup.find_last_planning_update has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (38 pts), loops 2 (5 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".opencode/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"844efa7b3f840ef07ddb3a4001f32d69d363db69df9012b9d110fa52a48d77da"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.find_last_planning_update (cognitive 43): session-catchup.find_last_planning_update has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (38 pts), loops 2 (5 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".pi/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e64c5c34a7f40fc99e485a6511d6cb29f28a8ee5b5e6afbbb1ae452c2835ed"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.find_last_planning_update (cognitive 43): session-catchup.find_last_planning_update has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (38 pts), loops 2 (5 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-ar/scripts/session-catchup.py"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"42840e9c4241af2e49c0beb778d6c69395f7bcd50de975bfd063218ea41ffef9"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.find_last_planning_update (cognitive 43): session-catchup.find_last_planning_update has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (38 pts), loops 2 (5 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-de/scripts/session-catchup.py"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c67266e5db1a51c9dde7a982560f27d9a173dad576aa33d7a795871dbe5787"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.find_last_planning_update (cognitive 43): session-catchup.find_last_planning_update has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (38 pts), loops 2 (5 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-es/scripts/session-catchup.py"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04f8db2e08680142ef40a85d55d4abb6ce19ee2eadbeba8aa1899276a778299"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.find_last_planning_update (cognitive 43): session-catchup.find_last_planning_update has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (38 pts), loops 2 (5 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zh/scripts/session-catchup.py"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7cc1c65737674c0db6fe441c43cea0c2d0ef5871e49c87024bdd82de07d114f"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.find_last_planning_update (cognitive 43): session-catchup.find_last_planning_update has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (38 pts), loops 2 (5 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zht/scripts/session-catchup.py"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"026961656add197de3f3249d1ec9affbcb1ae6bab2196a763a4cd7649223e858"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.find_last_planning_update (cognitive 43): session-catchup.find_last_planning_update has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (38 pts), loops 2 (5 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc49f536c957580339eadaf7887c150a57bf6d1bdbb914c68d24185f9b68887d"}},{"ruleId":"D2","level":"warning","message":{"text":"planning_files.extract_current_phase (cognitive 39): planning_files.extract_current_phase has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 5 (8 pts), boolean chains 5 (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":".hermes/plugins/planning-with-files/planning_files.py"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd62816ceb17554760265898a0ca8d78eb726366f2746ca42639e9a090a540a1"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.safe_snapshot (cognitive 34): inject-plan.safe_snapshot has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 4, loops 3 (4 pts), error handling 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":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d0e1b08abcc1113208fdb5f913049731249005401ebe9672eff917146b4f7d9"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.safe_snapshot (cognitive 34): inject-plan.safe_snapshot has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 4, loops 3 (4 pts), error handling 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":".codebuddy/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5187459ca614213290fefe25666d08d3b80141d40188bc13313ffdf04dc7ae0"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.safe_snapshot (cognitive 34): inject-plan.safe_snapshot has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 4, loops 3 (4 pts), error handling 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":".codex/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc149ac65ab41e98b857e4213638b0feef3567d20bd826376d3252c2a8a563b"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.safe_snapshot (cognitive 34): inject-plan.safe_snapshot has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 4, loops 3 (4 pts), error handling 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":".cursor/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08c707e72671b21026c05f778abf4e45b90de2e266d92a6a381b8d9a01671fc"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.safe_snapshot (cognitive 34): inject-plan.safe_snapshot has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 4, loops 3 (4 pts), error handling 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":".factory/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cacd51bef8afc084bce0c0ff7ab7b9248924c4c075c56faadba0fecf5d56434"}},{"ruleId":"D2","level":"warning","message":{"text":"paths.resolve_plan (cognitive 34): paths.resolve_plan has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (22 pts), error handling 2 (7 pts), loops 1 (3 pts), 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":".hermes/plugins/planning-with-files/paths.py"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"773f04a69d48d8701532d41964938be09d560c41e9b69bc6ba973d0dbd3dcbc8"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.safe_snapshot (cognitive 34): inject-plan.safe_snapshot has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 4, loops 3 (4 pts), error handling 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":".mastracode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d36a51a4cf9de24807e09f43ba5f6990102f87a790aa95ef66274e6680398c7"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.safe_snapshot (cognitive 34): inject-plan.safe_snapshot has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 4, loops 3 (4 pts), error handling 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":".opencode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d53ce87a45f6ddf89599336cd524bf90b6f066b0ebe17b22773c7a1756810e"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.safe_snapshot (cognitive 34): inject-plan.safe_snapshot has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 4, loops 3 (4 pts), error handling 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":".pi/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"be863bc61f8e8a390d8cb6d0e0d09465da7e55017858034777fea6ab6e7f6d0a"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.safe_snapshot (cognitive 34): inject-plan.safe_snapshot has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 4, loops 3 (4 pts), error handling 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":"skills/i18n/planning-with-files-ar/scripts/inject-plan.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"566fe92c1742b1b3d2ac1c9f27aaf46307d188ebeed4a90725352d520e6cf021"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.safe_snapshot (cognitive 34): inject-plan.safe_snapshot has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 4, loops 3 (4 pts), error handling 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":"skills/i18n/planning-with-files-de/scripts/inject-plan.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf30e94f2e841d5a3bb23d8a96bcdcb630bd58f817bc5ecc2795c887b2fc531"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.safe_snapshot (cognitive 34): inject-plan.safe_snapshot has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 4, loops 3 (4 pts), error handling 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":"skills/i18n/planning-with-files-es/scripts/inject-plan.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"98bf9cebb03c3082fcd12019359310b5a9b2814a3675c66f9413a11c1ffc5af3"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.safe_snapshot (cognitive 34): inject-plan.safe_snapshot has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 4, loops 3 (4 pts), error handling 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":"skills/i18n/planning-with-files-zh/scripts/inject-plan.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d923515d5a4fee1920990d21b011cc8738967eaef15d849902626b756867c9"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.safe_snapshot (cognitive 34): inject-plan.safe_snapshot has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 4, loops 3 (4 pts), error handling 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":"skills/i18n/planning-with-files-zht/scripts/inject-plan.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc376a729f22fae0327326b7afd9fa3a5543ef4056dc2763945fb2361be369c4"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.safe_snapshot (cognitive 34): inject-plan.safe_snapshot has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 4, loops 3 (4 pts), error handling 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":"skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c77cbd6616a4fa59a1a29c95cbb4f2b7b75f100ee54334a8f434660ea21a4f1"}},{"ruleId":"D2","level":"warning","message":{"text":"sync-ide-folders.main (cognitive 33): sync-ide-folders.main has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 2 (3 pts), boolean chains 2, ternaries 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/skills/planning-with-files/scripts/sync-ide-folders.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9d1afc7ffce9c8f3e777b2a92bb9f8838236e68e8adb32b7ea1b9b9aaaa6b2"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.pretool_cache (cognitive 31): inject-plan.pretool_cache has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 8, error handling 2 (3 pts), loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada34eb969c2cd7041b2adb32aad4efc17cf6bfacf49d82f6ac946763fca8ccb"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.pretool_cache (cognitive 31): inject-plan.pretool_cache has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 8, error handling 2 (3 pts), loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codebuddy/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee05db85fabef53a8a5acee2569dc37d16d1aeeb9ed8b731cd7950c5d10fa096"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.pretool_cache (cognitive 31): inject-plan.pretool_cache has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 8, error handling 2 (3 pts), loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38def0ea8decf7938c461ebc7c610dd0a8e20eec789cab4f75cec8780bff5df"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.pretool_cache (cognitive 31): inject-plan.pretool_cache has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 8, error handling 2 (3 pts), loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".cursor/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f54ba7aee53211c67d8dc2d3de19247211e3bbecca60c559a9d9237d3192bda"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.pretool_cache (cognitive 31): inject-plan.pretool_cache has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 8, error handling 2 (3 pts), loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".factory/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3aba80b4a054f59785d04ea81b9af800311a234d32a15e1b9ec3530e42154c"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.pretool_cache (cognitive 31): inject-plan.pretool_cache has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 8, error handling 2 (3 pts), loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".mastracode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"790ab3d9c823aa6550d6d871de4e89fc0b311d16ee9ddd8a869ceebf4fe08524"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.pretool_cache (cognitive 31): inject-plan.pretool_cache has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 8, error handling 2 (3 pts), loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".opencode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8f1addb77b59276822dae43c7c0bcdf079d086dcfdab42b4786bb2d763cdf5"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.pretool_cache (cognitive 31): inject-plan.pretool_cache has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 8, error handling 2 (3 pts), loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".pi/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"056e2ad1e978b93091a3b2564152b82e7ba9e9d2dddf875faf977266aaa7f8cf"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.pretool_cache (cognitive 31): inject-plan.pretool_cache has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 8, error handling 2 (3 pts), loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-ar/scripts/inject-plan.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee00e195fee6e8171d5eb10d58e43b6486293a5b6c16ee9817b98bb64d2f2dc"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.pretool_cache (cognitive 31): inject-plan.pretool_cache has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 8, error handling 2 (3 pts), loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-de/scripts/inject-plan.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"c812faa60e7c0c64b3f1194f6a251a438cb728f292e258b526c6a377d22409d6"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.pretool_cache (cognitive 31): inject-plan.pretool_cache has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 8, error handling 2 (3 pts), loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-es/scripts/inject-plan.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2604eeeb7c40335e88fd762fde8e48cea1a72a320258c2e168fa35c81329846"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.pretool_cache (cognitive 31): inject-plan.pretool_cache has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 8, error handling 2 (3 pts), loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zh/scripts/inject-plan.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dbe9b232f233f2638675295b6791d6b3d34113ac4c25c10dfd6aa286b69d74b"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.pretool_cache (cognitive 31): inject-plan.pretool_cache has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 8, error handling 2 (3 pts), loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zht/scripts/inject-plan.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c3c42b222dd4ef4f2a6dd350b95b8c08cf604f5333c4f8592f59006e4f299f8"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.pretool_cache (cognitive 31): inject-plan.pretool_cache has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 8, error handling 2 (3 pts), loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dcdbc959c7909f016b1ccb4f8f404f94fdc5ceebe7f8f7560d807b2b5231250"}},{"ruleId":"D2","level":"warning","message":{"text":"tools.planning_with_files_select (cognitive 30): tools.planning_with_files_select has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (19 pts), ternaries 3 (5 pts), error handling 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/plugins/planning-with-files/tools.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4787a909cab2cdc7c67127c591be9a68fdf534cb006f381bbc0be8fa05ec214"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.main (cognitive 28): session-catchup.main has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (24 pts), loops 3, 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":".hermes/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bca5527716908f039bc62874b2e7705be4568accf7699317f03defe73210587"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.find_last_planning_update (cognitive 28): session-catchup.find_last_planning_update has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (23 pts), loops 2 (5 pts) (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".mastracode/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"68783037f020ef49449195e109a01fd4d722003ef94a542ef7db19bac01874b9"}},{"ruleId":"D2","level":"warning","message":{"text":"planning_files.phase_counts (cognitive 27): planning_files.phase_counts has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/plugins/planning-with-files/planning_files.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"9489152a7262c15db5e8495a534d98a380af54b8211f8bae022347bc3fa84a03"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.main (cognitive 26): session-catchup.main has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (23 pts), loops 2, 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":".mastracode/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1232d96772fa05a4f5de3299b3d95367e40e551bb1217d440c694237889ab3"}},{"ruleId":"D2","level":"warning","message":{"text":"context_frame.verified_frame (cognitive 25): context_frame.verified_frame has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 2 (6 pts), boolean chains 3, error handling 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/hooks/context_frame.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d7d460d217a0dba30051ed85375ad2637eaf759388cec8186a7f43c9391c57"}},{"ruleId":"D2","level":"warning","message":{"text":"context_frame.verified_frame (cognitive 25): context_frame.verified_frame has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 2 (6 pts), boolean chains 3, error handling 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/plugins/planning-with-files/context_frame.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"da94ab5b7d9b7a37847a8eaab3598a0abc151505dddc1ee05149159aff066fca"}},{"ruleId":"D2","level":"warning","message":{"text":"shell_hook.handle (cognitive 25): shell_hook.handle has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, error handling 1 (4 pts), loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/plugins/planning-with-files/shell_hook.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4740bbeb7f8d9b6e128bfcb17775c4c32270ab6d9511e9ea106e94a52f293c"}},{"ruleId":"D2","level":"warning","message":{"text":"Injector.prepare_ledger_snapshot (cognitive 23): Injector.prepare_ledger_snapshot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 3, boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"8992dab01e32749c81e42699f4efb8189300f685e648731ecd2e1a77896db083"}},{"ruleId":"D2","level":"warning","message":{"text":"Injector.prepare_ledger_snapshot (cognitive 23): Injector.prepare_ledger_snapshot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 3, boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codebuddy/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"3658a530aca9ede3360554429cc7f567bce0f259d8001f4df802ca93a5775216"}},{"ruleId":"D2","level":"warning","message":{"text":"Injector.prepare_ledger_snapshot (cognitive 23): Injector.prepare_ledger_snapshot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 3, boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5cd2558df8f3715a23d73ff053b72c5360d709d04b8c2fa7e8728cf87247690"}},{"ruleId":"D2","level":"warning","message":{"text":"Injector.prepare_ledger_snapshot (cognitive 23): Injector.prepare_ledger_snapshot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 3, boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".cursor/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde2148d51614326cbf18429435b336bb08883dd1832def041f0d35fef09e03d"}},{"ruleId":"D2","level":"warning","message":{"text":"Injector.prepare_ledger_snapshot (cognitive 23): Injector.prepare_ledger_snapshot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 3, boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".factory/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48c10529706b94ab74f48ac720ce9d4237059f07d67ba2a9a2063502f850c53"}},{"ruleId":"D2","level":"warning","message":{"text":"Injector.prepare_ledger_snapshot (cognitive 23): Injector.prepare_ledger_snapshot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 3, boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".mastracode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff39beeccba14a42ec4e02b1b259d00a3f06738145aeb8356c3f933f0ec82153"}},{"ruleId":"D2","level":"warning","message":{"text":"Injector.prepare_ledger_snapshot (cognitive 23): Injector.prepare_ledger_snapshot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 3, boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".opencode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ddeb43286a314f06d4dcd79cd0bd5f3ee68f2941aacabc4d50c668a4c3641ed"}},{"ruleId":"D2","level":"warning","message":{"text":"Injector.prepare_ledger_snapshot (cognitive 23): Injector.prepare_ledger_snapshot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 3, boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".pi/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6b8cb7bae587a5ff0ba0725c4ccd7ca2ea874cb3c71d7b61c119b9fb2e57d7"}},{"ruleId":"D2","level":"warning","message":{"text":"Injector.prepare_ledger_snapshot (cognitive 23): Injector.prepare_ledger_snapshot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 3, boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-ar/scripts/inject-plan.py"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed16a3cd492ce627e1ca8aa1337e1bdc7137040575cc43688878fb4847167b02"}},{"ruleId":"D2","level":"warning","message":{"text":"Injector.prepare_ledger_snapshot (cognitive 23): Injector.prepare_ledger_snapshot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 3, boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-de/scripts/inject-plan.py"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"852e3f7e5990dc39749745f85c89da5e1247264f2f2621b76dd107f953952c4e"}},{"ruleId":"D2","level":"warning","message":{"text":"Injector.prepare_ledger_snapshot (cognitive 23): Injector.prepare_ledger_snapshot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 3, boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-es/scripts/inject-plan.py"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d785b20b0e6cba7a58112da0a990c684f750f8a960a531e0f597279ab20ea80"}},{"ruleId":"D2","level":"warning","message":{"text":"Injector.prepare_ledger_snapshot (cognitive 23): Injector.prepare_ledger_snapshot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 3, boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zh/scripts/inject-plan.py"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"d443815911c4964f17a51b7f07d7d5048490a54116bdebb5cd1cc265bb747b41"}},{"ruleId":"D2","level":"warning","message":{"text":"Injector.prepare_ledger_snapshot (cognitive 23): Injector.prepare_ledger_snapshot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 3, boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zht/scripts/inject-plan.py"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2b91229a61f135c3881aaf5d24bad3d73ce287e43f66db5d3545b39eb42f24"}},{"ruleId":"D2","level":"warning","message":{"text":"Injector.prepare_ledger_snapshot (cognitive 23): Injector.prepare_ledger_snapshot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 3, boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18908ae0959928a48a78e12aa8f19455e7a543a78c438608f0aa228245a5089"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.main (cognitive 22): inject-plan.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, error handling 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b6004ee54bf0ad6be91f484717dc8e142a9abce5983993ab2dd14da0e3e9dd"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.main (cognitive 22): session-catchup.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 2, boolean chains 1, 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":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"85598e674f7ba66d290adbf139bf05d39c34ddb59e9e9a240a28a09c408b9582"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.main (cognitive 22): inject-plan.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, error handling 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codebuddy/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02268151c339fc0629a5ff712786e63a701028ebeb6df75a12e4b76c502c9a2"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.main (cognitive 22): session-catchup.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 2, boolean chains 1, 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":".codebuddy/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e72f159c4ac9d4c57e6556443e4b25b5878c1a583bce60ff1ac013d16946dff"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.main (cognitive 22): inject-plan.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, error handling 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"87adcdfab7ae6fcb2b548e5c0ddffdee4703d1e5272b6f280ef55aec9b0e5984"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.main (cognitive 22): session-catchup.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 2, boolean chains 1, 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":".codex/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3106c6b72beaf0dfb9020989e9bfd62d305af335e98610b0e58780396ebc14"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.main (cognitive 22): session-catchup.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 2, boolean chains 1, 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":".continue/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8e18736ed2cf002de933fef4b45ffc406c250477b314b8dfbbac9e2f02c508"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.main (cognitive 22): inject-plan.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, error handling 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".cursor/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab42d8b97b76adcadff0d2004b73e382db5416c9eb8b6b1ae11597016a422b2"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.main (cognitive 22): session-catchup.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 2, boolean chains 1, 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":".cursor/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"954375bf7584b493635031b1c63bcb22d13de43a9a803a48c106686d4316035c"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.main (cognitive 22): inject-plan.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, error handling 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".factory/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a6151ea948d51a087f5480a378e68b5993aa7382ad8c09877afc9cac25912a7"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.main (cognitive 22): session-catchup.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 2, boolean chains 1, 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":".factory/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1184ec39ea1af9d2f53fe2717fdd697fe4fa63375322047e7d71239fdb4987"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.main (cognitive 22): session-catchup.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 2, boolean chains 1, 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":".gemini/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c75292e21797ba6e54b64248729204df69506521cf994124a311d053e930a2f"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.scan_for_planning_update (cognitive 22): session-catchup.scan_for_planning_update has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), error handling 2 (3 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd46b02e4ea774b7d03704425125ae55098eda6c5685511db027050e4387ece"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.main (cognitive 22): inject-plan.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, error handling 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".mastracode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"380fd07c4cfd91dd0b1c1c7484a0cf04ba9717fcad0a3b1bef090b3ead4fd429"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.main (cognitive 22): inject-plan.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, error handling 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".opencode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"05fa005db46709c793d633e48a8365380cc4cb5175a0180bdf2c25b8dfaca9a8"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.main (cognitive 22): session-catchup.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 2, boolean chains 1, 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":".opencode/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"353989491b652c346831005d305a940b81b2ae08f7f4f5c9375f161e5919ce06"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.main (cognitive 22): inject-plan.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, error handling 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".pi/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2413b6c829aada12a81b4eca9568b98376ddc5c91c5db0ac79eab0dafc0a36"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.main (cognitive 22): session-catchup.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 2, boolean chains 1, 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":".pi/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed78dd231ac5a83b06eb44d8202d507c96324481a4f526410138572984d07b51"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.main (cognitive 22): inject-plan.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, error handling 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-ar/scripts/inject-plan.py"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"470a9a54f86895dce71fe63575a8dabf25ae3589e357cc08c211e79b3f9989fb"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.main (cognitive 22): inject-plan.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, error handling 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-de/scripts/inject-plan.py"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33ee4014a8b7eff96169264fd26931d95312b7c34c312892bf486f4a2680ca0"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.main (cognitive 22): inject-plan.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, error handling 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-es/scripts/inject-plan.py"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"69385b828b670daaac8430871aab42a625983b3a7b3fb429fe9fa2293b82dc03"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.main (cognitive 22): inject-plan.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, error handling 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zh/scripts/inject-plan.py"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25a36a41254888afc2d7d9473781b340c2fe591636056cbe9667bee3f28cdd9"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.main (cognitive 22): session-catchup.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 2, boolean chains 1, 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":"skills/i18n/planning-with-files-zh/scripts/session-catchup.py"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"f776ad90a65201b415af18c31a3710ba444454da6d99256cb9214cc3b3fa34aa"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.main (cognitive 22): inject-plan.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, error handling 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zht/scripts/inject-plan.py"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"daeba34db94f68aa174e322655eb0dfeb082ad36c61fcc6f3252806326235fba"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.main (cognitive 22): inject-plan.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, error handling 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"49009dcc7c9169d536a52f68049faa4ce1f719f67cdd8420563a40d33d3d9f4d"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.main (cognitive 22): session-catchup.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 2, boolean chains 1, 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":"skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0e42c09a4b05327c6d0c37c07066cd5f46a72ff56c16a2a46e1b4f28c92ada"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup._format_opencode_part (cognitive 21): session-catchup._format_opencode_part has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 4 (8 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"db53ec010e63a9019c8a52ac50a6fde67239d559bfd68d28059e6b993494bd53"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup._format_opencode_part (cognitive 21): session-catchup._format_opencode_part has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 4 (8 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codebuddy/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4598320ed9d136398333acf4881887f6bb780fbf4e12d33fc3b84259ca9bfc8"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup._format_opencode_part (cognitive 21): session-catchup._format_opencode_part has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 4 (8 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f470478daeaa5570d802f7a98ddd5c92e9d60aaaa48efeb9cd440399f0a94a"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup._format_opencode_part (cognitive 21): session-catchup._format_opencode_part has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 4 (8 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".continue/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"84cd607aa871596f500def9102867fd4d845991a7f9f86eea92d0a78b98fec83"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup._format_opencode_part (cognitive 21): session-catchup._format_opencode_part has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 4 (8 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".cursor/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"3094d5e728d641d6c4d385fd9153d884f56647442028f1377198d15deecca9b7"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup._format_opencode_part (cognitive 21): session-catchup._format_opencode_part has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 4 (8 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".factory/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6a1425a8598846803bcc859e8547a65017a7f798e92cbc541be679e635adfb"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup._format_opencode_part (cognitive 21): session-catchup._format_opencode_part has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 4 (8 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".gemini/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"931ce7d4f2a5fb3ced1bc4c0f0d71f4d84727e00640e08bd4136860cbe2be924"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup._format_opencode_part (cognitive 21): session-catchup._format_opencode_part has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 4 (8 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".pi/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"35689bcd65d199bcd011d7285c1066b9fdc8fc31923d21c7dbb6fda5aab6f65a"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.main (cognitive 21): session-catchup.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 2, boolean chains 1, 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":"skills/i18n/planning-with-files-ar/scripts/session-catchup.py"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a48e43e18851bb107bbc308ec6df4ebd4800a771efd8cf7f1a3380ba94a7e8"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.main (cognitive 21): session-catchup.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 2, boolean chains 1, 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":"skills/i18n/planning-with-files-de/scripts/session-catchup.py"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"203d2013cf9e35d955686b2dfc48d48de0c078f749f22c10b55b72e7abca2164"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.main (cognitive 21): session-catchup.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 2, boolean chains 1, 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":"skills/i18n/planning-with-files-es/scripts/session-catchup.py"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"0537e3f5bebc0f0548fd6a38e01e7263d9742f5dcbb0190110163ca785d65c20"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup._format_opencode_part (cognitive 21): session-catchup._format_opencode_part has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 4 (8 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zh/scripts/session-catchup.py"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85118fcfbe4e842ef67f63583a548e2edb4eca7088d1fc6e28d5b66e863b768"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.main (cognitive 21): session-catchup.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 2, boolean chains 1, 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":"skills/i18n/planning-with-files-zht/scripts/session-catchup.py"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8de2717e4465b3f4f01dffbee847065a0b1d70de50d9144b6fee36323240d43"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup._format_opencode_part (cognitive 21): session-catchup._format_opencode_part has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 4 (8 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4792d3fe725adb96a8a7adaca4eb1ca2013de06b6844a1b07eb709da21c37d"}},{"ruleId":"D2","level":"warning","message":{"text":"paths.nested_live_plans (cognitive 20): paths.nested_live_plans has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), error handling 2 (3 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/plugins/planning-with-files/paths.py"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"d391e32050fbc631ad8170e44b38e664e37b88656f95cc1d2c3f795407c75328"}},{"ruleId":"D2","level":"warning","message":{"text":"hooks._successful_file_result (cognitive 19): hooks._successful_file_result has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6, ternaries 3 (6 pts), boolean chains 5, error handling 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/plugins/planning-with-files/hooks.py"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"227f7e2f192eadc7511b87535014d2347a10f488ffb7dc7bd63c53dd5c1865d8"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.get_claude_project_dir (cognitive 18): session-catchup.get_claude_project_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"8067596b8be7df57f9b93d347b961a75800cb987bfc858e98b2b05420cf3da81"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.get_claude_project_dir (cognitive 18): session-catchup.get_claude_project_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codebuddy/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"61cbbb7fecdee1013cbc44e9309a6c9417f1086f17d1464cf4170cfdfd268638"}},{"ruleId":"D2","level":"warning","message":{"text":"codex_hook_adapter.is_session_attached (cognitive 18): codex_hook_adapter.is_session_attached has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), error handling 4 (5 pts), boolean chains 3, 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":".codex/hooks/codex_hook_adapter.py"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e296a691020e376463f5d195c0e672bba3fad0c6c655f2c652884a71bed2a27"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.get_claude_project_dir (cognitive 18): session-catchup.get_claude_project_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"7afeb6bfbea0e70b05f3e3874dbe0a47c4511aaeda98911118f6b71180f2f9b5"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.get_claude_project_dir (cognitive 18): session-catchup.get_claude_project_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".continue/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8654c8c9c0c939d399ff5d093903a049f13df3b577454c5e415d869aa115c6"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.get_claude_project_dir (cognitive 18): session-catchup.get_claude_project_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".cursor/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f01138970e2d09dd54f2472e57a725f153833885eb1e29956f7552c82225094"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.get_claude_project_dir (cognitive 18): session-catchup.get_claude_project_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".factory/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"3037360b175cf2bfe10daaf34b0cabacecca22a14d9b7606f2d63fb9c81fb934"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.get_claude_project_dir (cognitive 18): session-catchup.get_claude_project_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".gemini/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d46c3912aa2f595a8ec20788f7c9df7137707a513a2a769749cc0c439a715fa"}},{"ruleId":"D2","level":"warning","message":{"text":"tools._project_dir (cognitive 18): tools._project_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/plugins/planning-with-files/tools.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"7395246bbb063ffb4eb364b051e8dd869b526b0826bb4c1957b7b638fd8cb600"}},{"ruleId":"D2","level":"warning","message":{"text":"sync-ide-folders._build_manifest (cognitive 18): sync-ide-folders._build_manifest has cognitive complexity 18 (threshold 15). Drivers by points: loops 7 (14 pts), if/else 4 (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":".hermes/skills/planning-with-files/scripts/sync-ide-folders.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"1991afd8eb11232dfd12f16cf7be8d32a5a488869159179ce2124333c879d3a1"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.get_claude_project_dir (cognitive 18): session-catchup.get_claude_project_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".opencode/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f9ec870f41532bca7ba8c49c403f1cbfebfd0821fd7de65b5fa430aa73ac132"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup._format_opencode_part (cognitive 18): session-catchup._format_opencode_part has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, ternaries 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".opencode/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ff70da480a6970955062d7326f87ebd2bc1b468928a24077ff7007062eeb21"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.get_claude_project_dir (cognitive 18): session-catchup.get_claude_project_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".pi/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"11941810cdf6ba79d024fbb0261667a2488fb06c0a56d1806f608f5b9ea5041d"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.get_claude_project_dir (cognitive 18): session-catchup.get_claude_project_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-ar/scripts/session-catchup.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b4c3331039bc7e520633bb36d02eca3be5b0272ad00ed4628c1d3c450c06d0"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.get_claude_project_dir (cognitive 18): session-catchup.get_claude_project_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-de/scripts/session-catchup.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"2796c8382659cecd54d325c3f37a90ced0f9a87dd2b15bce955f31a44b3772ab"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.get_claude_project_dir (cognitive 18): session-catchup.get_claude_project_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-es/scripts/session-catchup.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89dc1942b9f85489ed1d9eef354a1fb975275ab36e411e950ffd3d26949b510"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.get_claude_project_dir (cognitive 18): session-catchup.get_claude_project_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zh/scripts/session-catchup.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"462d68662c28adeed032e101b649bf019db5d697174dcf304462b8bd2c60097f"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.get_claude_project_dir (cognitive 18): session-catchup.get_claude_project_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zht/scripts/session-catchup.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e9133c794aeb56ddbeba1ef75d99accd20ce480a4cdc8ac340f7ad16dafadf"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.get_claude_project_dir (cognitive 18): session-catchup.get_claude_project_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80644c1b414b887ff5ba13114b3ebf88aff68722e2db581341783537bf40e0d"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.session_attached (cognitive 17): inject-plan.session_attached has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58d83713cfa2a3c258e1a26dc9e76540755922055af484f0c1795fa61353eb2"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup._newest_session_cwd_matches (cognitive 17): session-catchup._newest_session_cwd_matches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4c60d11bfd270902281b34113279e303abc009a3f8f14a5d3e3f58ec3abbec"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.collect_claude_tool_results (cognitive 17): session-catchup.collect_claude_tool_results has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9e3d3f48367d78535e163b7889884e32bded307058a0bd795c632fb7109c56"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.session_attached (cognitive 17): inject-plan.session_attached has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codebuddy/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d67ded997e1874584190c633ffbefe6b82af3d6649a4c1ca5f5ee0cc9ecda95"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup._newest_session_cwd_matches (cognitive 17): session-catchup._newest_session_cwd_matches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codebuddy/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed324f3a8b0889082ea32a242ef3f519c8e2108ebd7a5ef096510c49b32a6f2"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.collect_claude_tool_results (cognitive 17): session-catchup.collect_claude_tool_results has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codebuddy/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5ca345674b363326b58e4e184f340ccfb9caab2af0eb5f57b04105e858bd40"}},{"ruleId":"D2","level":"warning","message":{"text":"codex_hook_adapter.session_plan_requires_binding (cognitive 17): codex_hook_adapter.session_plan_requires_binding has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, error handling 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/hooks/codex_hook_adapter.py"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"864a03ec37169d2d82d9d151a4a40f558ffd552e5909cc0b858a90dac4fef8e7"}},{"ruleId":"D2","level":"warning","message":{"text":"codex_hook_adapter._windows_git_bash (cognitive 17): codex_hook_adapter._windows_git_bash has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3, 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":".codex/hooks/codex_hook_adapter.py"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"542f56afa4877942609f59702dae6d1593804799823b57cd725f1d495d7ad3a2"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.session_attached (cognitive 17): inject-plan.session_attached has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"5010ac49491ed1a1a903f061c9cef1ed81832fc44ac60b0474a894e4c22cf128"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup._newest_session_cwd_matches (cognitive 17): session-catchup._newest_session_cwd_matches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d875b41deb033a02ede46525ea9e0f311af4c180cb8ffb89d2e527cebdc055f"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.collect_claude_tool_results (cognitive 17): session-catchup.collect_claude_tool_results has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"788df790de9e302e49ccbf93dd97a315ba4a5e71c9c3946e70c6a7e72fc8a680"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup._newest_session_cwd_matches (cognitive 17): session-catchup._newest_session_cwd_matches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".continue/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11b8e9950a7c84d1aaccb368eddfec49b1f1b5cad9ad1b211b9f8711b35f0cd"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.collect_claude_tool_results (cognitive 17): session-catchup.collect_claude_tool_results has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".continue/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"682479643486efeb4ba99f07367d2ab95787953ff68bffe5b6d09989524d3944"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.session_attached (cognitive 17): inject-plan.session_attached has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".cursor/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2649106327816342efe53b00b0fd58ed347d8a971d18e87da64f21a3d78188"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup._newest_session_cwd_matches (cognitive 17): session-catchup._newest_session_cwd_matches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".cursor/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e158008e2c2586bcf5ba93d6c3f05cf1e171f35f1693960ed9e2e1306d5be25"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.collect_claude_tool_results (cognitive 17): session-catchup.collect_claude_tool_results has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".cursor/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68afe5d253069d36e8352ee30dac92ba9bb1b39d747865eadd19cbff424cc3f"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.session_attached (cognitive 17): inject-plan.session_attached has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".factory/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"f501a8946550ff8c42e9770670dc7fde5dec108e6b3e922c61252df05e5e7012"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup._newest_session_cwd_matches (cognitive 17): session-catchup._newest_session_cwd_matches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".factory/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"15aaa31750998a574a69f8e8dad9741eb9aea19493a1d0d5af5b357b15c98cb6"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.collect_claude_tool_results (cognitive 17): session-catchup.collect_claude_tool_results has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".factory/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"25505f8d946c43095a99c4d5000667aae12b37587a41fefbcbc8276062d95d40"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup._newest_session_cwd_matches (cognitive 17): session-catchup._newest_session_cwd_matches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".gemini/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b7d6ba722a62dda6b324dc84f571259f8ae009fc50e35151def22caa991e3d"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.collect_claude_tool_results (cognitive 17): session-catchup.collect_claude_tool_results has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".gemini/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"771c5c520d3615d1ea9b8e724a364b360cfa4e1bdf75256c5a60cdfa4ba1cd37"}},{"ruleId":"D2","level":"warning","message":{"text":"planning-with-files.pwf_command (cognitive 17): planning-with-files.pwf_command has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 6, 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":".hermes/plugins/planning-with-files/__init__.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad441ab4f8f72032291606bd12d609108a568b95b1ba6da6407aaf9fe7828bd"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.session_attached (cognitive 17): inject-plan.session_attached has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".mastracode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe7ac698f4c035c5a45dbe1cbe18abe218981fc9562fed66e49056c1f4eee4f"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.session_attached (cognitive 17): inject-plan.session_attached has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".opencode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b06b0d2d4e52a06cbf80a16a4d5f7dd85a930f83ea6a6979e13b3d9242f5d0"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup._newest_session_cwd_matches (cognitive 17): session-catchup._newest_session_cwd_matches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".opencode/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"424b828938a285aa7224639de95a028b1439cef1e860cbc6a4e4792b1cbb18cd"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.session_attached (cognitive 17): inject-plan.session_attached has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".pi/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c391a4f7ad33e7b2caef43be9c4984184002dcc5fa4e78d9c17f6cfca433933"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup._newest_session_cwd_matches (cognitive 17): session-catchup._newest_session_cwd_matches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".pi/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"206d0db6855e96763a6c36c6b3708e5af425b7280a4e7c8743b3818bbff7c450"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.collect_claude_tool_results (cognitive 17): session-catchup.collect_claude_tool_results has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".pi/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa787d3fbca9bda6e9ee7650f5a059d61251512cda5d789f52291f927c72cd2"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.session_attached (cognitive 17): inject-plan.session_attached has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-ar/scripts/inject-plan.py"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"5184f421475858db815892c79fb1160e0eefb683bc7ea943ed74d6c6d9037509"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup._newest_session_cwd_matches (cognitive 17): session-catchup._newest_session_cwd_matches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-ar/scripts/session-catchup.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"96cc08c09e817183e52c4c16aa895c5d0b40f3a6d7f22a5e9a94a6cdfa59511c"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.session_attached (cognitive 17): inject-plan.session_attached has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-de/scripts/inject-plan.py"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4e3ea59112b3e78747f9cbe9f7b336d93eb0901f1756d5e5a2ae82818ae019"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup._newest_session_cwd_matches (cognitive 17): session-catchup._newest_session_cwd_matches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-de/scripts/session-catchup.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"417f202158c8e8092e73546d0c97ca33d5db0bd2647b0398ff6d7b1f271b94e4"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.session_attached (cognitive 17): inject-plan.session_attached has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-es/scripts/inject-plan.py"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f48724d1e4760a6b4e86f00490fd8d573b0be700ca96da9510f68784ca97365"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup._newest_session_cwd_matches (cognitive 17): session-catchup._newest_session_cwd_matches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-es/scripts/session-catchup.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b2428fd7d9e62bf7124132463d2c139a5d2ec9133d890c532e3a274720ac37b"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.session_attached (cognitive 17): inject-plan.session_attached has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zh/scripts/inject-plan.py"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"5809a02b9052506e6353c3c62aae5e0bcf1432e4a0b3f970459a4c221e1578bb"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup._newest_session_cwd_matches (cognitive 17): session-catchup._newest_session_cwd_matches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zh/scripts/session-catchup.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"492762ba047c2f6c80a6bb370c6f5ba490f55cc3e64874d2c3937f02a17ed4c2"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.collect_claude_tool_results (cognitive 17): session-catchup.collect_claude_tool_results has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zh/scripts/session-catchup.py"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02355aaf635a3170bb2aa04e51bd475783815ebee1ca6ee4ff2ab4316a36aac"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.session_attached (cognitive 17): inject-plan.session_attached has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zht/scripts/inject-plan.py"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"b421b30e6702495640c6959f6bc944a97160e9e135c3ee8de38e57aa786e0089"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup._newest_session_cwd_matches (cognitive 17): session-catchup._newest_session_cwd_matches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zht/scripts/session-catchup.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9a248bf83f65ee6a9aa903650c98b5df8bd2cf801f6e0c7047e3b954eb4fa9"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-plan.session_attached (cognitive 17): inject-plan.session_attached has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"71963382a83f8b8f9b434b81adfafa9cea130cabcfb5ca7a6fc00f8da5007c7d"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup._newest_session_cwd_matches (cognitive 17): session-catchup._newest_session_cwd_matches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c649d9c0e17c1b3920d1bb3d3567c78607ed8b56cbc55a0cccd91764d868ad8"}},{"ruleId":"D2","level":"warning","message":{"text":"session-catchup.collect_claude_tool_results (cognitive 17): session-catchup.collect_claude_tool_results has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"493135179af6dae7ad89ba5708273f22a4be8e198ae2beda6afdc3aea2c37e25"}},{"ruleId":"D2","level":"warning","message":{"text":"hooks.pre_llm_call (cognitive 16): hooks.pre_llm_call has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/plugins/planning-with-files/hooks.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4d7d4969eac6a82b120b68f696e557cf2ac68e0f1405f957f27fc1607eff0e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/inject-plan.py: FileTooLong \u2014 1400 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 900 over it, 2.80\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e76f670cff6937837e8fb01a083184fcca77fe8f530d332452a1a145f927ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/inject-plan.py: FileTooLong \u2014 1400 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 900 over it, 2.80\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codebuddy/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4547b81ba58147a5de5ac08eaa1811f2036af8debd4fab00d573ad5447124c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/inject-plan.py: FileTooLong \u2014 1400 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 900 over it, 2.80\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a386084617c2ef842682ca9f41f41b997cafa200d7674784d66dce2892c6a43c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/inject-plan.py: FileTooLong \u2014 1400 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 900 over it, 2.80\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".cursor/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0209c462847d6688879f7169a96e386c46ae750895aa6fb50ca6a026dc596a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/inject-plan.py: FileTooLong \u2014 1400 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 900 over it, 2.80\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".factory/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41cfb15ccddc91ab44208f61839b708d00d423650a37cbd630a84b8c97d8fb29"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/inject-plan.py: FileTooLong \u2014 1400 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 900 over it, 2.80\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".mastracode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"daad03a757184a21d198052aab55d7522bd92196d38148589fac8efc79b71986"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/inject-plan.py: FileTooLong \u2014 1400 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 900 over it, 2.80\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".opencode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5eab5b44770ba31aa9d68ec72fe77d012bfaced36381b510ac07743a2774f8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/inject-plan.py: FileTooLong \u2014 1400 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 900 over it, 2.80\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".pi/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe49c4344209d7dd16eea28c9f186707f799fa2e63de36b4d3bbcd7a73161222"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/inject-plan.py: FileTooLong \u2014 1400 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 900 over it, 2.80\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-ar/scripts/inject-plan.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07fb3a21adcd9d9cf22c49f93be028c8e54b628aa04e292e588ab350ee4391d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/inject-plan.py: FileTooLong \u2014 1400 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 900 over it, 2.80\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-de/scripts/inject-plan.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a88c50a7538c2e83e463d3aaff75d0ca7bc629ca706614e12cde4cfa7be30a23"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/inject-plan.py: FileTooLong \u2014 1400 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 900 over it, 2.80\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-es/scripts/inject-plan.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fcec956d57fb28232cf9ac1e3bc2fe6df562f483cc2347527157918c48b325b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/inject-plan.py: FileTooLong \u2014 1400 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 900 over it, 2.80\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zh/scripts/inject-plan.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9211a01de34e9e85c7ff9d2bdb596b362eeb196497777afd453b745fcf31213"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/inject-plan.py: FileTooLong \u2014 1400 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 900 over it, 2.80\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zht/scripts/inject-plan.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3569b5bbde4f50b48e989283c0158c2d3d15f759c2fdd5b9de13879fac126f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/inject-plan.py: FileTooLong \u2014 1400 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 900 over it, 2.80\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb4e645e45dbff4506083575f2dc1c04871654cfc6b77ca5fa83d47bb081a0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (18 members, 26 shared lines): .agents/skills/planning-with-files/scripts/session-catchup.py:262-309 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:262-309 | .codex/skills/planning-with-files/scripts/session-catchup.py:262-309 | .continue/skills/planning-with-files/scripts/session-catchup.py:262-309 | .cursor/skills/planning-with-files/scripts/session-catchup.py:262-309 | .factory/skills/planning-with-files/scripts/session-catchup.py:262-309 | .gemini/skills/planning-with-files/scripts/session-catchup.py:262-309 | .hermes/skills/planning-with-files/scripts/session-catchup.py:264-311 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:232-279 | .opencode/skills/planning-with-files/scripts/session-catchup.py:238-285 | .pi/skills/planning-with-files/scripts/session-catchup.py:262-309 | scripts/session-catchup.py:241-288 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:259-305 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:260-307 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:263-310 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:261-306 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:260-305 | skills/planning-with-files/scripts/session-catchup.py:262-309 \u2014 These 18 members are variants of one another: a block of 26 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 18 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 18 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"7713ab78a05cba6d1a76d17bc192988585b878a087bd511ff62c5d86c3d9b162"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (15 members, 70 shared lines): .agents/skills/planning-with-files/scripts/session-catchup.py:835-921 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:835-921 | .codex/skills/planning-with-files/scripts/session-catchup.py:835-921 | .continue/skills/planning-with-files/scripts/session-catchup.py:835-921 | .cursor/skills/planning-with-files/scripts/session-catchup.py:835-921 | .factory/skills/planning-with-files/scripts/session-catchup.py:835-921 | .gemini/skills/planning-with-files/scripts/session-catchup.py:835-921 | .opencode/skills/planning-with-files/scripts/session-catchup.py:732-812 | .pi/skills/planning-with-files/scripts/session-catchup.py:835-921 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:518-598 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:549-629 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:523-603 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:811-895 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:547-627 | skills/planning-with-files/scripts/session-catchup.py:835-921 \u2014 These 15 members are variants of one another: a block of 70 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 15 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 15 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"17999f91caf185fcdd919cdb434c3780d6b81230e2be3dd6a899cae93441e16d"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (12 members, 129 shared lines): .agents/skills/planning-with-files/scripts/session-catchup.py:529-688 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:529-688 | .codex/skills/planning-with-files/scripts/session-catchup.py:529-688 | .continue/skills/planning-with-files/scripts/session-catchup.py:529-688 | .cursor/skills/planning-with-files/scripts/session-catchup.py:529-688 | .factory/skills/planning-with-files/scripts/session-catchup.py:529-688 | .gemini/skills/planning-with-files/scripts/session-catchup.py:529-688 | .opencode/skills/planning-with-files/scripts/session-catchup.py:454-613 | .pi/skills/planning-with-files/scripts/session-catchup.py:529-688 | scripts/session-catchup.py:542-707 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:520-669 | skills/planning-with-files/scripts/session-catchup.py:529-688 \u2014 These 12 members are variants of one another: a block of 129 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 12 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 12 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2ccbc43bf8ccbcef97b2b5cbac6ff565657f9237679849e3d9fb5d474302b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (73 corresponding lines): .hermes/skills/planning-with-files/scripts/session-catchup.py:393-473 | scripts/session-catchup.py:370-450 \u2014 These two members are one piece of code written twice and then edited apart: 73 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ed3fcaa30dc0dddaa85fd432323c334de381d46e939a85b890a318308c7ec9"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (18 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/session-catchup.py:148-183 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:148-183 | .codex/skills/planning-with-files/scripts/session-catchup.py:148-183 | .continue/skills/planning-with-files/scripts/session-catchup.py:148-183 | .cursor/skills/planning-with-files/scripts/session-catchup.py:148-183 | .factory/skills/planning-with-files/scripts/session-catchup.py:148-183 | .gemini/skills/planning-with-files/scripts/session-catchup.py:148-183 | .hermes/skills/planning-with-files/scripts/session-catchup.py:93-110 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:66-83 | .opencode/skills/planning-with-files/scripts/session-catchup.py:124-159 | .pi/skills/planning-with-files/scripts/session-catchup.py:148-183 | scripts/session-catchup.py:99-116 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:145-180 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:146-181 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:149-184 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:147-182 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:146-181 | skills/planning-with-files/scripts/session-catchup.py:148-183 \u2014 These 18 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 18 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 18 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c77ad7fe8674ecacde271a46943b926ae1cb4ef9b5164d5289ca05718a15e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (18 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/session-catchup.py:220-238 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:220-238 | .codex/skills/planning-with-files/scripts/session-catchup.py:220-238 | .continue/skills/planning-with-files/scripts/session-catchup.py:220-238 | .cursor/skills/planning-with-files/scripts/session-catchup.py:220-238 | .factory/skills/planning-with-files/scripts/session-catchup.py:220-238 | .gemini/skills/planning-with-files/scripts/session-catchup.py:220-238 | .hermes/skills/planning-with-files/scripts/session-catchup.py:193-211 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:161-179 | .opencode/skills/planning-with-files/scripts/session-catchup.py:196-214 | .pi/skills/planning-with-files/scripts/session-catchup.py:220-238 | scripts/session-catchup.py:199-217 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:217-235 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:218-236 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:221-239 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:219-237 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:218-236 | skills/planning-with-files/scripts/session-catchup.py:220-238 \u2014 These 18 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 18 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 18 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"c501f84d6eeb1d598ffcc296cca7fb4f5791aef8cf4cfe85e16183dd701e5b90"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (18 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/session-catchup.py:242-247 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:242-247 | .codex/skills/planning-with-files/scripts/session-catchup.py:242-247 | .continue/skills/planning-with-files/scripts/session-catchup.py:242-247 | .cursor/skills/planning-with-files/scripts/session-catchup.py:242-247 | .factory/skills/planning-with-files/scripts/session-catchup.py:242-247 | .gemini/skills/planning-with-files/scripts/session-catchup.py:242-247 | .hermes/skills/planning-with-files/scripts/session-catchup.py:215-220 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:183-188 | .opencode/skills/planning-with-files/scripts/session-catchup.py:218-223 | .pi/skills/planning-with-files/scripts/session-catchup.py:242-247 | scripts/session-catchup.py:221-226 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:239-244 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:240-245 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:243-248 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:241-246 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:240-245 | skills/planning-with-files/scripts/session-catchup.py:242-247 \u2014 These 18 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 18 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 18 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d1b64cfa3bc3f0ec59591f12d6899ee2f1c4d10e335a8468df43fafd31194b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (18 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/session-catchup.py:509-525 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:509-525 | .codex/skills/planning-with-files/scripts/session-catchup.py:509-525 | .continue/skills/planning-with-files/scripts/session-catchup.py:509-525 | .cursor/skills/planning-with-files/scripts/session-catchup.py:509-525 | .factory/skills/planning-with-files/scripts/session-catchup.py:509-525 | .gemini/skills/planning-with-files/scripts/session-catchup.py:509-525 | .hermes/skills/planning-with-files/scripts/session-catchup.py:243-259 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:211-227 | .opencode/skills/planning-with-files/scripts/session-catchup.py:434-450 | .pi/skills/planning-with-files/scripts/session-catchup.py:509-525 | scripts/session-catchup.py:522-538 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:611-627 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:529-545 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:619-635 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:500-516 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:527-543 | skills/planning-with-files/scripts/session-catchup.py:509-525 \u2014 These 18 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 18 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 18 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9153affa41f54525287f5adb203fc7b8ac1f7d2ced9487610fe485562efee03"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (16 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/session-catchup.py:734-771 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:734-771 | .codex/skills/planning-with-files/scripts/session-catchup.py:734-771 | .continue/skills/planning-with-files/scripts/session-catchup.py:734-771 | .cursor/skills/planning-with-files/scripts/session-catchup.py:734-771 | .factory/skills/planning-with-files/scripts/session-catchup.py:734-771 | .gemini/skills/planning-with-files/scripts/session-catchup.py:734-771 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:297-322 | .opencode/skills/planning-with-files/scripts/session-catchup.py:659-696 | .pi/skills/planning-with-files/scripts/session-catchup.py:734-771 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:445-482 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:447-484 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:450-487 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:715-752 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:445-482 | skills/planning-with-files/scripts/session-catchup.py:734-771 \u2014 These 16 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 16 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 16 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"53915cf1385544c851b11659eab8e76da19bcad7c9a585c43fbd12806b4bb615"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/inject-plan.py:184-202 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:184-202 | .codex/skills/planning-with-files/scripts/inject-plan.py:184-202 | .cursor/skills/planning-with-files/scripts/inject-plan.py:184-202 | .factory/skills/planning-with-files/scripts/inject-plan.py:184-202 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:184-202 | .opencode/skills/planning-with-files/scripts/inject-plan.py:184-202 | .pi/skills/planning-with-files/scripts/inject-plan.py:184-202 | scripts/inject-plan.py:184-202 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:184-202 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:184-202 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:184-202 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:184-202 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:184-202 | skills/planning-with-files/scripts/inject-plan.py:184-202 \u2014 These 15 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 15 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 15 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"090da3cee5c20f78cd40592fcd9bf68124e80b7ced0cfd35f0db06683eab1986"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/inject-plan.py:265-274 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:265-274 | .codex/skills/planning-with-files/scripts/inject-plan.py:265-274 | .cursor/skills/planning-with-files/scripts/inject-plan.py:265-274 | .factory/skills/planning-with-files/scripts/inject-plan.py:265-274 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:265-274 | .opencode/skills/planning-with-files/scripts/inject-plan.py:265-274 | .pi/skills/planning-with-files/scripts/inject-plan.py:265-274 | scripts/inject-plan.py:265-274 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:265-274 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:265-274 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:265-274 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:265-274 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:265-274 | skills/planning-with-files/scripts/inject-plan.py:265-274 \u2014 These 15 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 15 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 15 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"740a23ce3cb0b0c4edd6439b8832fa3e039248e1f3427953f01865ab329fcc91"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/inject-plan.py:278-297 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:278-297 | .codex/skills/planning-with-files/scripts/inject-plan.py:278-297 | .cursor/skills/planning-with-files/scripts/inject-plan.py:278-297 | .factory/skills/planning-with-files/scripts/inject-plan.py:278-297 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:278-297 | .opencode/skills/planning-with-files/scripts/inject-plan.py:278-297 | .pi/skills/planning-with-files/scripts/inject-plan.py:278-297 | scripts/inject-plan.py:278-297 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:278-297 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:278-297 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:278-297 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:278-297 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:278-297 | skills/planning-with-files/scripts/inject-plan.py:278-297 \u2014 These 15 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 15 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 15 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b213c4ad055f3df8b08e04f093aa12e57a6af16c0049a95ebcf5adffb5a7dfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/inject-plan.py:324-333 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:324-333 | .codex/skills/planning-with-files/scripts/inject-plan.py:324-333 | .cursor/skills/planning-with-files/scripts/inject-plan.py:324-333 | .factory/skills/planning-with-files/scripts/inject-plan.py:324-333 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:324-333 | .opencode/skills/planning-with-files/scripts/inject-plan.py:324-333 | .pi/skills/planning-with-files/scripts/inject-plan.py:324-333 | scripts/inject-plan.py:324-333 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:324-333 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:324-333 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:324-333 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:324-333 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:324-333 | skills/planning-with-files/scripts/inject-plan.py:324-333 \u2014 These 15 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 15 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 15 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf4e78eb0e5e86d8ed0a90aaf3a048cde39a6cae4e72bd4f0c0ceb46f94b438"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/inject-plan.py:350-430 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:350-430 | .codex/skills/planning-with-files/scripts/inject-plan.py:350-430 | .cursor/skills/planning-with-files/scripts/inject-plan.py:350-430 | .factory/skills/planning-with-files/scripts/inject-plan.py:350-430 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:350-430 | .opencode/skills/planning-with-files/scripts/inject-plan.py:350-430 | .pi/skills/planning-with-files/scripts/inject-plan.py:350-430 | scripts/inject-plan.py:350-430 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:350-430 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:350-430 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:350-430 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:350-430 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:350-430 | skills/planning-with-files/scripts/inject-plan.py:350-430 \u2014 These 15 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 15 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 15 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af8e5723c422ce0e3359323fdc357743c50e4769913e53d3af9ac547a52e277"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/inject-plan.py:434-521 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:434-521 | .codex/skills/planning-with-files/scripts/inject-plan.py:434-521 | .cursor/skills/planning-with-files/scripts/inject-plan.py:434-521 | .factory/skills/planning-with-files/scripts/inject-plan.py:434-521 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:434-521 | .opencode/skills/planning-with-files/scripts/inject-plan.py:434-521 | .pi/skills/planning-with-files/scripts/inject-plan.py:434-521 | scripts/inject-plan.py:434-521 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:434-521 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:434-521 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:434-521 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:434-521 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:434-521 | skills/planning-with-files/scripts/inject-plan.py:434-521 \u2014 These 15 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 15 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 15 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c64fa76c2b1e42d44ef7dbd611b551385bcf7183af949d3b9bd3266457d8fd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/inject-plan.py:525-646 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:525-646 | .codex/skills/planning-with-files/scripts/inject-plan.py:525-646 | .cursor/skills/planning-with-files/scripts/inject-plan.py:525-646 | .factory/skills/planning-with-files/scripts/inject-plan.py:525-646 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:525-646 | .opencode/skills/planning-with-files/scripts/inject-plan.py:525-646 | .pi/skills/planning-with-files/scripts/inject-plan.py:525-646 | scripts/inject-plan.py:525-646 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:525-646 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:525-646 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:525-646 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:525-646 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:525-646 | skills/planning-with-files/scripts/inject-plan.py:525-646 \u2014 These 15 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 15 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 15 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6087cecb674a416a3a0f9ee6ca39f6cb330d883b141b4a4ad2456e7108717e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/inject-plan.py:654-752 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:654-752 | .codex/skills/planning-with-files/scripts/inject-plan.py:654-752 | .cursor/skills/planning-with-files/scripts/inject-plan.py:654-752 | .factory/skills/planning-with-files/scripts/inject-plan.py:654-752 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:654-752 | .opencode/skills/planning-with-files/scripts/inject-plan.py:654-752 | .pi/skills/planning-with-files/scripts/inject-plan.py:654-752 | scripts/inject-plan.py:654-752 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:654-752 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:654-752 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:654-752 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:654-752 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:654-752 | skills/planning-with-files/scripts/inject-plan.py:654-752 \u2014 These 15 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 15 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 15 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53f87a5812ca8d44539031c173e9a80a3abd167749eb31863128d514e388e25"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/inject-plan.py:778-805 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:778-805 | .codex/skills/planning-with-files/scripts/inject-plan.py:778-805 | .cursor/skills/planning-with-files/scripts/inject-plan.py:778-805 | .factory/skills/planning-with-files/scripts/inject-plan.py:778-805 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:778-805 | .opencode/skills/planning-with-files/scripts/inject-plan.py:778-805 | .pi/skills/planning-with-files/scripts/inject-plan.py:778-805 | scripts/inject-plan.py:778-805 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:778-805 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:778-805 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:778-805 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:778-805 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:778-805 | skills/planning-with-files/scripts/inject-plan.py:778-805 \u2014 These 15 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 15 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 15 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"747f7cb02f270c2de95ca942ec2c7f3dbec00d7dcdf1a808c583112ed63104bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/inject-plan.py:809-889 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:809-889 | .codex/skills/planning-with-files/scripts/inject-plan.py:809-889 | .cursor/skills/planning-with-files/scripts/inject-plan.py:809-889 | .factory/skills/planning-with-files/scripts/inject-plan.py:809-889 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:809-889 | .opencode/skills/planning-with-files/scripts/inject-plan.py:809-889 | .pi/skills/planning-with-files/scripts/inject-plan.py:809-889 | scripts/inject-plan.py:809-889 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:809-889 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:809-889 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:809-889 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:809-889 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:809-889 | skills/planning-with-files/scripts/inject-plan.py:809-889 \u2014 These 15 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 15 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 15 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8873e290fa46df04c30f152eeb812d8195eb35c9a6afa92a7fad38e499d24df"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/inject-plan.py:907-921 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:907-921 | .codex/skills/planning-with-files/scripts/inject-plan.py:907-921 | .cursor/skills/planning-with-files/scripts/inject-plan.py:907-921 | .factory/skills/planning-with-files/scripts/inject-plan.py:907-921 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:907-921 | .opencode/skills/planning-with-files/scripts/inject-plan.py:907-921 | .pi/skills/planning-with-files/scripts/inject-plan.py:907-921 | scripts/inject-plan.py:907-921 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:907-921 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:907-921 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:907-921 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:907-921 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:907-921 | skills/planning-with-files/scripts/inject-plan.py:907-921 \u2014 These 15 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 15 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 15 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71b314d18abea1209a5078f519d31500549b11caf3066c6d0dcb314bfb6646f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/inject-plan.py:928-939 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:928-939 | .codex/skills/planning-with-files/scripts/inject-plan.py:928-939 | .cursor/skills/planning-with-files/scripts/inject-plan.py:928-939 | .factory/skills/planning-with-files/scripts/inject-plan.py:928-939 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:928-939 | .opencode/skills/planning-with-files/scripts/inject-plan.py:928-939 | .pi/skills/planning-with-files/scripts/inject-plan.py:928-939 | scripts/inject-plan.py:928-939 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:928-939 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:928-939 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:928-939 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:928-939 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:928-939 | skills/planning-with-files/scripts/inject-plan.py:928-939 \u2014 These 15 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 15 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 15 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b509b76f9d316c14620928c7d17cbbc8ae27d42c7d5b6581729c6f45ef41031"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/inject-plan.py:949-1366 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:949-1366 | .codex/skills/planning-with-files/scripts/inject-plan.py:949-1366 | .cursor/skills/planning-with-files/scripts/inject-plan.py:949-1366 | .factory/skills/planning-with-files/scripts/inject-plan.py:949-1366 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:949-1366 | .opencode/skills/planning-with-files/scripts/inject-plan.py:949-1366 | .pi/skills/planning-with-files/scripts/inject-plan.py:949-1366 | scripts/inject-plan.py:949-1366 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:949-1366 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:949-1366 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:949-1366 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:949-1366 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:949-1366 | skills/planning-with-files/scripts/inject-plan.py:949-1366 \u2014 These 15 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 15 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 15 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0e8147c052fbb042642377e342dea10e06621f16d888081aff1a0d3a773c1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/inject-plan.py:1378-1425 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1378-1425 | .codex/skills/planning-with-files/scripts/inject-plan.py:1378-1425 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1378-1425 | .factory/skills/planning-with-files/scripts/inject-plan.py:1378-1425 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1378-1425 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1378-1425 | .pi/skills/planning-with-files/scripts/inject-plan.py:1378-1425 | scripts/inject-plan.py:1378-1425 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1378-1425 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1378-1425 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1378-1425 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1378-1425 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1378-1425 | skills/planning-with-files/scripts/inject-plan.py:1378-1425 \u2014 These 15 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 15 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 15 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba82592e44af9c906488c390ff38d372c004a5dbd68ac7c6007f8cb2a65d054a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/inject-plan.py:1445-1459 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1445-1459 | .codex/skills/planning-with-files/scripts/inject-plan.py:1445-1459 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1445-1459 | .factory/skills/planning-with-files/scripts/inject-plan.py:1445-1459 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1445-1459 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1445-1459 | .pi/skills/planning-with-files/scripts/inject-plan.py:1445-1459 | scripts/inject-plan.py:1445-1459 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1445-1459 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1445-1459 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1445-1459 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1445-1459 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1445-1459 | skills/planning-with-files/scripts/inject-plan.py:1445-1459 \u2014 These 15 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 15 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 15 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1445}}}],"partialFingerprints":{"codehealthFindingId/v1":"173abb6b9cdff614be34cb9df6f661d4eea791fa1484f3a07911b4a78c9e4195"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/inject-plan.py:1471-1489 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1471-1489 | .codex/skills/planning-with-files/scripts/inject-plan.py:1471-1489 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1471-1489 | .factory/skills/planning-with-files/scripts/inject-plan.py:1471-1489 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1471-1489 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1471-1489 | .pi/skills/planning-with-files/scripts/inject-plan.py:1471-1489 | scripts/inject-plan.py:1471-1489 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1471-1489 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1471-1489 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1471-1489 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1471-1489 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1471-1489 | skills/planning-with-files/scripts/inject-plan.py:1471-1489 \u2014 These 15 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 15 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 15 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1471}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e96c937cc3c67ef73ed14182fec3b35d1b222fabd15d305723541bd3f703731"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/inject-plan.py:1493-1570 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1493-1570 | .codex/skills/planning-with-files/scripts/inject-plan.py:1493-1570 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1493-1570 | .factory/skills/planning-with-files/scripts/inject-plan.py:1493-1570 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1493-1570 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1493-1570 | .pi/skills/planning-with-files/scripts/inject-plan.py:1493-1570 | scripts/inject-plan.py:1493-1570 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1493-1570 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1493-1570 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1493-1570 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1493-1570 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1493-1570 | skills/planning-with-files/scripts/inject-plan.py:1493-1570 \u2014 These 15 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 15 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 15 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1493}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3627459c5947569df99747fea62a89322ddd2e699686d25ce69c8637ba34cd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/inject-plan.py:1606-1616 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1606-1616 | .codex/skills/planning-with-files/scripts/inject-plan.py:1606-1616 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1606-1616 | .factory/skills/planning-with-files/scripts/inject-plan.py:1606-1616 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1606-1616 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1606-1616 | .pi/skills/planning-with-files/scripts/inject-plan.py:1606-1616 | scripts/inject-plan.py:1606-1616 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1606-1616 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1606-1616 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1606-1616 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1606-1616 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1606-1616 | skills/planning-with-files/scripts/inject-plan.py:1606-1616 \u2014 These 15 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 15 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 15 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1606}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd42e4abe915e702b4c7edb4c4918724519a501fc7a5e34a035d37794f86bd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/inject-plan.py:1619-1630 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1619-1630 | .codex/skills/planning-with-files/scripts/inject-plan.py:1619-1630 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1619-1630 | .factory/skills/planning-with-files/scripts/inject-plan.py:1619-1630 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1619-1630 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1619-1630 | .pi/skills/planning-with-files/scripts/inject-plan.py:1619-1630 | scripts/inject-plan.py:1619-1630 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1619-1630 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1619-1630 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1619-1630 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1619-1630 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1619-1630 | skills/planning-with-files/scripts/inject-plan.py:1619-1630 \u2014 These 15 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 15 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 15 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1619}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1970432af48490ff8aaaf2e0ff450ec4d7def5635a3062f009e6ebb7f72f54"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/inject-plan.py:1656-1670 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1656-1670 | .codex/skills/planning-with-files/scripts/inject-plan.py:1656-1670 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1656-1670 | .factory/skills/planning-with-files/scripts/inject-plan.py:1656-1670 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1656-1670 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1656-1670 | .pi/skills/planning-with-files/scripts/inject-plan.py:1656-1670 | scripts/inject-plan.py:1656-1670 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1656-1670 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1656-1670 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1656-1670 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1656-1670 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1656-1670 | skills/planning-with-files/scripts/inject-plan.py:1656-1670 \u2014 These 15 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 15 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 15 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1656}}}],"partialFingerprints":{"codehealthFindingId/v1":"057fb41a982d235030e5e5db86d859b828a6bc29ac7373e3912bd200b376d322"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/inject-plan.py:1673-1700 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1673-1700 | .codex/skills/planning-with-files/scripts/inject-plan.py:1673-1700 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1673-1700 | .factory/skills/planning-with-files/scripts/inject-plan.py:1673-1700 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1673-1700 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1673-1700 | .pi/skills/planning-with-files/scripts/inject-plan.py:1673-1700 | scripts/inject-plan.py:1673-1700 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1673-1700 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1673-1700 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1673-1700 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1673-1700 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1673-1700 | skills/planning-with-files/scripts/inject-plan.py:1673-1700 \u2014 These 15 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 15 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 15 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"d010d78452162e9b809c4c77e915c5f28a0ad85cdac7bbf15235ad43945125bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/inject-plan.py:1703-1723 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1703-1723 | .codex/skills/planning-with-files/scripts/inject-plan.py:1703-1723 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1703-1723 | .factory/skills/planning-with-files/scripts/inject-plan.py:1703-1723 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1703-1723 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1703-1723 | .pi/skills/planning-with-files/scripts/inject-plan.py:1703-1723 | scripts/inject-plan.py:1703-1723 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1703-1723 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1703-1723 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1703-1723 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1703-1723 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1703-1723 | skills/planning-with-files/scripts/inject-plan.py:1703-1723 \u2014 These 15 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 15 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 15 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1703}}}],"partialFingerprints":{"codehealthFindingId/v1":"4119fa68a1086671568fbaa7ffbc6e4fce231ad53708957672a1d651768b8332"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/inject-plan.py:1742-1778 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1742-1778 | .codex/skills/planning-with-files/scripts/inject-plan.py:1742-1778 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1742-1778 | .factory/skills/planning-with-files/scripts/inject-plan.py:1742-1778 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1742-1778 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1742-1778 | .pi/skills/planning-with-files/scripts/inject-plan.py:1742-1778 | scripts/inject-plan.py:1742-1778 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1742-1778 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1742-1778 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1742-1778 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1742-1778 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1742-1778 | skills/planning-with-files/scripts/inject-plan.py:1742-1778 \u2014 These 15 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 15 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 15 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1742}}}],"partialFingerprints":{"codehealthFindingId/v1":"7160571d074c9010dabe40497e824a4bd65a9fd197a834d3ad7a17c90ccee4db"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/session-catchup.py:76-98 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:76-98 | .codex/skills/planning-with-files/scripts/session-catchup.py:76-98 | .continue/skills/planning-with-files/scripts/session-catchup.py:76-98 | .cursor/skills/planning-with-files/scripts/session-catchup.py:76-98 | .factory/skills/planning-with-files/scripts/session-catchup.py:76-98 | .gemini/skills/planning-with-files/scripts/session-catchup.py:76-98 | .opencode/skills/planning-with-files/scripts/session-catchup.py:52-74 | .pi/skills/planning-with-files/scripts/session-catchup.py:76-98 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:73-95 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:74-96 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:77-99 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:75-97 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:74-96 | skills/planning-with-files/scripts/session-catchup.py:76-98 \u2014 These 15 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 15 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 15 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07af053bf973e76050321f2924c1195c8ca6ec35af59c0ba29454929cf58f56"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/session-catchup.py:122-144 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:122-144 | .codex/skills/planning-with-files/scripts/session-catchup.py:122-144 | .continue/skills/planning-with-files/scripts/session-catchup.py:122-144 | .cursor/skills/planning-with-files/scripts/session-catchup.py:122-144 | .factory/skills/planning-with-files/scripts/session-catchup.py:122-144 | .gemini/skills/planning-with-files/scripts/session-catchup.py:122-144 | .opencode/skills/planning-with-files/scripts/session-catchup.py:98-120 | .pi/skills/planning-with-files/scripts/session-catchup.py:122-144 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:119-141 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:120-142 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:123-145 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:121-143 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:120-142 | skills/planning-with-files/scripts/session-catchup.py:122-144 \u2014 These 15 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 15 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 15 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0707e32516020abc4c663022d0266f1d46c3e32d03fdd4b621c1ed3e8bbaa93"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/session-catchup.py:194-208 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:194-208 | .codex/skills/planning-with-files/scripts/session-catchup.py:194-208 | .continue/skills/planning-with-files/scripts/session-catchup.py:194-208 | .cursor/skills/planning-with-files/scripts/session-catchup.py:194-208 | .factory/skills/planning-with-files/scripts/session-catchup.py:194-208 | .gemini/skills/planning-with-files/scripts/session-catchup.py:194-208 | .opencode/skills/planning-with-files/scripts/session-catchup.py:170-184 | .pi/skills/planning-with-files/scripts/session-catchup.py:194-208 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:191-205 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:192-206 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:195-209 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:193-207 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:192-206 | skills/planning-with-files/scripts/session-catchup.py:194-208 \u2014 These 15 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 15 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 15 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb8cc9519901faac12a5497275a20fb66816990861c0df7d7937a3f0ed3b088"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/session-catchup.py:327-338 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:327-338 | .codex/skills/planning-with-files/scripts/session-catchup.py:327-338 | .continue/skills/planning-with-files/scripts/session-catchup.py:327-338 | .cursor/skills/planning-with-files/scripts/session-catchup.py:327-338 | .factory/skills/planning-with-files/scripts/session-catchup.py:327-338 | .gemini/skills/planning-with-files/scripts/session-catchup.py:327-338 | .opencode/skills/planning-with-files/scripts/session-catchup.py:303-314 | .pi/skills/planning-with-files/scripts/session-catchup.py:327-338 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:323-334 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:325-336 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:328-339 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:324-335 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:323-334 | skills/planning-with-files/scripts/session-catchup.py:327-338 \u2014 These 15 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 15 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 15 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf46197a2f81f85173f6b55ddf9281550699ba1b945742675f13fb9e99d71cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/session-catchup.py:358-368 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:358-368 | .codex/skills/planning-with-files/scripts/session-catchup.py:358-368 | .continue/skills/planning-with-files/scripts/session-catchup.py:358-368 | .cursor/skills/planning-with-files/scripts/session-catchup.py:358-368 | .factory/skills/planning-with-files/scripts/session-catchup.py:358-368 | .gemini/skills/planning-with-files/scripts/session-catchup.py:358-368 | .opencode/skills/planning-with-files/scripts/session-catchup.py:334-344 | .pi/skills/planning-with-files/scripts/session-catchup.py:358-368 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:354-364 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:356-366 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:359-369 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:355-365 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:354-364 | skills/planning-with-files/scripts/session-catchup.py:358-368 \u2014 These 15 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 15 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 15 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a51ccfaee9df4c6c058b9ef32c62de373a69ba42d1c0123b40b2ca39ed89e7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/session-catchup.py:372-386 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:372-386 | .codex/skills/planning-with-files/scripts/session-catchup.py:372-386 | .continue/skills/planning-with-files/scripts/session-catchup.py:372-386 | .cursor/skills/planning-with-files/scripts/session-catchup.py:372-386 | .factory/skills/planning-with-files/scripts/session-catchup.py:372-386 | .gemini/skills/planning-with-files/scripts/session-catchup.py:372-386 | .opencode/skills/planning-with-files/scripts/session-catchup.py:348-362 | .pi/skills/planning-with-files/scripts/session-catchup.py:372-386 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:368-382 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:370-384 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:373-387 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:369-383 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:368-382 | skills/planning-with-files/scripts/session-catchup.py:372-386 \u2014 These 15 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 15 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 15 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b2eeb4b1e1ee056d1132e141a73de12ceaba98d8b9ba81a9db6cd4df294d58"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/session-catchup.py:787-793 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:787-793 | .codex/skills/planning-with-files/scripts/session-catchup.py:787-793 | .continue/skills/planning-with-files/scripts/session-catchup.py:787-793 | .cursor/skills/planning-with-files/scripts/session-catchup.py:787-793 | .factory/skills/planning-with-files/scripts/session-catchup.py:787-793 | .gemini/skills/planning-with-files/scripts/session-catchup.py:787-793 | .opencode/skills/planning-with-files/scripts/session-catchup.py:712-718 | .pi/skills/planning-with-files/scripts/session-catchup.py:787-793 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:498-504 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:500-506 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:503-509 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:768-774 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:498-504 | skills/planning-with-files/scripts/session-catchup.py:787-793 \u2014 These 15 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 15 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 15 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1d9a3b5f8f0d130779c5dd606976009e5c7adc3e4a567f8b20e03188869d15"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (12 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/session-catchup.py:411-420 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:411-420 | .codex/skills/planning-with-files/scripts/session-catchup.py:411-420 | .continue/skills/planning-with-files/scripts/session-catchup.py:411-420 | .cursor/skills/planning-with-files/scripts/session-catchup.py:411-420 | .factory/skills/planning-with-files/scripts/session-catchup.py:411-420 | .gemini/skills/planning-with-files/scripts/session-catchup.py:411-420 | .opencode/skills/planning-with-files/scripts/session-catchup.py:387-396 | .pi/skills/planning-with-files/scripts/session-catchup.py:411-420 | scripts/session-catchup.py:465-480 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:408-417 | skills/planning-with-files/scripts/session-catchup.py:411-420 \u2014 These 12 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 12 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 12 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"047e2e4c0ce8d5b7660a9847c4107278e15fa878b2f82010092e8658dec01896"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (11 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/session-catchup.py:392-407 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:392-407 | .codex/skills/planning-with-files/scripts/session-catchup.py:392-407 | .continue/skills/planning-with-files/scripts/session-catchup.py:392-407 | .cursor/skills/planning-with-files/scripts/session-catchup.py:392-407 | .factory/skills/planning-with-files/scripts/session-catchup.py:392-407 | .gemini/skills/planning-with-files/scripts/session-catchup.py:392-407 | .opencode/skills/planning-with-files/scripts/session-catchup.py:368-383 | .pi/skills/planning-with-files/scripts/session-catchup.py:392-407 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:389-404 | skills/planning-with-files/scripts/session-catchup.py:392-407 \u2014 These 11 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 11 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 11 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8ef244636905f02d594e6f6c6fa983f077d500c166e973b3416226c6dc0bbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (10 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/session-catchup.py:450-466 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:450-466 | .codex/skills/planning-with-files/scripts/session-catchup.py:450-466 | .continue/skills/planning-with-files/scripts/session-catchup.py:450-466 | .cursor/skills/planning-with-files/scripts/session-catchup.py:450-466 | .factory/skills/planning-with-files/scripts/session-catchup.py:450-466 | .gemini/skills/planning-with-files/scripts/session-catchup.py:450-466 | .pi/skills/planning-with-files/scripts/session-catchup.py:450-466 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:446-457 | skills/planning-with-files/scripts/session-catchup.py:450-466 \u2014 These 10 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 10 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 10 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b09b42fefceef8919a879c877d502434a74e0617aae863378f52e80266d04a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (10 members, 50\u002B identical tokens): .agents/skills/planning-with-files/scripts/session-catchup.py:807-831 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:807-831 | .codex/skills/planning-with-files/scripts/session-catchup.py:807-831 | .continue/skills/planning-with-files/scripts/session-catchup.py:807-831 | .cursor/skills/planning-with-files/scripts/session-catchup.py:807-831 | .factory/skills/planning-with-files/scripts/session-catchup.py:807-831 | .gemini/skills/planning-with-files/scripts/session-catchup.py:807-831 | .pi/skills/planning-with-files/scripts/session-catchup.py:807-831 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:788-807 | skills/planning-with-files/scripts/session-catchup.py:807-831 \u2014 These 10 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 10 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 10 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33156ae942fa199b3a6dc67d2873d50420426b3f66ce08d40e2d2aac4737672"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): skills/i18n/planning-with-files-ar/scripts/session-catchup.py:388-399 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:390-401 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:393-404 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:388-399 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-ar/scripts/session-catchup.py"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6baf871e3cbf55874aca94e0c352b5bee04a5d7477a2a2f53c57454f540568"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (114 corresponding lines): .hermes/skills/planning-with-files/scripts/session-catchup.py:477-594 | scripts/session-catchup.py:711-824 \u2014 These two members are one piece of code written twice and then edited apart: 114 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"474288a069a1bc52015a5e12db17568a771176085d11bc7b4bdae1c992a7419a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (72 corresponding lines): .hermes/skills/planning-with-files/scripts/sync-ide-folders.py:219-290 | scripts/sync-ide-folders.py:404-484 \u2014 These two members are one piece of code written twice and then edited apart: 72 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/skills/planning-with-files/scripts/sync-ide-folders.py"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0e94e02abe7b4929aa5a41474ef218c1dbb85d938ec5a50dea781781aaf8b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 71\u002B corresponding lines): skills/i18n/planning-with-files-ar/scripts/session-catchup.py:631-701 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:633-703 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:639-710 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:631-701 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 71 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-ar/scripts/session-catchup.py"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ef5e6304720c719d2f87d4ca58b3131fabbe9599bb694b696628ccb65c83ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): .opencode/skills/planning-with-files/scripts/session-catchup.py:400-421 | scripts/session-catchup.py:484-509 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".opencode/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3fe80c772efeef37d453f2b9f05fed77f001f88e0c33518fafa1d1a1d6d5273"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): .hermes/skills/planning-with-files/scripts/session-catchup.py:350-389 | scripts/session-catchup.py:327-366 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"848050683d74b6f93083d246cbd689ff37658156e4abb312670672512b61a78f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): .hermes/skills/planning-with-files/scripts/sync-ide-folders.py:57-98 | scripts/sync-ide-folders.py:108-156 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/skills/planning-with-files/scripts/sync-ide-folders.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"48826f23fbb4f719e401ecb2f0fb968f229ce0926da9ba382b50dcef2c7287e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): .hermes/plugins/planning-with-files/paths.py:78-90 | .hermes/plugins/planning-with-files/paths.py:99-114 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/plugins/planning-with-files/paths.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9d981ff901b267a9425e53503799accac79c591f6b718421f8777b514c4913"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): .codex/hooks/permission_request.py:14-36 | .codex/hooks/pre_tool_use.py:8-36 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/hooks/permission_request.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec33a25ccc085732ade59cb00880a15e9fccf5322dd4e691be5d2ff34c632a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): .hermes/skills/planning-with-files/scripts/session-catchup.py:150-153 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:118-121 | scripts/session-catchup.py:156-159 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db69fc27f4d8cf22d58bf25eae2fdf6e12058d1c312555690ebe05ab9d6b495"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): .hermes/skills/planning-with-files/scripts/session-catchup.py:333-346 | scripts/session-catchup.py:310-323 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"13940912f560887ec0fdcd5d7223c374507aed730f811d4a9252a342b06e6bee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): .codex/hooks/context_frame.py:40-43 | .hermes/plugins/planning-with-files/context_frame.py:40-43 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/hooks/context_frame.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3310b17e946652be559a4b51500d9a913e3c2141b13a9e30c24e683e8e40dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (418 lines \u00D7 15): .agents/skills/planning-with-files/scripts/inject-plan.py:949-1366 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:949-1366 | .codex/skills/planning-with-files/scripts/inject-plan.py:949-1366 | .cursor/skills/planning-with-files/scripts/inject-plan.py:949-1366 | .factory/skills/planning-with-files/scripts/inject-plan.py:949-1366 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:949-1366 | .opencode/skills/planning-with-files/scripts/inject-plan.py:949-1366 | .pi/skills/planning-with-files/scripts/inject-plan.py:949-1366 | scripts/inject-plan.py:949-1366 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:949-1366 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:949-1366 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:949-1366 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:949-1366 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:949-1366 | skills/planning-with-files/scripts/inject-plan.py:949-1366 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/inject-plan.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/inject-plan.py\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 1405 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"67985aab6c5c08bbd574c52f977eb51f2455488da55b9d648ecf3e64ed3ccd17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (122 lines \u00D7 15): .agents/skills/planning-with-files/scripts/inject-plan.py:525-646 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:525-646 | .codex/skills/planning-with-files/scripts/inject-plan.py:525-646 | .cursor/skills/planning-with-files/scripts/inject-plan.py:525-646 | .factory/skills/planning-with-files/scripts/inject-plan.py:525-646 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:525-646 | .opencode/skills/planning-with-files/scripts/inject-plan.py:525-646 | .pi/skills/planning-with-files/scripts/inject-plan.py:525-646 | scripts/inject-plan.py:525-646 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:525-646 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:525-646 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:525-646 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:525-646 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:525-646 | skills/planning-with-files/scripts/inject-plan.py:525-646 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/inject-plan.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/inject-plan.py\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 1405 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b7658e5c78ea252cbee9f199eea0c6263aee21cf76bb676f9d9c6115cf50cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (99 lines \u00D7 15): .agents/skills/planning-with-files/scripts/inject-plan.py:654-752 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:654-752 | .codex/skills/planning-with-files/scripts/inject-plan.py:654-752 | .cursor/skills/planning-with-files/scripts/inject-plan.py:654-752 | .factory/skills/planning-with-files/scripts/inject-plan.py:654-752 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:654-752 | .opencode/skills/planning-with-files/scripts/inject-plan.py:654-752 | .pi/skills/planning-with-files/scripts/inject-plan.py:654-752 | scripts/inject-plan.py:654-752 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:654-752 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:654-752 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:654-752 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:654-752 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:654-752 | skills/planning-with-files/scripts/inject-plan.py:654-752 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/inject-plan.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/inject-plan.py\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 1405 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d7e54c8d25fa6e9862c3feb337e6637df0d0372b688ff431e9629e0f9ee60d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (93 lines \u00D7 2): .hermes/skills/planning-with-files/scripts/session-catchup.py:493-585 | scripts/session-catchup.py:723-815 \u2014 before extracting anything, compare \u0060.hermes/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 499 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".hermes/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbeec2c9d143b3625aaf709db450b4d5649b93708dc4c7026e176c3e9b057bab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (88 lines \u00D7 15): .agents/skills/planning-with-files/scripts/inject-plan.py:434-521 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:434-521 | .codex/skills/planning-with-files/scripts/inject-plan.py:434-521 | .cursor/skills/planning-with-files/scripts/inject-plan.py:434-521 | .factory/skills/planning-with-files/scripts/inject-plan.py:434-521 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:434-521 | .opencode/skills/planning-with-files/scripts/inject-plan.py:434-521 | .pi/skills/planning-with-files/scripts/inject-plan.py:434-521 | scripts/inject-plan.py:434-521 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:434-521 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:434-521 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:434-521 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:434-521 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:434-521 | skills/planning-with-files/scripts/inject-plan.py:434-521 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/inject-plan.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/inject-plan.py\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 1405 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b5c2325045b25d39c55a241301dbe3578acf9678ccdc53158c183461983d99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (75\u201382 lines \u00D7 11): .agents/skills/planning-with-files/scripts/session-catchup.py:529-610 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:529-610 | .codex/skills/planning-with-files/scripts/session-catchup.py:529-610 | .continue/skills/planning-with-files/scripts/session-catchup.py:529-610 | .cursor/skills/planning-with-files/scripts/session-catchup.py:529-610 | .factory/skills/planning-with-files/scripts/session-catchup.py:529-610 | .gemini/skills/planning-with-files/scripts/session-catchup.py:529-610 | .opencode/skills/planning-with-files/scripts/session-catchup.py:454-535 | .pi/skills/planning-with-files/scripts/session-catchup.py:529-610 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:520-594 | skills/planning-with-files/scripts/session-catchup.py:529-610 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f9eef487d9d2bfebbc79ee3bd9ac18805fcdfbfe00e707e85290bb104be823"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (78 lines \u00D7 15): .agents/skills/planning-with-files/scripts/inject-plan.py:1493-1570 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1493-1570 | .codex/skills/planning-with-files/scripts/inject-plan.py:1493-1570 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1493-1570 | .factory/skills/planning-with-files/scripts/inject-plan.py:1493-1570 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1493-1570 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1493-1570 | .pi/skills/planning-with-files/scripts/inject-plan.py:1493-1570 | scripts/inject-plan.py:1493-1570 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1493-1570 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1493-1570 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1493-1570 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1493-1570 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1493-1570 | skills/planning-with-files/scripts/inject-plan.py:1493-1570 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/inject-plan.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/inject-plan.py\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 1405 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1493}}}],"partialFingerprints":{"codehealthFindingId/v1":"180745dd8c735d9847bcbba8650ca36d09cd623372d79b60b9cbe32753e86878"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (64 lines \u00D7 2): .codex/hooks/context_frame.py:82-145 | .hermes/plugins/planning-with-files/context_frame.py:82-145 \u2014 before extracting anything, compare \u0060.codex/hooks/context_frame.py\u0060 and \u0060.hermes/plugins/planning-with-files/context_frame.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 229 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".codex/hooks/context_frame.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"d592672490ecf1eeb452bef83d9dbae9dec94f07beb414044766420d9ffad269"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (81 lines \u00D7 15): .agents/skills/planning-with-files/scripts/inject-plan.py:350-430 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:350-430 | .codex/skills/planning-with-files/scripts/inject-plan.py:350-430 | .cursor/skills/planning-with-files/scripts/inject-plan.py:350-430 | .factory/skills/planning-with-files/scripts/inject-plan.py:350-430 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:350-430 | .opencode/skills/planning-with-files/scripts/inject-plan.py:350-430 | .pi/skills/planning-with-files/scripts/inject-plan.py:350-430 | scripts/inject-plan.py:350-430 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:350-430 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:350-430 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:350-430 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:350-430 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:350-430 | skills/planning-with-files/scripts/inject-plan.py:350-430 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/inject-plan.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/inject-plan.py\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 1405 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e272432b937be4f1fb7204348b9834f994c3e48bce9cfba09e959b65c4e0012"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (48 lines \u00D7 15): .agents/skills/planning-with-files/scripts/inject-plan.py:1378-1425 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1378-1425 | .codex/skills/planning-with-files/scripts/inject-plan.py:1378-1425 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1378-1425 | .factory/skills/planning-with-files/scripts/inject-plan.py:1378-1425 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1378-1425 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1378-1425 | .pi/skills/planning-with-files/scripts/inject-plan.py:1378-1425 | scripts/inject-plan.py:1378-1425 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1378-1425 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1378-1425 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1378-1425 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1378-1425 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1378-1425 | skills/planning-with-files/scripts/inject-plan.py:1378-1425 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/inject-plan.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/inject-plan.py\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 1405 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae07b2940fb0f6437f70b71c78100d24f1013a8eaacd159a5798aa0d238e5dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42\u201344 lines \u00D7 11): .agents/skills/planning-with-files/scripts/session-catchup.py:925-968 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:925-968 | .codex/skills/planning-with-files/scripts/session-catchup.py:925-968 | .continue/skills/planning-with-files/scripts/session-catchup.py:925-968 | .cursor/skills/planning-with-files/scripts/session-catchup.py:925-968 | .factory/skills/planning-with-files/scripts/session-catchup.py:925-968 | .gemini/skills/planning-with-files/scripts/session-catchup.py:925-968 | .opencode/skills/planning-with-files/scripts/session-catchup.py:816-859 | .pi/skills/planning-with-files/scripts/session-catchup.py:925-968 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:899-940 | skills/planning-with-files/scripts/session-catchup.py:925-968 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"879f9eca04e0915ce3569f7facb84a4d635d3c195b57a5f21e318be0b9d1f852"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 15): .agents/skills/planning-with-files/scripts/session-catchup.py:950-996 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:950-996 | .codex/skills/planning-with-files/scripts/session-catchup.py:950-996 | .continue/skills/planning-with-files/scripts/session-catchup.py:950-996 | .cursor/skills/planning-with-files/scripts/session-catchup.py:950-996 | .factory/skills/planning-with-files/scripts/session-catchup.py:950-996 | .gemini/skills/planning-with-files/scripts/session-catchup.py:950-996 | .opencode/skills/planning-with-files/scripts/session-catchup.py:841-887 | .pi/skills/planning-with-files/scripts/session-catchup.py:950-996 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:651-697 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:653-699 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:660-706 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:922-968 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:651-697 | skills/planning-with-files/scripts/session-catchup.py:950-996 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060.agents/skills/planning-with-files/scripts/session-catchup.py:946\u0060 calls \u0060opencode_catchup\u0060 and \u0060skills/i18n/planning-with-files-ar/scripts/session-catchup.py:648\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa63e9724780e8899e4297dd0eec19706a7786d1293b23302cecce6e86adc13c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40\u201342 lines \u00D7 2): .hermes/skills/planning-with-files/scripts/sync-ide-folders.py:57-96 | scripts/sync-ide-folders.py:108-149 \u2014 before extracting anything, compare \u0060.hermes/skills/planning-with-files/scripts/sync-ide-folders.py\u0060 and \u0060scripts/sync-ide-folders.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 151 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060scripts/sync-ide-folders.py:154\u0060 calls \u0060str\u0060 and \u0060.hermes/skills/planning-with-files/scripts/sync-ide-folders.py:98\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/skills/planning-with-files/scripts/sync-ide-folders.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52f888cdf2ac466ac1650109b7c176ef70206ea3161b46645d1f42e3c255a9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 15): .agents/skills/planning-with-files/scripts/session-catchup.py:882-921 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:882-921 | .codex/skills/planning-with-files/scripts/session-catchup.py:882-921 | .continue/skills/planning-with-files/scripts/session-catchup.py:882-921 | .cursor/skills/planning-with-files/scripts/session-catchup.py:882-921 | .factory/skills/planning-with-files/scripts/session-catchup.py:882-921 | .gemini/skills/planning-with-files/scripts/session-catchup.py:882-921 | .opencode/skills/planning-with-files/scripts/session-catchup.py:773-812 | .pi/skills/planning-with-files/scripts/session-catchup.py:882-921 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:559-598 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:590-629 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:564-603 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:856-895 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:588-627 | skills/planning-with-files/scripts/session-catchup.py:882-921 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7034fbcaf4a888d021bb3e32227127aed452b0eb14aab05433ad9270c60eeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39\u201340 lines \u00D7 12): .agents/skills/planning-with-files/scripts/session-catchup.py:565-604 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:565-604 | .codex/skills/planning-with-files/scripts/session-catchup.py:565-604 | .continue/skills/planning-with-files/scripts/session-catchup.py:565-604 | .cursor/skills/planning-with-files/scripts/session-catchup.py:565-604 | .factory/skills/planning-with-files/scripts/session-catchup.py:565-604 | .gemini/skills/planning-with-files/scripts/session-catchup.py:565-604 | .opencode/skills/planning-with-files/scripts/session-catchup.py:490-529 | .pi/skills/planning-with-files/scripts/session-catchup.py:565-604 | scripts/session-catchup.py:584-623 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:550-588 | skills/planning-with-files/scripts/session-catchup.py:565-604 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"68194e001a434e2dcb6a4461a51b438a36b288cb27de550fdcea98a950ba4f06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 15): .agents/skills/planning-with-files/scripts/session-catchup.py:734-771 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:734-771 | .codex/skills/planning-with-files/scripts/session-catchup.py:734-771 | .continue/skills/planning-with-files/scripts/session-catchup.py:734-771 | .cursor/skills/planning-with-files/scripts/session-catchup.py:734-771 | .factory/skills/planning-with-files/scripts/session-catchup.py:734-771 | .gemini/skills/planning-with-files/scripts/session-catchup.py:734-771 | .opencode/skills/planning-with-files/scripts/session-catchup.py:659-696 | .pi/skills/planning-with-files/scripts/session-catchup.py:734-771 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:445-482 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:447-484 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:450-487 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:715-752 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:445-482 | skills/planning-with-files/scripts/session-catchup.py:734-771 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"c262673727b437483a64167102fd866041309e80d0b769a50879ea915dd8e058"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 15): .agents/skills/planning-with-files/scripts/inject-plan.py:1742-1778 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1742-1778 | .codex/skills/planning-with-files/scripts/inject-plan.py:1742-1778 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1742-1778 | .factory/skills/planning-with-files/scripts/inject-plan.py:1742-1778 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1742-1778 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1742-1778 | .pi/skills/planning-with-files/scripts/inject-plan.py:1742-1778 | scripts/inject-plan.py:1742-1778 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1742-1778 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1742-1778 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1742-1778 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1742-1778 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1742-1778 | skills/planning-with-files/scripts/inject-plan.py:1742-1778 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/inject-plan.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/inject-plan.py\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 1405 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1742}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e233eb4cb4824a3986b9ebf27e8f2d9bdb7f6d610e458f5acb21ac0fa5f0e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 15): .agents/skills/planning-with-files/scripts/session-catchup.py:148-183 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:148-183 | .codex/skills/planning-with-files/scripts/session-catchup.py:148-183 | .continue/skills/planning-with-files/scripts/session-catchup.py:148-183 | .cursor/skills/planning-with-files/scripts/session-catchup.py:148-183 | .factory/skills/planning-with-files/scripts/session-catchup.py:148-183 | .gemini/skills/planning-with-files/scripts/session-catchup.py:148-183 | .opencode/skills/planning-with-files/scripts/session-catchup.py:124-159 | .pi/skills/planning-with-files/scripts/session-catchup.py:148-183 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:145-180 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:146-181 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:149-184 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:147-182 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:146-181 | skills/planning-with-files/scripts/session-catchup.py:148-183 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"196d62672f5e2a23ddee7d27048b59d2727312aa26d692fbc8dc1f905098a125"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33\u201335 lines \u00D7 12): .agents/skills/planning-with-files/scripts/session-catchup.py:627-661 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:627-661 | .codex/skills/planning-with-files/scripts/session-catchup.py:627-661 | .continue/skills/planning-with-files/scripts/session-catchup.py:627-661 | .cursor/skills/planning-with-files/scripts/session-catchup.py:627-661 | .factory/skills/planning-with-files/scripts/session-catchup.py:627-661 | .gemini/skills/planning-with-files/scripts/session-catchup.py:627-661 | .opencode/skills/planning-with-files/scripts/session-catchup.py:552-586 | .pi/skills/planning-with-files/scripts/session-catchup.py:627-661 | scripts/session-catchup.py:646-680 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:610-642 | skills/planning-with-files/scripts/session-catchup.py:627-661 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f69a72087c7cf6d785ca29cb5c80aee47f68446cacf4f26bf9d47d9a78a431d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): .hermes/skills/planning-with-files/scripts/sync-ide-folders.py:219-252 | scripts/sync-ide-folders.py:404-437 \u2014 before extracting anything, compare \u0060.hermes/skills/planning-with-files/scripts/sync-ide-folders.py\u0060 and \u0060scripts/sync-ide-folders.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 151 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".hermes/skills/planning-with-files/scripts/sync-ide-folders.py"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d606e78a62c56690745299d38460be64d13e5b9842ca1827bfa644cc506d178"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): .hermes/skills/planning-with-files/scripts/session-catchup.py:359-389 | scripts/session-catchup.py:336-366 \u2014 before extracting anything, compare \u0060.hermes/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 499 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".hermes/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6486a08b9fef73884ebbd32b3e9275dd0d94da6957dc2eb8c463e85d8777e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 15): .agents/skills/planning-with-files/scripts/session-catchup.py:837-866 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:837-866 | .codex/skills/planning-with-files/scripts/session-catchup.py:837-866 | .continue/skills/planning-with-files/scripts/session-catchup.py:837-866 | .cursor/skills/planning-with-files/scripts/session-catchup.py:837-866 | .factory/skills/planning-with-files/scripts/session-catchup.py:837-866 | .gemini/skills/planning-with-files/scripts/session-catchup.py:837-866 | .opencode/skills/planning-with-files/scripts/session-catchup.py:733-762 | .pi/skills/planning-with-files/scripts/session-catchup.py:837-866 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:519-548 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:550-579 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:524-553 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:813-842 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:548-577 | skills/planning-with-files/scripts/session-catchup.py:837-866 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060.agents/skills/planning-with-files/scripts/session-catchup.py:867\u0060 calls \u0060get\u0060, \u0060isinstance\u0060 and \u0060.opencode/skills/planning-with-files/scripts/session-catchup.py:763\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1e1b8d601996cb849b08c15fbd85789ddb07824b2bfd6af0bdfc0ef40568a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): .codex/hooks/context_frame.py:260-288 | .hermes/plugins/planning-with-files/context_frame.py:260-288 \u2014 before extracting anything, compare \u0060.codex/hooks/context_frame.py\u0060 and \u0060.hermes/plugins/planning-with-files/context_frame.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 229 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/hooks/context_frame.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cdf95ee73a3e4ec6618ac7fe80f7887547f20cd674075065e882afde49e5300"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 15): .agents/skills/planning-with-files/scripts/inject-plan.py:778-805 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:778-805 | .codex/skills/planning-with-files/scripts/inject-plan.py:778-805 | .cursor/skills/planning-with-files/scripts/inject-plan.py:778-805 | .factory/skills/planning-with-files/scripts/inject-plan.py:778-805 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:778-805 | .opencode/skills/planning-with-files/scripts/inject-plan.py:778-805 | .pi/skills/planning-with-files/scripts/inject-plan.py:778-805 | scripts/inject-plan.py:778-805 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:778-805 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:778-805 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:778-805 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:778-805 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:778-805 | skills/planning-with-files/scripts/inject-plan.py:778-805 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/inject-plan.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/inject-plan.py\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 1405 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a53a6af14d77b1ca96202da84d297800752b2225148b510e0da60373aec0a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 15): .agents/skills/planning-with-files/scripts/inject-plan.py:1673-1700 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1673-1700 | .codex/skills/planning-with-files/scripts/inject-plan.py:1673-1700 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1673-1700 | .factory/skills/planning-with-files/scripts/inject-plan.py:1673-1700 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1673-1700 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1673-1700 | .pi/skills/planning-with-files/scripts/inject-plan.py:1673-1700 | scripts/inject-plan.py:1673-1700 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1673-1700 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1673-1700 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1673-1700 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1673-1700 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1673-1700 | skills/planning-with-files/scripts/inject-plan.py:1673-1700 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/inject-plan.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/inject-plan.py\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 1405 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95339a1a1ead3a05d925ddd7e83e26de84b85e58f5ad40cf1e4faffb7832d97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 18): .agents/skills/planning-with-files/scripts/session-catchup.py:276-301 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:276-301 | .codex/skills/planning-with-files/scripts/session-catchup.py:276-301 | .continue/skills/planning-with-files/scripts/session-catchup.py:276-301 | .cursor/skills/planning-with-files/scripts/session-catchup.py:276-301 | .factory/skills/planning-with-files/scripts/session-catchup.py:276-301 | .gemini/skills/planning-with-files/scripts/session-catchup.py:276-301 | .hermes/skills/planning-with-files/scripts/session-catchup.py:278-303 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:246-271 | .opencode/skills/planning-with-files/scripts/session-catchup.py:252-277 | .pi/skills/planning-with-files/scripts/session-catchup.py:276-301 | scripts/session-catchup.py:255-280 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:273-298 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:274-299 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:277-302 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:274-299 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:273-298 | skills/planning-with-files/scripts/session-catchup.py:276-301 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060.agents/skills/planning-with-files/scripts/session-catchup.py:276\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":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3cb59f68ed7faee188a418dc94652dfae14a9c003359e61c0abf361616a4062"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (81 lines \u00D7 15): .agents/skills/planning-with-files/scripts/inject-plan.py:809-889 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:809-889 | .codex/skills/planning-with-files/scripts/inject-plan.py:809-889 | .cursor/skills/planning-with-files/scripts/inject-plan.py:809-889 | .factory/skills/planning-with-files/scripts/inject-plan.py:809-889 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:809-889 | .opencode/skills/planning-with-files/scripts/inject-plan.py:809-889 | .pi/skills/planning-with-files/scripts/inject-plan.py:809-889 | scripts/inject-plan.py:809-889 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:809-889 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:809-889 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:809-889 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:809-889 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:809-889 | skills/planning-with-files/scripts/inject-plan.py:809-889 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/inject-plan.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/inject-plan.py\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 1405 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"75af31ba1f3fce08972f3e8e92990c80508711d865f65b96ba0a41da2fc52f16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (55 lines \u00D7 2): .hermes/skills/planning-with-files/scripts/session-catchup.py:419-473 | scripts/session-catchup.py:396-450 \u2014 before extracting anything, compare \u0060.hermes/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 499 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".hermes/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d6f13ab09389a585689edd5f6b282cf86d32d77705e8113cb40e65c2a5d1b83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201325 lines \u00D7 10): .agents/skills/planning-with-files/scripts/session-catchup.py:807-831 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:807-831 | .codex/skills/planning-with-files/scripts/session-catchup.py:807-831 | .continue/skills/planning-with-files/scripts/session-catchup.py:807-831 | .cursor/skills/planning-with-files/scripts/session-catchup.py:807-831 | .factory/skills/planning-with-files/scripts/session-catchup.py:807-831 | .gemini/skills/planning-with-files/scripts/session-catchup.py:807-831 | .pi/skills/planning-with-files/scripts/session-catchup.py:807-831 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:788-807 | skills/planning-with-files/scripts/session-catchup.py:807-831 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1f9271ced5c824b9630317f9e4aee6d1173f0862c62b548880b9260669d4a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): .codex/hooks/context_frame.py:292-316 | .hermes/plugins/planning-with-files/context_frame.py:292-316 \u2014 before extracting anything, compare \u0060.codex/hooks/context_frame.py\u0060 and \u0060.hermes/plugins/planning-with-files/context_frame.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 229 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".codex/hooks/context_frame.py"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"8496d03e8c730eb675e46dda5a41043aa233d15b47111dc3e343a500c5ace878"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 15): .agents/skills/planning-with-files/scripts/session-catchup.py:76-98 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:76-98 | .codex/skills/planning-with-files/scripts/session-catchup.py:76-98 | .continue/skills/planning-with-files/scripts/session-catchup.py:76-98 | .cursor/skills/planning-with-files/scripts/session-catchup.py:76-98 | .factory/skills/planning-with-files/scripts/session-catchup.py:76-98 | .gemini/skills/planning-with-files/scripts/session-catchup.py:76-98 | .opencode/skills/planning-with-files/scripts/session-catchup.py:52-74 | .pi/skills/planning-with-files/scripts/session-catchup.py:76-98 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:73-95 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:74-96 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:77-99 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:75-97 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:74-96 | skills/planning-with-files/scripts/session-catchup.py:76-98 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ea114cbe7db13f66ddd4b016b1df7ad28b22e0a23531de431b19261fb05dcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 15): .agents/skills/planning-with-files/scripts/session-catchup.py:122-144 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:122-144 | .codex/skills/planning-with-files/scripts/session-catchup.py:122-144 | .continue/skills/planning-with-files/scripts/session-catchup.py:122-144 | .cursor/skills/planning-with-files/scripts/session-catchup.py:122-144 | .factory/skills/planning-with-files/scripts/session-catchup.py:122-144 | .gemini/skills/planning-with-files/scripts/session-catchup.py:122-144 | .opencode/skills/planning-with-files/scripts/session-catchup.py:98-120 | .pi/skills/planning-with-files/scripts/session-catchup.py:122-144 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:119-141 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:120-142 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:123-145 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:121-143 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:120-142 | skills/planning-with-files/scripts/session-catchup.py:122-144 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060.agents/skills/planning-with-files/scripts/session-catchup.py:122\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":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab79b740c4cbf2fd2d06098834827f524022f841a3e1a3f62a44775ff5fae0c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 15): .agents/skills/planning-with-files/scripts/inject-plan.py:1703-1723 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1703-1723 | .codex/skills/planning-with-files/scripts/inject-plan.py:1703-1723 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1703-1723 | .factory/skills/planning-with-files/scripts/inject-plan.py:1703-1723 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1703-1723 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1703-1723 | .pi/skills/planning-with-files/scripts/inject-plan.py:1703-1723 | scripts/inject-plan.py:1703-1723 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1703-1723 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1703-1723 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1703-1723 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1703-1723 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1703-1723 | skills/planning-with-files/scripts/inject-plan.py:1703-1723 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/inject-plan.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/inject-plan.py\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 1405 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1703}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4284ed0aa50957887ddbdee17495ff3fb88acca783c75388f203a72caa2ece6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 3): .hermes/skills/planning-with-files/scripts/session-catchup.py:409-429 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:330-348 | scripts/session-catchup.py:386-406 \u2014 before extracting anything, compare \u0060.hermes/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.mastracode/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 238 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060.hermes/skills/planning-with-files/scripts/session-catchup.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. 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":".hermes/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11b79564386f80b8b7f8ef99f044b043def798df19a46209517f6bda828e053"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 3): .hermes/skills/planning-with-files/scripts/session-catchup.py:434-454 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:351-369 | scripts/session-catchup.py:411-431 \u2014 before extracting anything, compare \u0060.hermes/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.mastracode/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 238 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060.hermes/skills/planning-with-files/scripts/session-catchup.py:434\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":".hermes/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f77eaed443cae90d3adbe57cd2b2102b036c9b3c7d0f0114cb69ac0dedec7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): .codex/hooks/context_frame.py:228-248 | .hermes/plugins/planning-with-files/context_frame.py:228-248 \u2014 before extracting anything, compare \u0060.codex/hooks/context_frame.py\u0060 and \u0060.hermes/plugins/planning-with-files/context_frame.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 229 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/hooks/context_frame.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec5516c2f9a238a243b9bc80c70ffbf5b847bcbd48cff7f68d79efb0cca1acb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 15): .agents/skills/planning-with-files/scripts/inject-plan.py:278-297 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:278-297 | .codex/skills/planning-with-files/scripts/inject-plan.py:278-297 | .cursor/skills/planning-with-files/scripts/inject-plan.py:278-297 | .factory/skills/planning-with-files/scripts/inject-plan.py:278-297 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:278-297 | .opencode/skills/planning-with-files/scripts/inject-plan.py:278-297 | .pi/skills/planning-with-files/scripts/inject-plan.py:278-297 | scripts/inject-plan.py:278-297 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:278-297 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:278-297 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:278-297 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:278-297 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:278-297 | skills/planning-with-files/scripts/inject-plan.py:278-297 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/inject-plan.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/inject-plan.py\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 1405 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15d2c4780142bb134020291e5935db9a46ab476170636ac48adf482ce071f24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): .codex/hooks/context_frame.py:169-188 | .hermes/plugins/planning-with-files/context_frame.py:169-188 \u2014 before extracting anything, compare \u0060.codex/hooks/context_frame.py\u0060 and \u0060.hermes/plugins/planning-with-files/context_frame.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 229 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".codex/hooks/context_frame.py"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"032881f58b1f91c737125b4859e1b9cc2a416647965e84269ce7ccf328559a35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): .hermes/skills/planning-with-files/scripts/sync-ide-folders.py:173-192 | scripts/sync-ide-folders.py:358-377 \u2014 before extracting anything, compare \u0060.hermes/skills/planning-with-files/scripts/sync-ide-folders.py\u0060 and \u0060scripts/sync-ide-folders.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 151 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".hermes/skills/planning-with-files/scripts/sync-ide-folders.py"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae613c95c38887b991bae8d3925d4f2f26fc4e7125851dfac6e9792ef413c7ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): .hermes/skills/planning-with-files/scripts/sync-ide-folders.py:254-273 | scripts/sync-ide-folders.py:443-462 \u2014 before extracting anything, compare \u0060.hermes/skills/planning-with-files/scripts/sync-ide-folders.py\u0060 and \u0060scripts/sync-ide-folders.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 151 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/skills/planning-with-files/scripts/sync-ide-folders.py"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"82701935c819f0e5e639fb85273800acc74f061d7255da5aa0cadc6bff63ffdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 18): .agents/skills/planning-with-files/scripts/session-catchup.py:220-238 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:220-238 | .codex/skills/planning-with-files/scripts/session-catchup.py:220-238 | .continue/skills/planning-with-files/scripts/session-catchup.py:220-238 | .cursor/skills/planning-with-files/scripts/session-catchup.py:220-238 | .factory/skills/planning-with-files/scripts/session-catchup.py:220-238 | .gemini/skills/planning-with-files/scripts/session-catchup.py:220-238 | .hermes/skills/planning-with-files/scripts/session-catchup.py:193-211 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:161-179 | .opencode/skills/planning-with-files/scripts/session-catchup.py:196-214 | .pi/skills/planning-with-files/scripts/session-catchup.py:220-238 | scripts/session-catchup.py:199-217 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:217-235 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:218-236 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:221-239 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:219-237 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:218-236 | skills/planning-with-files/scripts/session-catchup.py:220-238 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db8a828146a2199ff0a284332ba2fe93ed4b2fba27a7fce6bbfd879aaef3931"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 15): .agents/skills/planning-with-files/scripts/inject-plan.py:184-202 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:184-202 | .codex/skills/planning-with-files/scripts/inject-plan.py:184-202 | .cursor/skills/planning-with-files/scripts/inject-plan.py:184-202 | .factory/skills/planning-with-files/scripts/inject-plan.py:184-202 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:184-202 | .opencode/skills/planning-with-files/scripts/inject-plan.py:184-202 | .pi/skills/planning-with-files/scripts/inject-plan.py:184-202 | scripts/inject-plan.py:184-202 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:184-202 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:184-202 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:184-202 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:184-202 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:184-202 | skills/planning-with-files/scripts/inject-plan.py:184-202 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/inject-plan.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/inject-plan.py\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 1405 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a122ebcb8e6ccc675b6b54c645b319a5b01f676b9c189612487f378bb0cf3fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 15): .agents/skills/planning-with-files/scripts/inject-plan.py:1471-1489 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1471-1489 | .codex/skills/planning-with-files/scripts/inject-plan.py:1471-1489 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1471-1489 | .factory/skills/planning-with-files/scripts/inject-plan.py:1471-1489 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1471-1489 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1471-1489 | .pi/skills/planning-with-files/scripts/inject-plan.py:1471-1489 | scripts/inject-plan.py:1471-1489 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1471-1489 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1471-1489 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1471-1489 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1471-1489 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1471-1489 | skills/planning-with-files/scripts/inject-plan.py:1471-1489 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/inject-plan.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/inject-plan.py\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 1405 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1471}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad766312e1bb9564deac1ee55e0153b236ed787c40035f1262bf149ed3debbb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): .codex/hooks/context_frame.py:47-65 | .hermes/plugins/planning-with-files/context_frame.py:47-65 \u2014 before extracting anything, compare \u0060.codex/hooks/context_frame.py\u0060 and \u0060.hermes/plugins/planning-with-files/context_frame.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 229 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".codex/hooks/context_frame.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26958a8ade56e9495d63cce63de3566a273fcb9bcfb9aafd40cf8dd0ae0168b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 13): .agents/skills/planning-with-files/scripts/session-catchup.py:667-681 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:667-681 | .codex/skills/planning-with-files/scripts/session-catchup.py:667-681 | .continue/skills/planning-with-files/scripts/session-catchup.py:667-681 | .cursor/skills/planning-with-files/scripts/session-catchup.py:667-681 | .factory/skills/planning-with-files/scripts/session-catchup.py:667-681 | .gemini/skills/planning-with-files/scripts/session-catchup.py:667-681 | .hermes/skills/planning-with-files/scripts/session-catchup.py:563-580 | .opencode/skills/planning-with-files/scripts/session-catchup.py:592-606 | .pi/skills/planning-with-files/scripts/session-catchup.py:667-681 | scripts/session-catchup.py:686-700 | scripts/session-catchup.py:793-810 | skills/planning-with-files/scripts/session-catchup.py:667-681 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eaa0a5224826a6da7b2cfe30800b73bde441f22477d48bc5b13d4723ef54094"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 12): .agents/skills/planning-with-files/scripts/session-catchup.py:606-623 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:606-623 | .codex/skills/planning-with-files/scripts/session-catchup.py:606-623 | .continue/skills/planning-with-files/scripts/session-catchup.py:606-623 | .cursor/skills/planning-with-files/scripts/session-catchup.py:606-623 | .factory/skills/planning-with-files/scripts/session-catchup.py:606-623 | .gemini/skills/planning-with-files/scripts/session-catchup.py:606-623 | .opencode/skills/planning-with-files/scripts/session-catchup.py:531-548 | .pi/skills/planning-with-files/scripts/session-catchup.py:606-623 | scripts/session-catchup.py:625-642 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:590-607 | skills/planning-with-files/scripts/session-catchup.py:606-623 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec0e14f043c4b97943a274a536a8678c4074bf52908d566d52eaa781ed44bbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): .hermes/skills/planning-with-files/scripts/session-catchup.py:93-110 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:66-83 | scripts/session-catchup.py:99-116 \u2014 before extracting anything, compare \u0060.hermes/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.mastracode/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 238 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"275164819b0a3dec81e0ef531af911f753c8a0a08d4f2c6c509cabe484d2fbfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): .hermes/skills/planning-with-files/scripts/session-catchup.py:157-174 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:125-142 | scripts/session-catchup.py:163-180 \u2014 before extracting anything, compare \u0060.hermes/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.mastracode/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 238 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".hermes/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3be9a034d503176aecdc12ca1027f7bb1771edb8ceb5d1e6e3646af74dfc8dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 18): .agents/skills/planning-with-files/scripts/session-catchup.py:509-525 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:509-525 | .codex/skills/planning-with-files/scripts/session-catchup.py:509-525 | .continue/skills/planning-with-files/scripts/session-catchup.py:509-525 | .cursor/skills/planning-with-files/scripts/session-catchup.py:509-525 | .factory/skills/planning-with-files/scripts/session-catchup.py:509-525 | .gemini/skills/planning-with-files/scripts/session-catchup.py:509-525 | .hermes/skills/planning-with-files/scripts/session-catchup.py:243-259 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:211-227 | .opencode/skills/planning-with-files/scripts/session-catchup.py:434-450 | .pi/skills/planning-with-files/scripts/session-catchup.py:509-525 | scripts/session-catchup.py:522-538 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:611-627 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:529-545 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:619-635 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:500-516 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:527-543 | skills/planning-with-files/scripts/session-catchup.py:509-525 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7089658a8742d5b2750ebc99cdf0058e226414845c27937a93acd40ba421d48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201317 lines \u00D7 10): .agents/skills/planning-with-files/scripts/session-catchup.py:450-466 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:450-466 | .codex/skills/planning-with-files/scripts/session-catchup.py:450-466 | .continue/skills/planning-with-files/scripts/session-catchup.py:450-466 | .cursor/skills/planning-with-files/scripts/session-catchup.py:450-466 | .factory/skills/planning-with-files/scripts/session-catchup.py:450-466 | .gemini/skills/planning-with-files/scripts/session-catchup.py:450-466 | .pi/skills/planning-with-files/scripts/session-catchup.py:450-466 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:446-457 | skills/planning-with-files/scripts/session-catchup.py:450-466 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"440582821493e22087b327376fa9dd290817c712877cb0ad1ec8ef70403bacfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): .codex/hooks/context_frame.py:149-165 | .hermes/plugins/planning-with-files/context_frame.py:149-165 \u2014 before extracting anything, compare \u0060.codex/hooks/context_frame.py\u0060 and \u0060.hermes/plugins/planning-with-files/context_frame.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 229 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".codex/hooks/context_frame.py"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"247b5e556c15fe4682970fea9fd208def75b640a365722a0a9b39ad3c47f6c44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): .hermes/skills/planning-with-files/scripts/sync-ide-folders.py:274-290 | scripts/sync-ide-folders.py:468-484 \u2014 before extracting anything, compare \u0060.hermes/skills/planning-with-files/scripts/sync-ide-folders.py\u0060 and \u0060scripts/sync-ide-folders.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 151 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/skills/planning-with-files/scripts/sync-ide-folders.py"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c011e45febb5c5f9be378f76c811aa05db607a9fcb3d315d739c3c94fbecfd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201316 lines \u00D7 12): .agents/skills/planning-with-files/scripts/session-catchup.py:411-420 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:411-420 | .codex/skills/planning-with-files/scripts/session-catchup.py:411-420 | .continue/skills/planning-with-files/scripts/session-catchup.py:411-420 | .cursor/skills/planning-with-files/scripts/session-catchup.py:411-420 | .factory/skills/planning-with-files/scripts/session-catchup.py:411-420 | .gemini/skills/planning-with-files/scripts/session-catchup.py:411-420 | .opencode/skills/planning-with-files/scripts/session-catchup.py:387-396 | .pi/skills/planning-with-files/scripts/session-catchup.py:411-420 | scripts/session-catchup.py:465-480 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:408-417 | skills/planning-with-files/scripts/session-catchup.py:411-420 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"803c5913526312c42e2e5d64751d45d8d2e6bddd0a6ccd0b308897de3fe98614"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 12): .agents/skills/planning-with-files/scripts/session-catchup.py:547-561 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:547-561 | .codex/skills/planning-with-files/scripts/session-catchup.py:547-561 | .continue/skills/planning-with-files/scripts/session-catchup.py:547-561 | .cursor/skills/planning-with-files/scripts/session-catchup.py:547-561 | .factory/skills/planning-with-files/scripts/session-catchup.py:547-561 | .gemini/skills/planning-with-files/scripts/session-catchup.py:547-561 | .opencode/skills/planning-with-files/scripts/session-catchup.py:472-486 | .pi/skills/planning-with-files/scripts/session-catchup.py:547-561 | scripts/session-catchup.py:565-580 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:533-547 | skills/planning-with-files/scripts/session-catchup.py:547-561 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f2d180394873b77cc111d7a87ed61b8c48018dcbc52ac0d64958f552da240e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 12): .agents/skills/planning-with-files/scripts/session-catchup.py:673-688 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:673-688 | .codex/skills/planning-with-files/scripts/session-catchup.py:673-688 | .continue/skills/planning-with-files/scripts/session-catchup.py:673-688 | .cursor/skills/planning-with-files/scripts/session-catchup.py:673-688 | .factory/skills/planning-with-files/scripts/session-catchup.py:673-688 | .gemini/skills/planning-with-files/scripts/session-catchup.py:673-688 | .opencode/skills/planning-with-files/scripts/session-catchup.py:598-613 | .pi/skills/planning-with-files/scripts/session-catchup.py:673-688 | scripts/session-catchup.py:692-707 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:654-669 | skills/planning-with-files/scripts/session-catchup.py:673-688 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"941b130e60090619b263cba73a8a7fccf7d0f9a4257c3d63d96cdc3d5d6c856f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 11): .agents/skills/planning-with-files/scripts/session-catchup.py:392-407 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:392-407 | .codex/skills/planning-with-files/scripts/session-catchup.py:392-407 | .continue/skills/planning-with-files/scripts/session-catchup.py:392-407 | .cursor/skills/planning-with-files/scripts/session-catchup.py:392-407 | .factory/skills/planning-with-files/scripts/session-catchup.py:392-407 | .gemini/skills/planning-with-files/scripts/session-catchup.py:392-407 | .opencode/skills/planning-with-files/scripts/session-catchup.py:368-383 | .pi/skills/planning-with-files/scripts/session-catchup.py:392-407 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:389-404 | skills/planning-with-files/scripts/session-catchup.py:392-407 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"e276fb1d2e0b3d81180cf2c043d7265ae9c79ebf60a057d34f8583390d6ae3c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 15): .agents/skills/planning-with-files/scripts/inject-plan.py:907-921 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:907-921 | .codex/skills/planning-with-files/scripts/inject-plan.py:907-921 | .cursor/skills/planning-with-files/scripts/inject-plan.py:907-921 | .factory/skills/planning-with-files/scripts/inject-plan.py:907-921 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:907-921 | .opencode/skills/planning-with-files/scripts/inject-plan.py:907-921 | .pi/skills/planning-with-files/scripts/inject-plan.py:907-921 | scripts/inject-plan.py:907-921 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:907-921 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:907-921 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:907-921 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:907-921 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:907-921 | skills/planning-with-files/scripts/inject-plan.py:907-921 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/inject-plan.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/inject-plan.py\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 1405 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"f268c80bc1103a5557490f5200a4a6a58c840e62e1ab5328e762088f53cb0569"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 15): .agents/skills/planning-with-files/scripts/inject-plan.py:1445-1459 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1445-1459 | .codex/skills/planning-with-files/scripts/inject-plan.py:1445-1459 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1445-1459 | .factory/skills/planning-with-files/scripts/inject-plan.py:1445-1459 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1445-1459 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1445-1459 | .pi/skills/planning-with-files/scripts/inject-plan.py:1445-1459 | scripts/inject-plan.py:1445-1459 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1445-1459 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1445-1459 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1445-1459 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1445-1459 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1445-1459 | skills/planning-with-files/scripts/inject-plan.py:1445-1459 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/inject-plan.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/inject-plan.py\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 1405 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1445}}}],"partialFingerprints":{"codehealthFindingId/v1":"9008c0a669dd63cbf2159363fffc0aca4d6b64edd2acc9047540946e4b926f87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 15): .agents/skills/planning-with-files/scripts/inject-plan.py:1656-1670 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1656-1670 | .codex/skills/planning-with-files/scripts/inject-plan.py:1656-1670 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1656-1670 | .factory/skills/planning-with-files/scripts/inject-plan.py:1656-1670 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1656-1670 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1656-1670 | .pi/skills/planning-with-files/scripts/inject-plan.py:1656-1670 | scripts/inject-plan.py:1656-1670 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1656-1670 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1656-1670 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1656-1670 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1656-1670 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1656-1670 | skills/planning-with-files/scripts/inject-plan.py:1656-1670 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/inject-plan.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/inject-plan.py\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 1405 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1656}}}],"partialFingerprints":{"codehealthFindingId/v1":"784102a40ae541ebb29547147385e4b389fdd412c721cda1c03d6505f51f4b4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 15): .agents/skills/planning-with-files/scripts/session-catchup.py:194-208 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:194-208 | .codex/skills/planning-with-files/scripts/session-catchup.py:194-208 | .continue/skills/planning-with-files/scripts/session-catchup.py:194-208 | .cursor/skills/planning-with-files/scripts/session-catchup.py:194-208 | .factory/skills/planning-with-files/scripts/session-catchup.py:194-208 | .gemini/skills/planning-with-files/scripts/session-catchup.py:194-208 | .opencode/skills/planning-with-files/scripts/session-catchup.py:170-184 | .pi/skills/planning-with-files/scripts/session-catchup.py:194-208 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:191-205 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:192-206 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:195-209 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:193-207 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:192-206 | skills/planning-with-files/scripts/session-catchup.py:194-208 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"06436c0c8c325fe3a1ebaf8000f42398d3de3ec6e74a568709f8e9bde7d0b128"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 15): .agents/skills/planning-with-files/scripts/session-catchup.py:372-386 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:372-386 | .codex/skills/planning-with-files/scripts/session-catchup.py:372-386 | .continue/skills/planning-with-files/scripts/session-catchup.py:372-386 | .cursor/skills/planning-with-files/scripts/session-catchup.py:372-386 | .factory/skills/planning-with-files/scripts/session-catchup.py:372-386 | .gemini/skills/planning-with-files/scripts/session-catchup.py:372-386 | .opencode/skills/planning-with-files/scripts/session-catchup.py:348-362 | .pi/skills/planning-with-files/scripts/session-catchup.py:372-386 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:368-382 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:370-384 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:373-387 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:369-383 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:368-382 | skills/planning-with-files/scripts/session-catchup.py:372-386 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"10be78f3d4cbf5c86fe324834609a1a651222cf2e3d04769d44e6128d5b50cb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 6): .mastracode/skills/planning-with-files/scripts/session-catchup.py:367-381 | .opencode/skills/planning-with-files/scripts/session-catchup.py:765-779 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:551-565 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:582-596 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:556-570 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:580-594 \u2014 before extracting anything, compare \u0060.mastracode/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.opencode/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 148 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060.mastracode/skills/planning-with-files/scripts/session-catchup.py:367\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":".mastracode/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"1776d30107026515d9cd70133121b378457653cb39d4b104795471589dbd3dd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): .hermes/skills/planning-with-files/scripts/session-catchup.py:315-329 | scripts/session-catchup.py:292-306 \u2014 before extracting anything, compare \u0060.hermes/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 499 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5ba03bcd52d57b3be16e35cfd4d92b0628a6683cdb09ab569b44eda193b8fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): .hermes/skills/planning-with-files/scripts/session-catchup.py:61-74 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:34-47 | scripts/session-catchup.py:67-80 \u2014 before extracting anything, compare \u0060.hermes/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.mastracode/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 238 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"c37a8fb42c3657cb40a76595c0dd7d99aec038794bd5d937cd14e47f0d225f3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 15): .agents/skills/planning-with-files/scripts/inject-plan.py:928-939 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:928-939 | .codex/skills/planning-with-files/scripts/inject-plan.py:928-939 | .cursor/skills/planning-with-files/scripts/inject-plan.py:928-939 | .factory/skills/planning-with-files/scripts/inject-plan.py:928-939 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:928-939 | .opencode/skills/planning-with-files/scripts/inject-plan.py:928-939 | .pi/skills/planning-with-files/scripts/inject-plan.py:928-939 | scripts/inject-plan.py:928-939 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:928-939 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:928-939 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:928-939 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:928-939 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:928-939 | skills/planning-with-files/scripts/inject-plan.py:928-939 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/inject-plan.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/inject-plan.py\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 1405 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73af29c8ff620797e5115fc4ced3e29a56931dd0e865d25a3b37b7f7a4e074c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 15): .agents/skills/planning-with-files/scripts/inject-plan.py:1619-1630 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1619-1630 | .codex/skills/planning-with-files/scripts/inject-plan.py:1619-1630 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1619-1630 | .factory/skills/planning-with-files/scripts/inject-plan.py:1619-1630 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1619-1630 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1619-1630 | .pi/skills/planning-with-files/scripts/inject-plan.py:1619-1630 | scripts/inject-plan.py:1619-1630 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1619-1630 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1619-1630 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1619-1630 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1619-1630 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1619-1630 | skills/planning-with-files/scripts/inject-plan.py:1619-1630 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/inject-plan.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/inject-plan.py\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 1405 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1619}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b34a62a882fa90cd1382a89a0e498860dc075508d7b1f5ed3743f87abe6e3c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 15): .agents/skills/planning-with-files/scripts/session-catchup.py:327-338 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:327-338 | .codex/skills/planning-with-files/scripts/session-catchup.py:327-338 | .continue/skills/planning-with-files/scripts/session-catchup.py:327-338 | .cursor/skills/planning-with-files/scripts/session-catchup.py:327-338 | .factory/skills/planning-with-files/scripts/session-catchup.py:327-338 | .gemini/skills/planning-with-files/scripts/session-catchup.py:327-338 | .opencode/skills/planning-with-files/scripts/session-catchup.py:303-314 | .pi/skills/planning-with-files/scripts/session-catchup.py:327-338 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:323-334 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:325-336 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:328-339 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:324-335 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:323-334 | skills/planning-with-files/scripts/session-catchup.py:327-338 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a2e4be34e2bcd52c6cd77ccecd06d4f893ac3ba0594518c40928e15b598445"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): skills/i18n/planning-with-files-ar/scripts/session-catchup.py:388-399 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:390-401 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:393-404 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:388-399 \u2014 before extracting anything, compare \u0060skills/i18n/planning-with-files-ar/scripts/session-catchup.py\u0060 and \u0060skills/i18n/planning-with-files-de/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 35 separate duplicated blocks between them, totalling at least 537 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"skills/i18n/planning-with-files-ar/scripts/session-catchup.py"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb018c8851d53487bd6e71936b08d008e3dbe632476b7de840f11041be65f388"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): .hermes/skills/planning-with-files/scripts/session-catchup.py:178-189 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:146-157 | scripts/session-catchup.py:184-195 \u2014 before extracting anything, compare \u0060.hermes/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.mastracode/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 238 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"0339348d4ad90cf19e51468a2a6bb0094065682bbb651b0a88cdffee72ea1819"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 15): .agents/skills/planning-with-files/scripts/inject-plan.py:1606-1616 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1606-1616 | .codex/skills/planning-with-files/scripts/inject-plan.py:1606-1616 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1606-1616 | .factory/skills/planning-with-files/scripts/inject-plan.py:1606-1616 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1606-1616 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1606-1616 | .pi/skills/planning-with-files/scripts/inject-plan.py:1606-1616 | scripts/inject-plan.py:1606-1616 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1606-1616 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1606-1616 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1606-1616 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1606-1616 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1606-1616 | skills/planning-with-files/scripts/inject-plan.py:1606-1616 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/inject-plan.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/inject-plan.py\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 1405 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1606}}}],"partialFingerprints":{"codehealthFindingId/v1":"bddb647d04f837af47f398d0504039e147b305dace425adb0fe2285ac3193d0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 15): .agents/skills/planning-with-files/scripts/session-catchup.py:358-368 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:358-368 | .codex/skills/planning-with-files/scripts/session-catchup.py:358-368 | .continue/skills/planning-with-files/scripts/session-catchup.py:358-368 | .cursor/skills/planning-with-files/scripts/session-catchup.py:358-368 | .factory/skills/planning-with-files/scripts/session-catchup.py:358-368 | .gemini/skills/planning-with-files/scripts/session-catchup.py:358-368 | .opencode/skills/planning-with-files/scripts/session-catchup.py:334-344 | .pi/skills/planning-with-files/scripts/session-catchup.py:358-368 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:354-364 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:356-366 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:359-369 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:355-365 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:354-364 | skills/planning-with-files/scripts/session-catchup.py:358-368 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9c321b1e9907cba441f038393664f224f1d44bcc05cb17988e621d98b53fc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): .hermes/plugins/planning-with-files/paths.py:80-89 | .hermes/plugins/planning-with-files/paths.py:104-114 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060.hermes/plugins/planning-with-files/paths.py:102\u0060 calls \u0060find_skill_dir\u0060, \u0060has_skill_assets\u0060 and \u0060.hermes/plugins/planning-with-files/paths.py:79\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/plugins/planning-with-files/paths.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54febae8b30a4f6f42b950f493ca842b3165b86cc4e67b7d25b53a5c23ee1e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 15): .agents/skills/planning-with-files/scripts/inject-plan.py:265-274 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:265-274 | .codex/skills/planning-with-files/scripts/inject-plan.py:265-274 | .cursor/skills/planning-with-files/scripts/inject-plan.py:265-274 | .factory/skills/planning-with-files/scripts/inject-plan.py:265-274 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:265-274 | .opencode/skills/planning-with-files/scripts/inject-plan.py:265-274 | .pi/skills/planning-with-files/scripts/inject-plan.py:265-274 | scripts/inject-plan.py:265-274 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:265-274 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:265-274 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:265-274 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:265-274 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:265-274 | skills/planning-with-files/scripts/inject-plan.py:265-274 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/inject-plan.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/inject-plan.py\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 1405 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46aa400b7781c5a11bd588dbc581b8079542e3de840dae1a852fd17faee1c78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 15): .agents/skills/planning-with-files/scripts/inject-plan.py:324-333 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:324-333 | .codex/skills/planning-with-files/scripts/inject-plan.py:324-333 | .cursor/skills/planning-with-files/scripts/inject-plan.py:324-333 | .factory/skills/planning-with-files/scripts/inject-plan.py:324-333 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:324-333 | .opencode/skills/planning-with-files/scripts/inject-plan.py:324-333 | .pi/skills/planning-with-files/scripts/inject-plan.py:324-333 | scripts/inject-plan.py:324-333 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:324-333 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:324-333 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:324-333 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:324-333 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:324-333 | skills/planning-with-files/scripts/inject-plan.py:324-333 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/inject-plan.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/inject-plan.py\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 1405 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f80e48d34e3aae7fe832e1f4c1d70c8215fbeec62a8b855a5e6c6ba496fdf59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 11): .agents/skills/planning-with-files/scripts/session-catchup.py:470-480 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:470-480 | .codex/skills/planning-with-files/scripts/session-catchup.py:470-480 | .continue/skills/planning-with-files/scripts/session-catchup.py:470-480 | .cursor/skills/planning-with-files/scripts/session-catchup.py:470-480 | .factory/skills/planning-with-files/scripts/session-catchup.py:470-480 | .gemini/skills/planning-with-files/scripts/session-catchup.py:470-480 | .pi/skills/planning-with-files/scripts/session-catchup.py:470-480 | scripts/session-catchup.py:484-494 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:461-471 | skills/planning-with-files/scripts/session-catchup.py:470-480 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060data\u0060 to \u0060Dict[str, Any]\u0060 in one and \u0060Dict\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060.agents/skills/planning-with-files/scripts/session-catchup.py:481\u0060 calls \u0060_opencode_state_annotation\u0060 and \u0060scripts/session-catchup.py:495\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dbf0690dd8e2594cd1560aab62a8f15221bbd1debd7daf56de56730c31f4ee3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): .codex/hooks/codex_hook_adapter.py:127-136 | .codex/hooks/context_frame.py:55-64 | .hermes/plugins/planning-with-files/context_frame.py:55-64 \u2014 before extracting anything, compare \u0060.codex/hooks/context_frame.py\u0060 and \u0060.hermes/plugins/planning-with-files/context_frame.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 229 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060.codex/hooks/codex_hook_adapter.py:124\u0060 calls \u0060lstat\u0060, \u0060S_ISLNK\u0060 and \u0060.codex/hooks/context_frame.py:54\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/hooks/codex_hook_adapter.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0e97d07593e51cce12e8cada410230389d72f77e72ce24fffea6e97e917c6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): .hermes/skills/planning-with-files/scripts/session-catchup.py:582-591 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:457-466 | scripts/session-catchup.py:812-821 \u2014 before extracting anything, compare \u0060.hermes/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.mastracode/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 238 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"21199b487e7921761dc2f2587951fe85a9da727f8894964393802e19ead1bbe7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): .codex/hooks/context_frame.py:69-78 | .hermes/plugins/planning-with-files/context_frame.py:69-78 \u2014 before extracting anything, compare \u0060.codex/hooks/context_frame.py\u0060 and \u0060.hermes/plugins/planning-with-files/context_frame.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 229 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/hooks/context_frame.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"9498cb8f10892ec5adf200206826bba009beac496a651c6535a0cf538abd2a08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 16): .agents/skills/planning-with-files/scripts/session-catchup.py:745-753 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:745-753 | .codex/skills/planning-with-files/scripts/session-catchup.py:745-753 | .continue/skills/planning-with-files/scripts/session-catchup.py:745-753 | .cursor/skills/planning-with-files/scripts/session-catchup.py:745-753 | .factory/skills/planning-with-files/scripts/session-catchup.py:745-753 | .gemini/skills/planning-with-files/scripts/session-catchup.py:745-753 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:305-313 | .opencode/skills/planning-with-files/scripts/session-catchup.py:670-678 | .pi/skills/planning-with-files/scripts/session-catchup.py:745-753 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:456-464 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:458-466 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:461-469 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:726-734 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:456-464 | skills/planning-with-files/scripts/session-catchup.py:745-753 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060.agents/skills/planning-with-files/scripts/session-catchup.py:742\u0060 calls \u0060get\u0060, \u0060isinstance\u0060 and \u0060.mastracode/skills/planning-with-files/scripts/session-catchup.py:304\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85cf43839e3ced9a9cef06bac872c2c1a524a8ef04e110fbaee92474d6e990b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 18): .agents/skills/planning-with-files/scripts/session-catchup.py:993-1000 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:993-1000 | .codex/skills/planning-with-files/scripts/session-catchup.py:993-1000 | .continue/skills/planning-with-files/scripts/session-catchup.py:993-1000 | .cursor/skills/planning-with-files/scripts/session-catchup.py:993-1000 | .factory/skills/planning-with-files/scripts/session-catchup.py:993-1000 | .gemini/skills/planning-with-files/scripts/session-catchup.py:993-1000 | .hermes/skills/planning-with-files/scripts/session-catchup.py:587-594 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:462-469 | .opencode/skills/planning-with-files/scripts/session-catchup.py:884-891 | .pi/skills/planning-with-files/scripts/session-catchup.py:993-1000 | scripts/session-catchup.py:817-824 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:694-701 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:696-703 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:703-710 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:965-972 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:694-701 | skills/planning-with-files/scripts/session-catchup.py:993-1000 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2adc7450e1020cc0c92755cd2ac2f0e7a1fdbaff0a2934016c1d2ee2dc79de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 12): .agents/skills/planning-with-files/scripts/session-catchup.py:664-671 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:664-671 | .codex/skills/planning-with-files/scripts/session-catchup.py:664-671 | .continue/skills/planning-with-files/scripts/session-catchup.py:664-671 | .cursor/skills/planning-with-files/scripts/session-catchup.py:664-671 | .factory/skills/planning-with-files/scripts/session-catchup.py:664-671 | .gemini/skills/planning-with-files/scripts/session-catchup.py:664-671 | .opencode/skills/planning-with-files/scripts/session-catchup.py:589-596 | .pi/skills/planning-with-files/scripts/session-catchup.py:664-671 | scripts/session-catchup.py:683-690 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:645-652 | skills/planning-with-files/scripts/session-catchup.py:664-671 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9d6664532038d10e091c3d51774a0c8f0637ef5b17cc25c8d24bf06bab8a41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): .codex/hooks/context_frame.py:215-222 | .hermes/plugins/planning-with-files/context_frame.py:215-222 \u2014 before extracting anything, compare \u0060.codex/hooks/context_frame.py\u0060 and \u0060.hermes/plugins/planning-with-files/context_frame.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 229 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/hooks/context_frame.py"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"8376111a2819f389166a06a5e31d01497272a54400a7cf5a4c3a790f9b693861"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 18): .agents/skills/planning-with-files/scripts/session-catchup.py:166-172 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:166-172 | .codex/skills/planning-with-files/scripts/session-catchup.py:166-172 | .continue/skills/planning-with-files/scripts/session-catchup.py:166-172 | .cursor/skills/planning-with-files/scripts/session-catchup.py:166-172 | .factory/skills/planning-with-files/scripts/session-catchup.py:166-172 | .gemini/skills/planning-with-files/scripts/session-catchup.py:166-172 | .hermes/skills/planning-with-files/scripts/session-catchup.py:103-109 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:76-82 | .opencode/skills/planning-with-files/scripts/session-catchup.py:142-148 | .pi/skills/planning-with-files/scripts/session-catchup.py:166-172 | scripts/session-catchup.py:109-115 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:163-169 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:164-170 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:167-173 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:165-171 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:164-170 | skills/planning-with-files/scripts/session-catchup.py:166-172 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"372bbef6656ba5f0101ae0c987638e09d7ed48b1144b9628cd53539265182dbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 15): .agents/skills/planning-with-files/scripts/session-catchup.py:787-793 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:787-793 | .codex/skills/planning-with-files/scripts/session-catchup.py:787-793 | .continue/skills/planning-with-files/scripts/session-catchup.py:787-793 | .cursor/skills/planning-with-files/scripts/session-catchup.py:787-793 | .factory/skills/planning-with-files/scripts/session-catchup.py:787-793 | .gemini/skills/planning-with-files/scripts/session-catchup.py:787-793 | .opencode/skills/planning-with-files/scripts/session-catchup.py:712-718 | .pi/skills/planning-with-files/scripts/session-catchup.py:787-793 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:498-504 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:500-506 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:503-509 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:768-774 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:498-504 | skills/planning-with-files/scripts/session-catchup.py:787-793 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"131531e4755e012133ffe58dd3291a738ecb7ec3de79c37f7a179fa456f04760"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 10): .agents/skills/planning-with-files/scripts/session-catchup.py:477-496 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:477-496 | .codex/skills/planning-with-files/scripts/session-catchup.py:477-496 | .continue/skills/planning-with-files/scripts/session-catchup.py:477-496 | .cursor/skills/planning-with-files/scripts/session-catchup.py:477-496 | .factory/skills/planning-with-files/scripts/session-catchup.py:477-496 | .gemini/skills/planning-with-files/scripts/session-catchup.py:477-496 | .pi/skills/planning-with-files/scripts/session-catchup.py:477-496 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:468-487 | skills/planning-with-files/scripts/session-catchup.py:477-496 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d5e76a91ad9174b64214584e34e653de559149748791f17223e9690f08d2e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 8): .hermes/skills/planning-with-files/scripts/session-catchup.py:450-456 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:365-371 | .opencode/skills/planning-with-files/scripts/session-catchup.py:763-769 | scripts/session-catchup.py:427-433 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:549-555 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:580-586 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:554-560 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:578-584 \u2014 before extracting anything, compare \u0060.hermes/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.mastracode/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 238 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060.opencode/skills/planning-with-files/scripts/session-catchup.py:761\u0060 calls \u0060isinstance\u0060 and \u0060.mastracode/skills/planning-with-files/scripts/session-catchup.py:364\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b4d8dd7e6d245d9c4a66978871102d0acda571c3627ca77b897daad6c65491"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): .opencode/skills/planning-with-files/scripts/session-catchup.py:405-417 | scripts/session-catchup.py:492-504 \u2014 before extracting anything, compare \u0060.opencode/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 304 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060data\u0060 to \u0060Dict[str, Any]\u0060 in one and \u0060Dict\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".opencode/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e211c32eab23a585242a550b6b23f19ade961a0da1ea7b3adb1af9b834b9a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 18): .agents/skills/planning-with-files/scripts/session-catchup.py:242-247 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:242-247 | .codex/skills/planning-with-files/scripts/session-catchup.py:242-247 | .continue/skills/planning-with-files/scripts/session-catchup.py:242-247 | .cursor/skills/planning-with-files/scripts/session-catchup.py:242-247 | .factory/skills/planning-with-files/scripts/session-catchup.py:242-247 | .gemini/skills/planning-with-files/scripts/session-catchup.py:242-247 | .hermes/skills/planning-with-files/scripts/session-catchup.py:215-220 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:183-188 | .opencode/skills/planning-with-files/scripts/session-catchup.py:218-223 | .pi/skills/planning-with-files/scripts/session-catchup.py:242-247 | scripts/session-catchup.py:221-226 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:239-244 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:240-245 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:243-248 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:241-246 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:240-245 | skills/planning-with-files/scripts/session-catchup.py:242-247 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b9468032d97e5d0f9be096d784481de890841c6f189ffb4d8f483205a70ef6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 15): .agents/skills/planning-with-files/scripts/inject-plan.py:133-147 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:133-147 | .codex/skills/planning-with-files/scripts/inject-plan.py:133-147 | .cursor/skills/planning-with-files/scripts/inject-plan.py:133-147 | .factory/skills/planning-with-files/scripts/inject-plan.py:133-147 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:133-147 | .opencode/skills/planning-with-files/scripts/inject-plan.py:133-147 | .pi/skills/planning-with-files/scripts/inject-plan.py:133-147 | scripts/inject-plan.py:133-147 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:133-147 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:133-147 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:133-147 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:133-147 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:133-147 | skills/planning-with-files/scripts/inject-plan.py:133-147 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/inject-plan.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/inject-plan.py\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 1405 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d23a7c4c1b9a4b28167561cae18978d54603a44162ccc6761267e7d7edf6837"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 15): .agents/skills/planning-with-files/scripts/inject-plan.py:151-156 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:151-156 | .codex/skills/planning-with-files/scripts/inject-plan.py:151-156 | .cursor/skills/planning-with-files/scripts/inject-plan.py:151-156 | .factory/skills/planning-with-files/scripts/inject-plan.py:151-156 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:151-156 | .opencode/skills/planning-with-files/scripts/inject-plan.py:151-156 | .pi/skills/planning-with-files/scripts/inject-plan.py:151-156 | scripts/inject-plan.py:151-156 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:151-156 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:151-156 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:151-156 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:151-156 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:151-156 | skills/planning-with-files/scripts/inject-plan.py:151-156 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/inject-plan.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/inject-plan.py\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 1405 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"3263e0608d156fc00638a9604bb1dfce45a4cba450017b370b555524f4dd1e19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 15): .agents/skills/planning-with-files/scripts/inject-plan.py:164-171 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:164-171 | .codex/skills/planning-with-files/scripts/inject-plan.py:164-171 | .cursor/skills/planning-with-files/scripts/inject-plan.py:164-171 | .factory/skills/planning-with-files/scripts/inject-plan.py:164-171 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:164-171 | .opencode/skills/planning-with-files/scripts/inject-plan.py:164-171 | .pi/skills/planning-with-files/scripts/inject-plan.py:164-171 | scripts/inject-plan.py:164-171 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:164-171 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:164-171 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:164-171 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:164-171 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:164-171 | skills/planning-with-files/scripts/inject-plan.py:164-171 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/inject-plan.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/inject-plan.py\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 1405 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd480a36e585136a206e701a2a4856f1abbe3577df4113a7d200e4c0cfb4f60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 15): .agents/skills/planning-with-files/scripts/inject-plan.py:214-218 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:214-218 | .codex/skills/planning-with-files/scripts/inject-plan.py:214-218 | .cursor/skills/planning-with-files/scripts/inject-plan.py:214-218 | .factory/skills/planning-with-files/scripts/inject-plan.py:214-218 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:214-218 | .opencode/skills/planning-with-files/scripts/inject-plan.py:214-218 | .pi/skills/planning-with-files/scripts/inject-plan.py:214-218 | scripts/inject-plan.py:214-218 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:214-218 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:214-218 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:214-218 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:214-218 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:214-218 | skills/planning-with-files/scripts/inject-plan.py:214-218 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/inject-plan.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/inject-plan.py\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 1405 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06950988cb2e5b287772067133196b22e5ecd110d811d1d9e884f217c75f0e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 15): .agents/skills/planning-with-files/scripts/inject-plan.py:254-261 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:254-261 | .codex/skills/planning-with-files/scripts/inject-plan.py:254-261 | .cursor/skills/planning-with-files/scripts/inject-plan.py:254-261 | .factory/skills/planning-with-files/scripts/inject-plan.py:254-261 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:254-261 | .opencode/skills/planning-with-files/scripts/inject-plan.py:254-261 | .pi/skills/planning-with-files/scripts/inject-plan.py:254-261 | scripts/inject-plan.py:254-261 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:254-261 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:254-261 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:254-261 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:254-261 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:254-261 | skills/planning-with-files/scripts/inject-plan.py:254-261 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/inject-plan.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/inject-plan.py\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 1405 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c01c2d4e25c7336aeb99ea0c56fd32422ae2c5871f9b80973de1c7ace6f8190"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 15): .agents/skills/planning-with-files/scripts/inject-plan.py:301-307 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:301-307 | .codex/skills/planning-with-files/scripts/inject-plan.py:301-307 | .cursor/skills/planning-with-files/scripts/inject-plan.py:301-307 | .factory/skills/planning-with-files/scripts/inject-plan.py:301-307 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:301-307 | .opencode/skills/planning-with-files/scripts/inject-plan.py:301-307 | .pi/skills/planning-with-files/scripts/inject-plan.py:301-307 | scripts/inject-plan.py:301-307 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:301-307 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:301-307 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:301-307 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:301-307 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:301-307 | skills/planning-with-files/scripts/inject-plan.py:301-307 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/inject-plan.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/inject-plan.py\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 1405 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"59195670f318d267ad57009aad332ba92deb7dda60465d5135b6c67a8b4d1426"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 15): .agents/skills/planning-with-files/scripts/inject-plan.py:315-320 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:315-320 | .codex/skills/planning-with-files/scripts/inject-plan.py:315-320 | .cursor/skills/planning-with-files/scripts/inject-plan.py:315-320 | .factory/skills/planning-with-files/scripts/inject-plan.py:315-320 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:315-320 | .opencode/skills/planning-with-files/scripts/inject-plan.py:315-320 | .pi/skills/planning-with-files/scripts/inject-plan.py:315-320 | scripts/inject-plan.py:315-320 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:315-320 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:315-320 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:315-320 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:315-320 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:315-320 | skills/planning-with-files/scripts/inject-plan.py:315-320 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/inject-plan.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/inject-plan.py\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 1405 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fbfbfcd012addbab9a75209df1b387858175ea55e94a91898cb9b528774c7f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 15): .agents/skills/planning-with-files/scripts/inject-plan.py:337-342 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:337-342 | .codex/skills/planning-with-files/scripts/inject-plan.py:337-342 | .cursor/skills/planning-with-files/scripts/inject-plan.py:337-342 | .factory/skills/planning-with-files/scripts/inject-plan.py:337-342 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:337-342 | .opencode/skills/planning-with-files/scripts/inject-plan.py:337-342 | .pi/skills/planning-with-files/scripts/inject-plan.py:337-342 | scripts/inject-plan.py:337-342 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:337-342 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:337-342 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:337-342 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:337-342 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:337-342 | skills/planning-with-files/scripts/inject-plan.py:337-342 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/inject-plan.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/inject-plan.py\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 1405 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"f652a0696da08232262f18d65805e865257dd47f4d37e0aa745ea61564954e06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 15): .agents/skills/planning-with-files/scripts/inject-plan.py:760-774 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:760-774 | .codex/skills/planning-with-files/scripts/inject-plan.py:760-774 | .cursor/skills/planning-with-files/scripts/inject-plan.py:760-774 | .factory/skills/planning-with-files/scripts/inject-plan.py:760-774 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:760-774 | .opencode/skills/planning-with-files/scripts/inject-plan.py:760-774 | .pi/skills/planning-with-files/scripts/inject-plan.py:760-774 | scripts/inject-plan.py:760-774 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:760-774 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:760-774 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:760-774 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:760-774 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:760-774 | skills/planning-with-files/scripts/inject-plan.py:760-774 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/inject-plan.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/inject-plan.py\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 1405 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5f6a441d1f1b54b49d2bdfbaf44ab0b42c4674ab281f27a152bd9976a2a92f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 15): .agents/skills/planning-with-files/scripts/inject-plan.py:1369-1375 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1369-1375 | .codex/skills/planning-with-files/scripts/inject-plan.py:1369-1375 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1369-1375 | .factory/skills/planning-with-files/scripts/inject-plan.py:1369-1375 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1369-1375 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1369-1375 | .pi/skills/planning-with-files/scripts/inject-plan.py:1369-1375 | scripts/inject-plan.py:1369-1375 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1369-1375 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1369-1375 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1369-1375 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1369-1375 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1369-1375 | skills/planning-with-files/scripts/inject-plan.py:1369-1375 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/inject-plan.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/inject-plan.py\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 1405 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1369}}}],"partialFingerprints":{"codehealthFindingId/v1":"0649b83d1739a8e2085148dda9234ca560a4194a5354fd809b99c89cad94dcfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 15): .agents/skills/planning-with-files/scripts/inject-plan.py:1432-1441 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1432-1441 | .codex/skills/planning-with-files/scripts/inject-plan.py:1432-1441 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1432-1441 | .factory/skills/planning-with-files/scripts/inject-plan.py:1432-1441 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1432-1441 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1432-1441 | .pi/skills/planning-with-files/scripts/inject-plan.py:1432-1441 | scripts/inject-plan.py:1432-1441 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1432-1441 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1432-1441 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1432-1441 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1432-1441 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1432-1441 | skills/planning-with-files/scripts/inject-plan.py:1432-1441 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/inject-plan.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/inject-plan.py\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 1405 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e980c03761a3e5f420b3d8cccbc7bb361d694b50ae5290f314cac624141217"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 15): .agents/skills/planning-with-files/scripts/inject-plan.py:1578-1584 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1578-1584 | .codex/skills/planning-with-files/scripts/inject-plan.py:1578-1584 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1578-1584 | .factory/skills/planning-with-files/scripts/inject-plan.py:1578-1584 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1578-1584 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1578-1584 | .pi/skills/planning-with-files/scripts/inject-plan.py:1578-1584 | scripts/inject-plan.py:1578-1584 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1578-1584 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1578-1584 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1578-1584 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1578-1584 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1578-1584 | skills/planning-with-files/scripts/inject-plan.py:1578-1584 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/inject-plan.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/inject-plan.py\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 1405 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ab442e141cd226fec534a798482afb7a9672706e5da8edf4d272c19a2f25a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 15): .agents/skills/planning-with-files/scripts/inject-plan.py:1633-1642 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1633-1642 | .codex/skills/planning-with-files/scripts/inject-plan.py:1633-1642 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1633-1642 | .factory/skills/planning-with-files/scripts/inject-plan.py:1633-1642 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1633-1642 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1633-1642 | .pi/skills/planning-with-files/scripts/inject-plan.py:1633-1642 | scripts/inject-plan.py:1633-1642 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1633-1642 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1633-1642 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1633-1642 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1633-1642 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1633-1642 | skills/planning-with-files/scripts/inject-plan.py:1633-1642 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/inject-plan.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/inject-plan.py\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 1405 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1633}}}],"partialFingerprints":{"codehealthFindingId/v1":"652be0ffbc7d84123d6ccd76ec4a69ceae898701f23d6554ad47236f1c22b538"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 15): .agents/skills/planning-with-files/scripts/inject-plan.py:1731-1738 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1731-1738 | .codex/skills/planning-with-files/scripts/inject-plan.py:1731-1738 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1731-1738 | .factory/skills/planning-with-files/scripts/inject-plan.py:1731-1738 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1731-1738 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1731-1738 | .pi/skills/planning-with-files/scripts/inject-plan.py:1731-1738 | scripts/inject-plan.py:1731-1738 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1731-1738 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1731-1738 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1731-1738 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1731-1738 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1731-1738 | skills/planning-with-files/scripts/inject-plan.py:1731-1738 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/inject-plan.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/inject-plan.py\u0060 as WHOLE FILES: this scan already matched 37 separate duplicated blocks between them, totalling at least 1405 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1731}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c7c4b908e2b4f582c052ab3d0701d5c69ccc17a5385cf2f8e08152cd075a86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 14): .agents/skills/planning-with-files/scripts/session-catchup.py:24-41 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:24-41 | .codex/skills/planning-with-files/scripts/session-catchup.py:24-41 | .continue/skills/planning-with-files/scripts/session-catchup.py:24-41 | .cursor/skills/planning-with-files/scripts/session-catchup.py:24-41 | .factory/skills/planning-with-files/scripts/session-catchup.py:24-41 | .gemini/skills/planning-with-files/scripts/session-catchup.py:24-41 | .pi/skills/planning-with-files/scripts/session-catchup.py:24-41 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:21-38 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:22-39 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:25-42 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:23-40 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:22-39 | skills/planning-with-files/scripts/session-catchup.py:24-41 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6019bc04b707aa3415225e818136cc1f346461c04be991b50065abe35c4fe52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 15): .agents/skills/planning-with-files/scripts/session-catchup.py:56-64 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:56-64 | .codex/skills/planning-with-files/scripts/session-catchup.py:56-64 | .continue/skills/planning-with-files/scripts/session-catchup.py:56-64 | .cursor/skills/planning-with-files/scripts/session-catchup.py:56-64 | .factory/skills/planning-with-files/scripts/session-catchup.py:56-64 | .gemini/skills/planning-with-files/scripts/session-catchup.py:56-64 | .opencode/skills/planning-with-files/scripts/session-catchup.py:32-40 | .pi/skills/planning-with-files/scripts/session-catchup.py:56-64 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:53-61 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:54-62 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:57-65 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:55-63 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:54-62 | skills/planning-with-files/scripts/session-catchup.py:56-64 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f42faf9ea6cf1c721975ec0ff8fb9e8b554f4d022d6e3ef94f1943f4c94f69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 15): .agents/skills/planning-with-files/scripts/session-catchup.py:68-72 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:68-72 | .codex/skills/planning-with-files/scripts/session-catchup.py:68-72 | .continue/skills/planning-with-files/scripts/session-catchup.py:68-72 | .cursor/skills/planning-with-files/scripts/session-catchup.py:68-72 | .factory/skills/planning-with-files/scripts/session-catchup.py:68-72 | .gemini/skills/planning-with-files/scripts/session-catchup.py:68-72 | .opencode/skills/planning-with-files/scripts/session-catchup.py:44-48 | .pi/skills/planning-with-files/scripts/session-catchup.py:68-72 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:65-69 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:66-70 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:69-73 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:67-71 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:66-70 | skills/planning-with-files/scripts/session-catchup.py:68-72 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"13414722878d1ffcbffea37b4b4200e1b3205c07a27027dcf7911b5d9e1a51d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 18): .agents/skills/planning-with-files/scripts/session-catchup.py:102-118 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:102-118 | .codex/skills/planning-with-files/scripts/session-catchup.py:102-118 | .continue/skills/planning-with-files/scripts/session-catchup.py:102-118 | .cursor/skills/planning-with-files/scripts/session-catchup.py:102-118 | .factory/skills/planning-with-files/scripts/session-catchup.py:102-118 | .gemini/skills/planning-with-files/scripts/session-catchup.py:102-118 | .hermes/skills/planning-with-files/scripts/session-catchup.py:78-89 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:51-62 | .opencode/skills/planning-with-files/scripts/session-catchup.py:78-94 | .pi/skills/planning-with-files/scripts/session-catchup.py:102-118 | scripts/session-catchup.py:84-95 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:99-115 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:100-116 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:103-119 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:101-117 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:100-116 | skills/planning-with-files/scripts/session-catchup.py:102-118 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"325f662a19d8aad68d167f24b5c7b6b36e2b3483d741e9bab5b000a76734ab60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 15): .agents/skills/planning-with-files/scripts/session-catchup.py:212-216 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:212-216 | .codex/skills/planning-with-files/scripts/session-catchup.py:212-216 | .continue/skills/planning-with-files/scripts/session-catchup.py:212-216 | .cursor/skills/planning-with-files/scripts/session-catchup.py:212-216 | .factory/skills/planning-with-files/scripts/session-catchup.py:212-216 | .gemini/skills/planning-with-files/scripts/session-catchup.py:212-216 | .opencode/skills/planning-with-files/scripts/session-catchup.py:188-192 | .pi/skills/planning-with-files/scripts/session-catchup.py:212-216 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:209-213 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:210-214 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:213-217 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:211-215 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:210-214 | skills/planning-with-files/scripts/session-catchup.py:212-216 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"a867ca4b87a2ac34fb0931aaca0ba52265575c33467e2bde18c3423919ef2e60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 15): .agents/skills/planning-with-files/scripts/session-catchup.py:347-354 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:347-354 | .codex/skills/planning-with-files/scripts/session-catchup.py:347-354 | .continue/skills/planning-with-files/scripts/session-catchup.py:347-354 | .cursor/skills/planning-with-files/scripts/session-catchup.py:347-354 | .factory/skills/planning-with-files/scripts/session-catchup.py:347-354 | .gemini/skills/planning-with-files/scripts/session-catchup.py:347-354 | .opencode/skills/planning-with-files/scripts/session-catchup.py:323-330 | .pi/skills/planning-with-files/scripts/session-catchup.py:347-354 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:343-350 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:345-352 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:348-355 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:344-351 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:343-350 | skills/planning-with-files/scripts/session-catchup.py:347-354 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"015ae8ba716ee3e226f5e454a264d558d078d9e41a6023d7a18283c6d0774402"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 10): .agents/skills/planning-with-files/scripts/session-catchup.py:431-437 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:431-437 | .codex/skills/planning-with-files/scripts/session-catchup.py:431-437 | .continue/skills/planning-with-files/scripts/session-catchup.py:431-437 | .cursor/skills/planning-with-files/scripts/session-catchup.py:431-437 | .factory/skills/planning-with-files/scripts/session-catchup.py:431-437 | .gemini/skills/planning-with-files/scripts/session-catchup.py:431-437 | .pi/skills/planning-with-files/scripts/session-catchup.py:431-437 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:428-434 | skills/planning-with-files/scripts/session-catchup.py:431-437 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060.agents/skills/planning-with-files/scripts/session-catchup.py:442\u0060 calls \u0060FAILED\u0060 and \u0060skills/i18n/planning-with-files-zh/scripts/session-catchup.py:439\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a24634a9652a846c5092629069acecb06a4b912addda51776f71cf7d205c7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 17): .agents/skills/planning-with-files/scripts/session-catchup.py:500-505 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:500-505 | .codex/skills/planning-with-files/scripts/session-catchup.py:500-505 | .continue/skills/planning-with-files/scripts/session-catchup.py:500-505 | .cursor/skills/planning-with-files/scripts/session-catchup.py:500-505 | .factory/skills/planning-with-files/scripts/session-catchup.py:500-505 | .gemini/skills/planning-with-files/scripts/session-catchup.py:500-505 | .hermes/skills/planning-with-files/scripts/session-catchup.py:234-239 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:202-207 | .opencode/skills/planning-with-files/scripts/session-catchup.py:425-430 | .pi/skills/planning-with-files/scripts/session-catchup.py:500-505 | scripts/session-catchup.py:513-518 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:602-607 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:520-525 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:491-496 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:518-523 | skills/planning-with-files/scripts/session-catchup.py:500-505 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd82b514a77bbb34ed89c7e2434092217c011b17d740e63a0f92269d5c22c07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 15): .agents/skills/planning-with-files/scripts/session-catchup.py:692-700 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:692-700 | .codex/skills/planning-with-files/scripts/session-catchup.py:692-700 | .continue/skills/planning-with-files/scripts/session-catchup.py:692-700 | .cursor/skills/planning-with-files/scripts/session-catchup.py:692-700 | .factory/skills/planning-with-files/scripts/session-catchup.py:692-700 | .gemini/skills/planning-with-files/scripts/session-catchup.py:692-700 | .opencode/skills/planning-with-files/scripts/session-catchup.py:617-625 | .pi/skills/planning-with-files/scripts/session-catchup.py:692-700 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:403-411 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:405-413 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:408-416 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:673-681 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:403-411 | skills/planning-with-files/scripts/session-catchup.py:692-700 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d98519c2eb530d3026873cb2c44ab3db853095d675d83bafff04ffaaf65d4fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 18): .agents/skills/planning-with-files/scripts/session-catchup.py:704-714 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:704-714 | .codex/skills/planning-with-files/scripts/session-catchup.py:704-714 | .continue/skills/planning-with-files/scripts/session-catchup.py:704-714 | .cursor/skills/planning-with-files/scripts/session-catchup.py:704-714 | .factory/skills/planning-with-files/scripts/session-catchup.py:704-714 | .gemini/skills/planning-with-files/scripts/session-catchup.py:704-714 | .hermes/skills/planning-with-files/scripts/session-catchup.py:31-35 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:26-30 | .opencode/skills/planning-with-files/scripts/session-catchup.py:629-639 | .pi/skills/planning-with-files/scripts/session-catchup.py:704-714 | scripts/session-catchup.py:31-41 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:415-425 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:417-427 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:420-430 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:685-695 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:415-425 | skills/planning-with-files/scripts/session-catchup.py:704-714 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060path_value\u0060 to \u0060Any\u0060 in one and \u0060object\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1b5179ca55367780722d36e775ba167c30a866bd339e9081a9db5b4885695f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 15): .agents/skills/planning-with-files/scripts/session-catchup.py:718-722 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:718-722 | .codex/skills/planning-with-files/scripts/session-catchup.py:718-722 | .continue/skills/planning-with-files/scripts/session-catchup.py:718-722 | .cursor/skills/planning-with-files/scripts/session-catchup.py:718-722 | .factory/skills/planning-with-files/scripts/session-catchup.py:718-722 | .gemini/skills/planning-with-files/scripts/session-catchup.py:718-722 | .opencode/skills/planning-with-files/scripts/session-catchup.py:643-647 | .pi/skills/planning-with-files/scripts/session-catchup.py:718-722 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:429-433 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:431-435 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:434-438 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:699-703 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:429-433 | skills/planning-with-files/scripts/session-catchup.py:718-722 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c50c728444d39d22152dbb7c6c4796818b79d38970fd809c61eb41ccff8e1d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 15): .agents/skills/planning-with-files/scripts/session-catchup.py:726-730 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:726-730 | .codex/skills/planning-with-files/scripts/session-catchup.py:726-730 | .continue/skills/planning-with-files/scripts/session-catchup.py:726-730 | .cursor/skills/planning-with-files/scripts/session-catchup.py:726-730 | .factory/skills/planning-with-files/scripts/session-catchup.py:726-730 | .gemini/skills/planning-with-files/scripts/session-catchup.py:726-730 | .opencode/skills/planning-with-files/scripts/session-catchup.py:651-655 | .pi/skills/planning-with-files/scripts/session-catchup.py:726-730 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:437-441 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:439-443 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:442-446 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:707-711 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:437-441 | skills/planning-with-files/scripts/session-catchup.py:726-730 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4ad5fd599d30d32677a66848cad90406a4bbcba8a482f855d20a49f3f52b48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 15): .agents/skills/planning-with-files/scripts/session-catchup.py:775-783 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:775-783 | .codex/skills/planning-with-files/scripts/session-catchup.py:775-783 | .continue/skills/planning-with-files/scripts/session-catchup.py:775-783 | .cursor/skills/planning-with-files/scripts/session-catchup.py:775-783 | .factory/skills/planning-with-files/scripts/session-catchup.py:775-783 | .gemini/skills/planning-with-files/scripts/session-catchup.py:775-783 | .opencode/skills/planning-with-files/scripts/session-catchup.py:700-708 | .pi/skills/planning-with-files/scripts/session-catchup.py:775-783 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:486-494 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:488-496 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:491-499 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:756-764 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:486-494 | skills/planning-with-files/scripts/session-catchup.py:775-783 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada6a76be76f67c13a95a932fc64f2ae1acb94e12916064a47011613a6f0ba8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 15): .agents/skills/planning-with-files/scripts/session-catchup.py:797-803 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:797-803 | .codex/skills/planning-with-files/scripts/session-catchup.py:797-803 | .continue/skills/planning-with-files/scripts/session-catchup.py:797-803 | .cursor/skills/planning-with-files/scripts/session-catchup.py:797-803 | .factory/skills/planning-with-files/scripts/session-catchup.py:797-803 | .gemini/skills/planning-with-files/scripts/session-catchup.py:797-803 | .opencode/skills/planning-with-files/scripts/session-catchup.py:722-728 | .pi/skills/planning-with-files/scripts/session-catchup.py:797-803 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:508-514 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:510-516 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:513-519 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:778-784 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:508-514 | skills/planning-with-files/scripts/session-catchup.py:797-803 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f56d8c3c3e7423c0eb6033ab20d312e44d3194b2a11629b7dc32e45320874c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): .codex/hooks/context_frame.py:199-204 | .hermes/plugins/planning-with-files/context_frame.py:199-204 \u2014 before extracting anything, compare \u0060.codex/hooks/context_frame.py\u0060 and \u0060.hermes/plugins/planning-with-files/context_frame.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 229 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".codex/hooks/context_frame.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"52743575a66df1d0647567a277d6fb6102ab7e12a0de9cfeb14ce1cdef8f476d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): .hermes/skills/planning-with-files/scripts/session-catchup.py:39-57 | scripts/session-catchup.py:45-63 \u2014 before extracting anything, compare \u0060.hermes/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 499 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":".hermes/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a26d636f59da13e9146d3d0fbf24995ad30bebc3289a928df7503df2f2fbbdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): .hermes/skills/planning-with-files/scripts/session-catchup.py:114-128 | scripts/session-catchup.py:120-134 \u2014 before extracting anything, compare \u0060.hermes/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 499 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060.hermes/skills/planning-with-files/scripts/session-catchup.py:114\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":".hermes/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"581085699c6afcfab1841cf3537b03f25c137941dcabcbd10ddc6eb4ff0b8da0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): .hermes/skills/planning-with-files/scripts/session-catchup.py:132-146 | scripts/session-catchup.py:138-152 \u2014 before extracting anything, compare \u0060.hermes/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 499 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"764f845dc3a514d51ba255c03985e17d3b48695d4a4318405ef20f1b0da1a5f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): .hermes/skills/planning-with-files/scripts/sync-ide-folders.py:198-215 | scripts/sync-ide-folders.py:383-400 \u2014 before extracting anything, compare \u0060.hermes/skills/planning-with-files/scripts/sync-ide-folders.py\u0060 and \u0060scripts/sync-ide-folders.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 151 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/skills/planning-with-files/scripts/sync-ide-folders.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b59e2848a2b5b5a667ba448f4741dcca89191456f2c14debb1c1a498fbd026"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 10): .agents/skills/planning-with-files/scripts/session-catchup.py:871-879 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:871-879 | .codex/skills/planning-with-files/scripts/session-catchup.py:871-879 | .continue/skills/planning-with-files/scripts/session-catchup.py:871-879 | .cursor/skills/planning-with-files/scripts/session-catchup.py:871-879 | .factory/skills/planning-with-files/scripts/session-catchup.py:871-879 | .gemini/skills/planning-with-files/scripts/session-catchup.py:871-879 | .pi/skills/planning-with-files/scripts/session-catchup.py:871-879 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:845-853 | skills/planning-with-files/scripts/session-catchup.py:871-879 \u2014 before extracting anything, compare \u0060.agents/skills/planning-with-files/scripts/session-catchup.py\u0060 and \u0060.codebuddy/skills/planning-with-files/scripts/session-catchup.py\u0060 as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 901 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060.agents/skills/planning-with-files/scripts/session-catchup.py:871\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":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4aa2b756595cc4d399e8e9983b1102d536f5b8c105c32263bb303c9dad9972"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): scripts/bump-version.py:94-105 | scripts/bump-version.py:109-127 | scripts/bump-version.py:131-143 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/bump-version.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e30dbbc72e886e31dd670008c2e994f38c46d7f46ce36fbc677fa46eda4daa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): scripts/bump-version.py:96-105 | scripts/bump-version.py:134-143 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/bump-version.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa40a8897e6c988d3ae1098763ae67140f7109365d088c010016162dbff7bd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): examples/file-only-recovery/grade.py:623-629 | examples/file-only-recovery/grade.py:631-637 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060examples/file-only-recovery/grade.py:640\u0060 calls \u0060copytree\u0060 and \u0060examples/file-only-recovery/grade.py:631\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/file-only-recovery/grade.py"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00906e331eabf9d1eee21df4ebad02aff592449bd8e682b4f00f2b25dfdd74c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): examples/file-only-recovery/grade.py:623-628 | examples/file-only-recovery/grade.py:631-636 | examples/file-only-recovery/grade.py:641-646 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060examples/file-only-recovery/grade.py:640\u0060 calls \u0060copytree\u0060 and \u0060examples/file-only-recovery/grade.py:631\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/file-only-recovery/grade.py"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03087c7b008401482dc9eb489a3c44a7c4c3b6cba16a667fe6c2447f9ae0b10"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 JavaScript/TypeScript suite: Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured \u2014 .dsh/packages/dsh-planning-with-files/ runs vitest but declares no coverage provider, so the suite can run and still produce no lcov \u2014 add \u0060@vitest/coverage-v8\u0060 (or \u0060@vitest/coverage-istanbul\u0060) as a devDependency. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository\u0027s maintainers can perform; once it passes, the real number is measured on the next scan."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: .agents/skills/planning-with-files/scripts/inject-plan.py: .agents/skills/planning-with-files/scripts/inject-plan.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in Injector._run at line 948. 5 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 21:55:29 \u002B01:00\u0027 --until=\u00272026-11-11 21:55:29 \u002B01:00\u0027 --full-history --no-merges -- .agents/skills/planning-with-files/scripts/inject-plan.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"01262cf8ba434ba033239e581d7d601d32ef6d5e2c0942728de95ca4fcd0b0de"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: .codebuddy/skills/planning-with-files/scripts/inject-plan.py: .codebuddy/skills/planning-with-files/scripts/inject-plan.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in Injector._run at line 948. 5 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 21:55:29 \u002B01:00\u0027 --until=\u00272026-11-11 21:55:29 \u002B01:00\u0027 --full-history --no-merges -- .codebuddy/skills/planning-with-files/scripts/inject-plan.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codebuddy/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"055c47feb5432723a59c59ed899311100bae6a948f4fe692ff5cc63e0567c49f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: .codex/skills/planning-with-files/scripts/inject-plan.py: .codex/skills/planning-with-files/scripts/inject-plan.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in Injector._run at line 948. 5 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 21:55:29 \u002B01:00\u0027 --until=\u00272026-11-11 21:55:29 \u002B01:00\u0027 --full-history --no-merges -- .codex/skills/planning-with-files/scripts/inject-plan.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"06843e3cf67a17e50e8a05c942804e4fcf8f59d3324f3f64ff29acbe4679cf41"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: .cursor/skills/planning-with-files/scripts/inject-plan.py: .cursor/skills/planning-with-files/scripts/inject-plan.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in Injector._run at line 948. 5 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 21:55:29 \u002B01:00\u0027 --until=\u00272026-11-11 21:55:29 \u002B01:00\u0027 --full-history --no-merges -- .cursor/skills/planning-with-files/scripts/inject-plan.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".cursor/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"479d36b7f35dc75a178961669ed9507eb3d0304f3befd32d1684e8100abcf8ee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: .factory/skills/planning-with-files/scripts/inject-plan.py: .factory/skills/planning-with-files/scripts/inject-plan.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in Injector._run at line 948. 5 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 21:55:29 \u002B01:00\u0027 --until=\u00272026-11-11 21:55:29 \u002B01:00\u0027 --full-history --no-merges -- .factory/skills/planning-with-files/scripts/inject-plan.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".factory/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d27a0230a553ffc116b16939f821ffa31a522c5efe6a2c1c458e71afe2cf6be"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: .mastracode/skills/planning-with-files/scripts/inject-plan.py: .mastracode/skills/planning-with-files/scripts/inject-plan.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in Injector._run at line 948. 5 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 21:55:29 \u002B01:00\u0027 --until=\u00272026-11-11 21:55:29 \u002B01:00\u0027 --full-history --no-merges -- .mastracode/skills/planning-with-files/scripts/inject-plan.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".mastracode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3c8197427271d04292c827d40e35950c937ca0cf3137a5e0e3ac0ef58f13ee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: .opencode/skills/planning-with-files/scripts/inject-plan.py: .opencode/skills/planning-with-files/scripts/inject-plan.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in Injector._run at line 948. 5 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 21:55:29 \u002B01:00\u0027 --until=\u00272026-11-11 21:55:29 \u002B01:00\u0027 --full-history --no-merges -- .opencode/skills/planning-with-files/scripts/inject-plan.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".opencode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dbad56c8100ef73e5affeda7f74407fa6b62785d90255e52e203bbacc95212f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: .pi/skills/planning-with-files/scripts/inject-plan.py: .pi/skills/planning-with-files/scripts/inject-plan.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in Injector._run at line 948. 5 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 21:55:29 \u002B01:00\u0027 --until=\u00272026-11-11 21:55:29 \u002B01:00\u0027 --full-history --no-merges -- .pi/skills/planning-with-files/scripts/inject-plan.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".pi/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5abecbe9c52acef6e44a03dadb9b129dee9cff6bbd1cab4788147cd06a0b5b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/inject-plan.py: scripts/inject-plan.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in Injector._run at line 948. 5 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 21:55:29 \u002B01:00\u0027 --until=\u00272026-11-11 21:55:29 \u002B01:00\u0027 --full-history --no-merges -- scripts/inject-plan.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"427a1f6115c15294f817cef58823ea39a090e164c4537ffa29369c2cb58fe82e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/i18n/planning-with-files-ar/scripts/inject-plan.py: skills/i18n/planning-with-files-ar/scripts/inject-plan.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in Injector._run at line 948. 5 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 21:55:29 \u002B01:00\u0027 --until=\u00272026-11-11 21:55:29 \u002B01:00\u0027 --full-history --no-merges -- skills/i18n/planning-with-files-ar/scripts/inject-plan.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-ar/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bfd080a15d98240dc794601d1bfb7cc083ead45982da4de0ff4ee64a022394d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/i18n/planning-with-files-de/scripts/inject-plan.py: skills/i18n/planning-with-files-de/scripts/inject-plan.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in Injector._run at line 948. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 21:55:29 \u002B01:00\u0027 --until=\u00272026-11-11 21:55:29 \u002B01:00\u0027 --full-history --no-merges -- skills/i18n/planning-with-files-de/scripts/inject-plan.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-de/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd1ddb469079af9bbf004fdbd93e0b267d7ee69c6942b25f3d0055b4d118494a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/i18n/planning-with-files-es/scripts/inject-plan.py: skills/i18n/planning-with-files-es/scripts/inject-plan.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in Injector._run at line 948. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 21:55:29 \u002B01:00\u0027 --until=\u00272026-11-11 21:55:29 \u002B01:00\u0027 --full-history --no-merges -- skills/i18n/planning-with-files-es/scripts/inject-plan.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-es/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"1085305f958d4c735b4bab186b699e0ec62f112107191962288f9c31f6a637a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/i18n/planning-with-files-zh/scripts/inject-plan.py: skills/i18n/planning-with-files-zh/scripts/inject-plan.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in Injector._run at line 948. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 21:55:29 \u002B01:00\u0027 --until=\u00272026-11-11 21:55:29 \u002B01:00\u0027 --full-history --no-merges -- skills/i18n/planning-with-files-zh/scripts/inject-plan.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zh/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6fe227907311efd0ddf2cedc4b07b971d36585c2039de08a85a8288804fe2b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/i18n/planning-with-files-zht/scripts/inject-plan.py: skills/i18n/planning-with-files-zht/scripts/inject-plan.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in Injector._run at line 948. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 21:55:29 \u002B01:00\u0027 --until=\u00272026-11-11 21:55:29 \u002B01:00\u0027 --full-history --no-merges -- skills/i18n/planning-with-files-zht/scripts/inject-plan.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zht/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ff02be7e6c778cc26e626e35043180b594e6f4873d5efff7894d625be5db17"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/planning-with-files/scripts/inject-plan.py: skills/planning-with-files/scripts/inject-plan.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in Injector._run at line 948. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 21:55:29 \u002B01:00\u0027 --until=\u00272026-11-11 21:55:29 \u002B01:00\u0027 --full-history --no-merges -- skills/planning-with-files/scripts/inject-plan.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0379b24d220a439d9c9f551f984ea62cfcd9c4301ad144affd5d3a929163509"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: .hermes/plugins/planning-with-files/paths.py: .hermes/plugins/planning-with-files/paths.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in paths.resolve_plan at line 300. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 21:55:29 \u002B01:00\u0027 --until=\u00272026-11-11 21:55:29 \u002B01:00\u0027 --full-history --no-merges -- .hermes/plugins/planning-with-files/paths.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/plugins/planning-with-files/paths.py"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e79fdb6b59d010726d36cac6b0ec0711a50aed373b1a63579415063670d47c3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/session-catchup.py: scripts/session-catchup.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in session-catchup.opencode_catchup at line 541. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 21:55:29 \u002B01:00\u0027 --until=\u00272026-11-11 21:55:29 \u002B01:00\u0027 --full-history --no-merges -- scripts/session-catchup.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/session-catchup.py"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1d4b2e4de53af09c0a6854e5ac58f2d9adc9448b63dafd1057232259527f80"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: .opencode/packages/opencode-planning-with-files/src/core.ts: .opencode/packages/opencode-planning-with-files/src/core.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in resolvePlan at line 256. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 21:55:29 \u002B01:00\u0027 --until=\u00272026-11-11 21:55:29 \u002B01:00\u0027 --full-history --no-merges -- .opencode/packages/opencode-planning-with-files/src/core.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".opencode/packages/opencode-planning-with-files/src/core.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"32fda18a679b9662aafb876c8980d01f0cdbc6923d16398f6dd1f784035f9347"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: .pi/skills/planning-with-files/extensions/planning-with-files/runtime.ts: .pi/skills/planning-with-files/extensions/planning-with-files/runtime.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in (anonymous) at line 669. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 21:55:29 \u002B01:00\u0027 --until=\u00272026-11-11 21:55:29 \u002B01:00\u0027 --full-history --no-merges -- .pi/skills/planning-with-files/extensions/planning-with-files/runtime.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".pi/skills/planning-with-files/extensions/planning-with-files/runtime.ts"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b41bf5a7c465ead8d578925e1bd687679ae0d7e494022fb3b5b193bf8431bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: .hermes/skills/planning-with-files/scripts/session-catchup.py: .hermes/skills/planning-with-files/scripts/session-catchup.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in session-catchup.main at line 476. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 21:55:29 \u002B01:00\u0027 --until=\u00272026-11-11 21:55:29 \u002B01:00\u0027 --full-history --no-merges -- .hermes/skills/planning-with-files/scripts/session-catchup.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"06730b257517b5a49e02f1171701f13f0275a98d50a860593318d19f75ae9598"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: .hermes/plugins/planning-with-files/__init__.py: .hermes/plugins/planning-with-files/__init__.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in planning-with-files.pwf_command at line 78. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 21:55:29 \u002B01:00\u0027 --until=\u00272026-11-11 21:55:29 \u002B01:00\u0027 --full-history --no-merges -- .hermes/plugins/planning-with-files/__init__.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/plugins/planning-with-files/__init__.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ae4f4d6db4e83d30a086ca715907a8f50c9fd2640fb003873be544ddd93076"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: .mastracode/skills/planning-with-files/scripts/session-catchup.py: .mastracode/skills/planning-with-files/scripts/session-catchup.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in session-catchup.main at line 386. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 21:55:29 \u002B01:00\u0027 --until=\u00272026-11-11 21:55:29 \u002B01:00\u0027 --full-history --no-merges -- .mastracode/skills/planning-with-files/scripts/session-catchup.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".mastracode/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2fd5c4754a3c2a89bd5734315fdd87f928ed08172de6d66b456a2e9deff30ad"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: .pi/skills/planning-with-files/extensions/planning-with-files/plan.ts: .pi/skills/planning-with-files/extensions/planning-with-files/plan.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in resolvePlanPaths at line 176. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 21:55:29 \u002B01:00\u0027 --until=\u00272026-11-11 21:55:29 \u002B01:00\u0027 --full-history --no-merges -- .pi/skills/planning-with-files/extensions/planning-with-files/plan.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".pi/skills/planning-with-files/extensions/planning-with-files/plan.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"75310fd84e20d21c328c052d2e400fa55ee657521ae3a17a7eee6bb523340942"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: .dsh/packages/dsh-planning-with-files/src/index.ts: .dsh/packages/dsh-planning-with-files/src/index.ts changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is (anonymous) at line 221), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(dsh): report selector requirement in status\u201D; \u201Cfix(dsh): stamp the V4 producer-owned source kind on injected messages\u201D; \u201Cfix(dsh): re-inject the plan after compaction from the compaction/end session event\u201D; \u201Cfix(plugins): require PLAN_ID when several named plans exist, in the shared OpenCode and DSH core\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 21:55:29 \u002B01:00\u0027 --until=\u00272026-11-11 21:55:29 \u002B01:00\u0027 --full-history --no-merges -- .dsh/packages/dsh-planning-with-files/src/index.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".dsh/packages/dsh-planning-with-files/src/index.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d23158b875f6d1b0f4a768e413ab387cb23cee1d855417071867fd8134a1d4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: .opencode/packages/opencode-planning-with-files/src/index.ts: .opencode/packages/opencode-planning-with-files/src/index.ts changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is event at line 155), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(opencode): support v2 plugin registration and session lifecycle\u201D; \u201Cfix(plugins): require PLAN_ID when several named plans exist, in the shared OpenCode and DSH core\u201D; \u201Cfix: bind explicit plan selectors, floor slug modes on the project root, and classify doctor output on the data frame\u201D; \u201Cfix(opencode, hermes): second-model review fixes for the plan resolvers and the OpenCode plugin\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 21:55:29 \u002B01:00\u0027 --until=\u00272026-11-11 21:55:29 \u002B01:00\u0027 --full-history --no-merges -- .opencode/packages/opencode-planning-with-files/src/index.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".opencode/packages/opencode-planning-with-files/src/index.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"179ceda4547733a44f150e2bbf6bbbe6b2f5904e1bf257ebcb1a50ed72365a41"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: .codex/hooks/run_sh.py: .codex/hooks/run_sh.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is run_sh.main at line 23), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: bind parallel sessions and repair standalone hook delivery\u201D; \u201Cfix(security): harden planning context isolation\u201D; \u201Cfix: emit Codex JSON from Unix context hooks\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 21:55:29 \u002B01:00\u0027 --until=\u00272026-11-11 21:55:29 \u002B01:00\u0027 --full-history --no-merges -- .codex/hooks/run_sh.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/hooks/run_sh.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"51bd286c0759fbec9461c71a573d8f2178234f74eff2bc3315f117b92279a1bc"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 11 significant file(s) lose their only recent owner: skills/planning-with-files/scripts/inject-plan.py, skills/i18n/planning-with-files-zht/scripts/inject-plan.py, skills/i18n/planning-with-files-zh/scripts/inject-plan.py, skills/i18n/planning-with-files-es/scripts/inject-plan.py, skills/i18n/planning-with-files-de/scripts/inject-plan.py, skills/i18n/planning-with-files-ar/scripts/inject-plan.py, scripts/inject-plan.py, skills/i18n/planning-with-files-ar/scripts/session-catchup.py (\u002B3 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ba44984d89a9c43ba684794d622e127d0b8b3c64d42e6804b5be0d14e9c01c08"}},{"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":"3b3b753c77b53895d59f1025468c7ce721e42e281b3db22808e3cbc1ea6bf73d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2756f974738bed32df7a76d91950c42d535d86249f8ab7aeafc239e7ac27b3ff"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5d20f7026d96dff87c0a5ec8a5880d244c1ff97e25de946511a7f44e3751b656"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1bc6ed4cef9b5a2b1213c4e99c76c9d1dee0350e1fbcf6223f9649f5649b160c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"34a4be1c03dd0359d6a547b8cd7f9b530e5c88d734793c2d8a90a7528e1e44b4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c71bc63859c427b5f68580967c02c400ab4e29e08e06757c03d03a3a6ea4ae32"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cad9b8550170bdf220c5c02faf53ec4300e16232218479ca60d5d9f1eed8dd8a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"29b52813d437f1517227b445585db55709d6308d0c5c4c74395d5729b1b8f361"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"253b0303194b87421f47d2902e5e8328d645602727e9d0233aca4757fe595e0b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"483a792fde9f5bc62ea8e05395519ff168c8b36ce22a0f9c87ca5ca18db45982"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7ad8b4b27b9cdef25e88be169cd8890a48c74f4785cab37700e842cd6c81958f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f33bf0bb80622ad0711c866e22e1c00bf402171151996532471b2c9f702e941b"},"taxa":[{"id":"CWE-95","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f1b74427fc74afc3618e2f729fac0e7f494f89591acb6e66ad1cf157c9a0fff6"},"properties":{"dependency":{"package":"tinypool","version":"1.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"63b36ef79340ec09e6b41de8d2fab8104fa7b9470e4bf9a6d1434457ae624cac"},"properties":{"dependency":{"package":"vitest","version":"2.1.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d0ec012c9bebd0acdd6b80b5d077be21c84144b54d832205eacdde71026ce8f5"},"properties":{"dependency":{"package":"tinypool","version":"1.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e3238c6ea16379f39c25d0cb073c08206f97d2b5bfc56058aae35c238042be1d"},"properties":{"dependency":{"package":"vitest","version":"2.1.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e3411eeb350d080b759fff20c1c89c078e9dd86fb6c07b9ab8ca2a0dbc9523b1"},"properties":{"dependency":{"package":"tinypool","version":"1.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb540941ba57cf8dc619d5e724f56e75625610d0972c32f8ee03994f0b622808"},"properties":{"dependency":{"package":"vitest","version":"2.1.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aba43aa1f5d2b82af428a6b2ae5570e3887e1f7472a5a0281da4fb491234f7a4"},"properties":{"dependency":{"package":"vite","version":"5.4.21","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dd8256befa8fa4ae9883645a08b65552d8ad1c522036530942d23c290e84e28b"},"properties":{"dependency":{"package":"zod","version":"4.6.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b750ef06f869ce9e2ea305a12892aa5f3acf34573901f239e9d1fcedc18c6125"},"properties":{"dependency":{"package":"undici","version":"8.11.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"429a1318fc21ed043b9e4c220902d11282a0f6fdb42fda3c9139316e5a163dff"},"properties":{"dependency":{"package":"source-map-js","version":"1.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1632259b0cff86b421bdde1789131a6e60c9752612add5ac8127653299ce066f"},"properties":{"dependency":{"package":"toml","version":"4.3.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a01987bdd86a23626a2315db2fb9b195fc0fbb52292bad4665eb76b55bd4bbfd"},"properties":{"dependency":{"package":"undici","version":"6.29.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"809596907bb2dbdef7ebdd3003d30502b0628f49fe170a00c63d0ccdce07a655"},"properties":{"dependency":{"package":"vite","version":"5.4.21","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e63b684d017d5a456b0828ca84a9c5f77d4c70e6b4f28a599229969ede0b5a84"},"properties":{"dependency":{"package":"zod","version":"4.1.8","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1d7e6bcb75ec0c9d8ca60c77c6702fc6a806683db50f3cfd4351a9887dbbf2b0"},"properties":{"dependency":{"package":"brace-expansion","version":"5.0.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"56defabe841428c3fdbfaf172dbd0b551845d5f7b344ff48967495fe8ea467b4"},"properties":{"dependency":{"package":"undici","version":"8.5.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"24102af40b3a27a1cfc25cf1d833e0894422fa414d56ec3e1e0d156cd7acbf5c"},"properties":{"dependency":{"package":"zod","version":"3.25.76","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e4e549b072c9cfa00c714eb3ea3b0ce6072a51ecb8ee7a087a82dd3f96ed5faa"},"properties":{"dependency":{"package":"nanoid","version":"3.3.15","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e5451ed92ea181b1dc00b3ede7c1182bb7abca573fb66b3aef89d2532a39410d"},"properties":{"dependency":{"package":"postcss","version":"8.5.16","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a815ff2be68f7621800ed6aaebdfdffbc761f8a8b01ed69dc35b62f1bcb69d6a"},"properties":{"dependency":{"package":"source-map-js","version":"1.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc48b01fa0101769b950fe401fb9dcfd9199be5050186675dc9a8860fa077aa1"},"properties":{"dependency":{"package":"vite","version":"5.4.21","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fab9294724df7819110a88a1cd1685b5c0c63e7955fdd064732d153a4c2dac75"},"properties":{"dependency":{"package":"@vitest/mocker","version":"2.1.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"07a52c71ee260f4d0ae356cbe2666b8a9fa62eb796837e52585dcdfda7b2ed57"},"properties":{"dependency":{"package":"esbuild","version":"0.21.5","advisory":"[GHSA redacted]","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ce35283c8c599a78c5f5f732c884104c28ff13c5b0730ad134d0a2cb953c2308"},"properties":{"dependency":{"package":"@vitest/mocker","version":"2.1.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b0099aaf1209a75596b1b202656d133ed669aec8c0aa3977cdc0e05099a62d25"},"properties":{"dependency":{"package":"effect","version":"4.0.0-beta.83","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"645c16df8c761de4cdc9e612281e9233f3aeb6383b7ba0681efde097519eab84"},"properties":{"dependency":{"package":"esbuild","version":"0.21.5","advisory":"[GHSA redacted]","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"818d9f4c5d2b4783baafb15f046fb41dfbb0404b903a92a4d06f39af86021c4e"},"properties":{"dependency":{"package":"glob","version":"13.0.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"19eafc52de35976392e64a64b8a75eb54c23daf0b483bbb20683cbe26483f29f"},"properties":{"dependency":{"package":"ip-address","version":"10.7.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e71e0feeffcf26cd06a102ce89030d4e418cdd0da6b3fb86eb0b00e82d61a905"},"properties":{"dependency":{"package":"minimatch","version":"10.2.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"16de21c7cfa7987906c696f3e57ce26953a9d12b99b998d5d9b3252a06eb858b"},"properties":{"dependency":{"package":"glob","version":"10.5.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"00a734b178aced139a36fb1804acda40c19f9226a1398c9d6c7e11167568226b"},"properties":{"dependency":{"package":"minimatch","version":"9.0.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7f53e75463fd3a6ad9797ea682ffdd0c4b021fe68012ca4af382126694d98900"},"properties":{"dependency":{"package":"glob","version":"13.0.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"388abd738588c7e672edf257f73d15b33818b036f63a26a2b2fd4bdd41d8c169"},"properties":{"dependency":{"package":"minimatch","version":"10.2.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"547190e1f0bd832734ae7f093fbfb44192792aa15b37e8ff80eb0adaa23d9065"},"properties":{"dependency":{"package":"protobufjs","version":"7.6.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b9dedf97115c85fa4454b52e34cd31ac556be7aab51afefbd3ffdb93cc686d30"},"properties":{"dependency":{"package":"@vitest/mocker","version":"2.1.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4f54236591aaf505459cd937bcac374709ecdb7abfca543d1142a15ff9d48ce8"},"properties":{"dependency":{"package":"esbuild","version":"0.21.5","advisory":"[GHSA redacted]","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"f4ba5b415da5074d2f7d1b90d051efbd49500b6facd7001ad09f2217d7a6f048"},"properties":{"dependency":{"package":"fast-xml-parser","version":"5.7.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add bandit, \u0060semgrep --config=p/python\u0060, or CodeQL\u0027s python pack as a CI step. What was searched, so you can tell an absence from a miss: the 3 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/skill-review.yml"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060.dsh/packages/dsh-planning-with-files/package.json\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".dsh/packages/dsh-planning-with-files/package.json"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"1881e63dfc40a2899db82ae00fdc0f6edcc31b566979325bda46ae79a958a490"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: .opencode/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".opencode/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"45245c69a41c13edaad3016e41fe41cd46dd9f17358a0ce303eb4a5cab262728"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: .pi/skills/planning-with-files/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".pi/skills/planning-with-files/package.json"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"836bc708136c01744011fe4239a33ba6d3180326a2a90a7c39e947de154fbc87"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!!st \u0026\u0026 st.isDirectory() \u0026\u0026 !st.isSymbolicLink()\u0060 appears character-identically in 2 files \u2014 .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".dsh/packages/dsh-planning-with-files/src/core.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"848d875300d7323605e73cf3357194c65279bcd210697656fc4e5980b2a24c92"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!!st \u0026\u0026 st.isFile() \u0026\u0026 !st.isSymbolicLink()\u0060 appears character-identically in 2 files \u2014 .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".dsh/packages/dsh-planning-with-files/src/core.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"de70eee9cb6a4c9850a31b2e500a48fdfe65e701f5d505f3b49502b25e34a476"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!MODE_LOWERING_TOKENS.has(token) \u0026\u0026 !effective.includes(token)\u0060 appears character-identically in 2 files \u2014 .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".dsh/packages/dsh-planning-with-files/src/core.ts"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"764b330a7569c96c5774ba03414800b9794c088fabae4386831b5dd4ac901f23"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!MODE_LOWERING_TOKENS.has(token) || floor.includes(token)\u0060 appears character-identically in 2 files \u2014 .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".dsh/packages/dsh-planning-with-files/src/core.ts"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0a7cc562fdb7cb724b474b096f956d56a1060d3a6f0d965458b8a9ea9c6b1a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!candidate || candidate.startsWith(\u0022\u003C!--\u0022)\u0060 appears character-identically in 2 files \u2014 .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".dsh/packages/dsh-planning-with-files/src/core.ts"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"49abfc11cfada0aa4dfcdc7ce710fdda3d8032cebdea4a9fe203d8cf6515d4b1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!path.isAbsolute(pin) || pin.startsWith(\u0022\\\\\\\\\u0022) || pin.startsWith(\u0022//\u0022)\u0060 appears character-identically in 2 files \u2014 .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".dsh/packages/dsh-planning-with-files/src/core.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6846a16ae0a648c54a68e9a5071b933dae103d610658d3246456fad39f35c2c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!realCandidate || !realRoot || !isInside(realCandidate, realRoot)\u0060 appears character-identically in 2 files \u2014 .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".dsh/packages/dsh-planning-with-files/src/core.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8acc948b88dd6e820637b63732b4136a62c22c5afcc8d7d6b8aaed63fcfe6e5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!st || !st.isFile() || st.isSymbolicLink() || st.nlink \u003E 1 || !real || !isInside(real, realRoot)\u0060 appears character-identically in 2 files \u2014 .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".dsh/packages/dsh-planning-with-files/src/core.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"59159381fba8778e964cedcddc8dac8fff04309ae72e4d0441fdb5862e3b45b0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!st || st.isSymbolicLink() || !st.isDirectory()\u0060 appears character-identically in 2 files \u2014 .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".dsh/packages/dsh-planning-with-files/src/core.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"52fa3308fbd6534c7fe6556ff285a0a3c55b5104a6c2c7ac4b639b3dffaa23da"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060chosen === null \u0026\u0026 isRegularFile(path.join(root, \u0022task_plan.md\u0022))\u0060 appears character-identically in 2 files \u2014 .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".dsh/packages/dsh-planning-with-files/src/core.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42045ea9fafdf5cd5229099cb39d12283be997839ba208cd87c9605d51c45cd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060counts.total \u003C= 0 || counts.in_progress \u003C= 0\u0060 appears character-identically in 2 files \u2014 .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".dsh/packages/dsh-planning-with-files/src/core.ts"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"296225a545ca4f8bc83bb6a0a58df56087be996dbd599ec42e73521eeb84fe4b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060counts.total \u003E 0 \u0026\u0026 counts.complete \u003E= counts.total\u0060 appears character-identically in 2 files \u2014 .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".dsh/packages/dsh-planning-with-files/src/core.ts"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b64a84e6ddcf5a5d8684b16c45104ecfbd2703cdf7a3fc2b282a5f065d386e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060env.HOME || env.USERPROFILE || os.homedir()\u0060 appears character-identically in 2 files \u2014 .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".dsh/packages/dsh-planning-with-files/src/core.ts"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f3af46f10f13f63846a2ddbfc95fd655be4d9acca36540637d9b3ab4d3d5ee"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060env.XDG_CONFIG_HOME || path.join(home, \u0022.config\u0022)\u0060 appears character-identically in 2 files \u2014 .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".dsh/packages/dsh-planning-with-files/src/core.ts"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e895d80e6493f9eda05a7bf95ef9088413f16eb1b938a91be8b1ac2a8c5bd4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060firstInProgressPhase(text) || \u0022No phase found\u0022\u0060 appears character-identically in 2 files \u2014 .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".dsh/packages/dsh-planning-with-files/src/core.ts"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d8227c67b40a687d3a2bf62ff1e2bb1c4d484409fa6de240cfea6fc54e3c0e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060firstInProgressPhase(text) || \u0022unknown phase\u0022\u0060 appears character-identically in 2 files \u2014 .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".dsh/packages/dsh-planning-with-files/src/core.ts"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8055bdeb781eea796cd3ac5bb9aa94065f9830fada98f7711375ee0be77868"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isRealDir(path.join(planningRoot, \u0022sessions\u0022)) \u0026\u0026 isRegularFile(path.join(root, \u0022task_plan.md\u0022))\u0060 appears character-identically in 2 files \u2014 .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".dsh/packages/dsh-planning-with-files/src/core.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3fafbce8f495a08807486f81a82e15e1d785c4123b2db9ec0e6858aa9e0fc6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isRealDir(slugDir) \u0026\u0026 isRegularFile(path.join(slugDir, \u0022task_plan.md\u0022))\u0060 appears character-identically in 2 files \u2014 .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".dsh/packages/dsh-planning-with-files/src/core.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"088ea914556b46c9d89cc2b307ee527cca3c0ef9d2902d61215be64dac836661"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060line.includes(\u0022**Status:** in_progress\u0022) || line.includes(\u0022[in_progress]\u0022)\u0060 appears character-identically in 2 files \u2014 .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".dsh/packages/dsh-planning-with-files/src/core.ts"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3f1a78d231a988ea06ece48a2f5a309e3f2687e388599b50b69ebcb2b61e2e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060mode !== \u0022\u0022 \u0026\u0026 mode !== \u0022autonomous\u0022 \u0026\u0026 mode !== \u0022gated\u0022\u0060 appears character-identically in 2 files \u2014 .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".dsh/packages/dsh-planning-with-files/src/core.ts"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16eedb411a2a97fb837e94705cff8615f6076f23841a3c42384ae36dd3f6bc3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n.startsWith(\u0022ledger-\u0022) \u0026\u0026 n.endsWith(\u0022.jsonl\u0022)\u0060 appears character-identically in 2 files \u2014 .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".dsh/packages/dsh-planning-with-files/src/core.ts"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"58827c4e91e0297310c5b5d181b6e376eff9f686e00be4ee85eac1455be6f3f4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.platform === \u0022win32\u0022 \u0026\u0026 /^[\\\\/]/.test(pin)\u0060 appears character-identically in 2 files \u2014 .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".dsh/packages/dsh-planning-with-files/src/core.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b6d5a73face826c0cb4f8dd4ce0b89d03a50f9146f2627dca713d4c01f9e16"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rel === \u0022\u0022 || (!rel.startsWith(\u0022..\u0022) \u0026\u0026 !path.isAbsolute(rel))\u0060 appears character-identically in 2 files \u2014 .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".dsh/packages/dsh-planning-with-files/src/core.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"9027803afdc234885613730ebf453630b1f70335fa18a165cd30bcb142de1ec6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060template !== \u0022default\u0022 \u0026\u0026 isRegularFile(prefixed)\u0060 appears character-identically in 2 files \u2014 .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".dsh/packages/dsh-planning-with-files/src/core.ts"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59c96059e52e357cf960e66ba0bfa7934c049500ba36f748b01e95a80bbfaf3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060verified !== null \u0026\u0026 verified.ok \u0026\u0026 verified.attestationValid\u0060 appears character-identically in 2 files \u2014 .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".dsh/packages/dsh-planning-with-files/src/core.ts"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"75788881822c37891c5e88e2405d3f05f892d2974e2f2ce8d9882d8b17ad94cd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0027\u0022Write\u0022\u0027 not in line and \u0027\u0022Edit\u0022\u0027 not in line\u0060 appears character-identically in 2 files \u2014 .hermes/skills/planning-with-files/scripts/session-catchup.py, scripts/session-catchup.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d7cca8e2d059ef68adb9bf4779eb6d7c456c8b01289a0c0ee193cec0a5a8ea2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0027directory\u0027 not in session_cols or \u0027data\u0027 not in part_cols\u0060 appears character-identically in 12 files \u2014 .agents/skills/planning-with-files/scripts/session-catchup.py, .codebuddy/skills/planning-with-files/scripts/session-catchup.py, .codex/skills/planning-with-files/scripts/session-catchup.py, .continue/skills/planning-with-files/scripts/session-catchup.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a04830f0522ef9d22bcb011abe01a9096ef0daf5d712fc152a243e363883e6e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_is_reparse_or_link_stat(info) and not _is_trusted_darwin_system_alias( current, info )\u0060 appears character-identically in 2 files \u2014 .codex/hooks/context_frame.py, .hermes/plugins/planning-with-files/context_frame.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/hooks/context_frame.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78c356e6de9615474ad439cfd065f48c5a848ae53b5dcf23a311697a6c41561"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060after_line \u003E= 0 and line_num \u003C= after_line\u0060 appears character-identically in 2 files \u2014 .hermes/skills/planning-with-files/scripts/session-catchup.py, scripts/session-catchup.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"398de47a58e7f892b76ef96cbd0c8b9a7745ca6fcf41e6a70dc5dfb2c26dd245"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060agent and (not safe(agent) or not safe(prompt))\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d83d4f8a59366bf4dee4ef1a48f351769feb2f7c2cf24e54c208988292bf412"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060agent is not None and (not safe(agent) or not safe(prompt))\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0bfefb29f06dee4aba018fec4900432a8a0c641e6d5eb98825234b2a87a6489"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060b\u0022**Status:** complete\u0022 in line or b\u0022[complete]\u0022 in line\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24baed88c0a27ecbe44b0c034fb71b5d717b1a2330fae3f51a2fa12d8236f9f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060b\u0022**Status:** in_progress\u0022 in line or b\u0022[in_progress]\u0022 in line\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"34bc36a5c427bd6cee3e4f02262b0906b779cec9a940929fb8078dc7a4bfe0d6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bool(name) and _SLUG_RE.match(name) is not None\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3e3bf7f2fa01cb1a01c8e38393cb2cc2e2605c8b6219af9e59a883afe9a86b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cand_real == root_real or cand_real.startswith(root_real \u002B \u0022/\u0022)\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa816f12f3bfc1754ddf120868c14f29027454a3e0c8dd6d3a8769f5e6d6c472"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060context == \u0022preflight\u0022 or not is_dir(plan_prefix \u002B \u0022.planning/sessions\u0022)\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aaf6e0cbf9ac74b4450abcf59a801e4389c4ca2d6bbbbee01511f2566db1fe6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060context == \u0022pretool\u0022 and mode in (\u0022autonomous\u0022, \u0022gated\u0022)\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"86298df306d88484673b9e030610109c91c849271b9e6d1645d29f0f2508f6b7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060current and is_codex_project_session(current, project_cmp)\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/session-catchup.py, .codebuddy/skills/planning-with-files/scripts/session-catchup.py, .codex/skills/planning-with-files/scripts/session-catchup.py, .continue/skills/planning-with-files/scripts/session-catchup.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e4a41eee2b1ec04d7398d968fa975f43494205aa6a9e7aa0857c9de59dca22e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cwd and normalize_for_compare(cwd) == project_cmp\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/session-catchup.py, .codebuddy/skills/planning-with-files/scripts/session-catchup.py, .codex/skills/planning-with-files/scripts/session-catchup.py, .continue/skills/planning-with-files/scripts/session-catchup.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"f388807e3e5de795ee97df7ffcb9417fc474805bbb4e722c71b93ec25aeef50c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060env.get(\u0022PWF_INJECT\u0022, \u0022\u0022) == \u0022smart\u0022 or mode_has(\u0022inject-smart\u0022)\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a9130c8e27a31ca9cb254a1d9703212f7404eca7b9a12cf0d619fd8ab6d25d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060env.get(\u0022PWF_PRETOOL\u0022, \u0022\u0022) == \u0022always\u0022 or not safe(session)\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a77b1b84e516132f23ff0de862a28b6ffd2106f0035553c0879c8d5ec43310"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060insec == b\u0022dec\u0022 and line.startswith(b\u0022|\u0022)\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b0f5fcc8014e88d6018fa50f046c3c832ff4e2a944d1cfaeec8a030d92af93"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060insec == b\u0022phases\u0022 and line.startswith(b\u0022### Phase\u0022)\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4716e6c35b39314e72facca2686a44c414dd847692f50d5d241999dc210dae"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_dir(candidate) and not is_link(candidate) and within(candidate)\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1522}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2dc569f9a73c6ba24a66e63ca073ad4cd18e3aa2b958a1b0747bf19f71e0bc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_dir(plan_prefix \u002B \u0022.planning/\u0022 \u002B slug) and not is_link(plan_prefix \u002B \u0022.planning/\u0022 \u002B slug)\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf64c499ebe65b7502dd52194db8393c9110858c2ed1f9866324f7215f067583"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_dir(plan_root \u002B \u0022/sessions\u0022) and is_file(project_root \u002B \u0022/task_plan.md\u0022)\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1474}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ca43be595ab67e6b7fe09a16a577013af6ed06e22a4eaaf45784168ccb8353"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_file(self.inject_sh) and is_file(self.resolver_sh)\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"32917c776f37a2f553c04e169f5025832df33a9bf6f54bcfb2b30f73ed911efc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(item, dict) and isinstance(item.get(\u0027text\u0027), str)\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/session-catchup.py, .codebuddy/skills/planning-with-files/scripts/session-catchup.py, .codex/skills/planning-with-files/scripts/session-catchup.py, .continue/skills/planning-with-files/scripts/session-catchup.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9e2e5acc293cb8c7a4c94385373f74b98b46c66d5346487b4f588e3228681f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(item, dict) and item.get(\u0027type\u0027) == \u0027text\u0027\u0060 appears character-identically in 3 files \u2014 .hermes/skills/planning-with-files/scripts/session-catchup.py, .mastracode/skills/planning-with-files/scripts/session-catchup.py, scripts/session-catchup.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"27fbe6155a0e920c9836514ab68399599067a075caf9d8eb4dd65b252a60a942"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(item, dict) and item.get(\u0027type\u0027) == \u0027tool_use\u0027\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/session-catchup.py, .codebuddy/skills/planning-with-files/scripts/session-catchup.py, .codex/skills/planning-with-files/scripts/session-catchup.py, .continue/skills/planning-with-files/scripts/session-catchup.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b35aec50adc6ee5b6cf6f86486eec87111da110d4c30b6cb01f4cdceed6831"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(source, dict) and \u0027subagent\u0027 in source\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/session-catchup.py, .codebuddy/skills/planning-with-files/scripts/session-catchup.py, .codex/skills/planning-with-files/scripts/session-catchup.py, .continue/skills/planning-with-files/scripts/session-catchup.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e313137d19d815e5a41ca0111fd34691ce5c667679c7ec92cf26c5537757f7d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, str) and re.fullmatch(r\u0022[A-Za-z0-9][A-Za-z0-9._:-]{0,127}\u0022, value)\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9fc428a706b57963d49d0d9ecb49c8c8feaafe353d9a7fa8c54c6e122f9265"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(p) \u003E= 3 and p[0] == \u0027/\u0027 and p[2] == \u0027/\u0027\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/session-catchup.py, .codebuddy/skills/planning-with-files/scripts/session-catchup.py, .codex/skills/planning-with-files/scripts/session-catchup.py, .continue/skills/planning-with-files/scripts/session-catchup.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"034b5ba6dd56ddf1054519f625ddf4e0bfcc36e0bc042400ea1e167fd6e4a97a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(p) \u003E= 3 and p[0] == \u0027/\u0027 and p[2] == \u0027/\u0027 and p[1].isalpha()\u0060 appears character-identically in 3 files \u2014 .hermes/skills/planning-with-files/scripts/session-catchup.py, .mastracode/skills/planning-with-files/scripts/session-catchup.py, scripts/session-catchup.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"a943f93655421ffdecdfb5ff35acf1bd91823d813f642fc6186c6ee99422eca8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(view) \u003C= PLAN_VIEW_LIMIT and pretool_cache(action, os.environ, plan_path, mode, view, truncated == \u0022true\u0022)\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"70688967e4a74ed8740e082bdf132b80189e3d5c2ca6b07603e1b266ac624d5b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060mode in (\u0022autonomous\u0022, \u0022gated\u0022) and is_file(lsum_sh)\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf2030d192b5785fbc33dbbbcebcc9dacb8d4347b151bdbbfb30c1cc67e242b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060mode in (\u0022autonomous\u0022, \u0022gated\u0022) and not attest\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e3e707f9f5de95fe1c7f7651a05f77b4f90322883e7d11897e8acfe4f9e800"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name.startswith(\u0022ledger-\u0022) and name.endswith(\u0022.jsonl\u0022)\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1393}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca171cf8b2b720aac31aba4bdd78d03aac194f9fd8f9af5d0b88ff6e7593ce8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not acceptable(opened) or _identity(before) != _identity(opened) or _identity(after) != _identity(opened)\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f994025e3533c65fe80ddc92a668ff8c2bad3812d10c29f4762a4fbbbd1d18f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not data or data.get(\u0027type\u0027) != \u0027session_meta\u0027\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/session-catchup.py, .codebuddy/skills/planning-with-files/scripts/session-catchup.py, .codex/skills/planning-with-files/scripts/session-catchup.py, .continue/skills/planning-with-files/scripts/session-catchup.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e61c97b3b66c3b682e467421aeca630f6a82753c398c662861916433d4bba0e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not directory_ok(os.lstat(root)) or _identity(frozen) != _identity(os.lstat(root))\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cceb07100846bd00a5285b1abbcdcf4303d84568e4075df8154a32327507225"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not file_ok(opened) or _identity(before) != _identity(opened) or _identity(os.lstat(slot)) != _identity(opened)\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"71bc8c37dab51f9e2649220218bc8b28671a34c7004f8929f175e444e29fba67"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(data, dict) or not safe(data.get(\u0022session_id\u0022))\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0846c8d21470b93e18660d785bef9f82f14327a45bd21f34c1df74f9368a5b6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(item, dict) or item.get(\u0027type\u0027) != \u0027tool_result\u0027\u0060 appears character-identically in 10 files \u2014 .agents/skills/planning-with-files/scripts/session-catchup.py, .codebuddy/skills/planning-with-files/scripts/session-catchup.py, .codex/skills/planning-with-files/scripts/session-catchup.py, .continue/skills/planning-with-files/scripts/session-catchup.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0cee2a508ca58cc673bb6603b7ad49d132c193f4cd1ed9d59076d0c0145765"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(line_num, int) or line_num \u003C= after_line\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/session-catchup.py, .codebuddy/skills/planning-with-files/scripts/session-catchup.py, .codex/skills/planning-with-files/scripts/session-catchup.py, .continue/skills/planning-with-files/scripts/session-catchup.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"063ec696d27b88708344af5ad64cf7dc8dcb1354c7c26c628a2cce2a2d028ee0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(source, str) or not source.strip()\u0060 appears character-identically in 10 files \u2014 .agents/skills/planning-with-files/scripts/session-catchup.py, .codebuddy/skills/planning-with-files/scripts/session-catchup.py, .codex/skills/planning-with-files/scripts/session-catchup.py, .continue/skills/planning-with-files/scripts/session-catchup.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd29f40bc0cd0570c15645feea50f7e381d3e22d66cab8aecedbd210a6787a20"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(use_id, str) or not use_id\u0060 appears character-identically in 10 files \u2014 .agents/skills/planning-with-files/scripts/session-catchup.py, .codebuddy/skills/planning-with-files/scripts/session-catchup.py, .codex/skills/planning-with-files/scripts/session-catchup.py, .continue/skills/planning-with-files/scripts/session-catchup.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"393c540bcfefb9240c313f6062107095d8ee058d4f78117a521f3d60f1eef7ad"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not resolved and is_dir(plan_prefix \u002B \u0022.planning\u0022)\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"122bc638deebdb781aaede46272d9390272c4b5ca1f721ff239765089ab93622"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not resolved and is_file(plan_prefix \u002B \u0022task_plan.md\u0022)\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8019e4bc65cf63d8feec422e13f1d62897941b7785500e9bc5914e386acd9a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not spelled or not is_file(fs \u002B \u0022/task_plan.md\u0022)\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1659}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cdf39a90fb34a0e0cf3b78efa0b320e66a44719ef3c407ba2b49686e661612"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not stat.S_ISREG(opened.st_mode) or _is_reparse_or_link_stat(current)\u0060 appears character-identically in 2 files \u2014 .codex/hooks/context_frame.py, .hermes/plugins/planning-with-files/context_frame.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/hooks/context_frame.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b91e0aa924d7acfe3d8c74c1c78cb6b4250dc505e5a912f93f135ef6a98312"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not stat.S_ISREG(opened.st_mode) or opened.st_nlink != 1 or _identity(before) != _identity(opened) or _identity(after) != _identity(opened)\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09b70eaf3a7272d2c40c9cc3929e48e737ead2de58bd0db1377ae4528ba3b70"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not stat.S_ISREG(opened.st_mode) or opened.st_size \u003E max_source_bytes\u0060 appears character-identically in 2 files \u2014 .codex/hooks/context_frame.py, .hermes/plugins/planning-with-files/context_frame.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/hooks/context_frame.py"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"5436898219f3ce5ef7d89837700e600804eaf5f46ced09e84b882d8e3392dd8a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060opened_final != frozen_source or not _inside(opened_final, frozen_root)\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdeca2de027b8d4cc29734bd3a7c1eb0d8cae9abbc577943ffc90875dd5343d9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060os.environ.get(\u0022PWF_SKIP_SUBAGENTS\u0022) == \u00221\u0022 and event in (\u0022pre-tool-use\u0022, \u0022post-tool-use\u0022) and not hook_is_main(payload)\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1764}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05f12e0ed9f6f74359fdeaa4aa0587fff2995f1bba36e4ec5a9324cf525cfac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060os.name != \u0022nt\u0022 or windows_final(fd) == frozen_descriptor\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"279a496376577897ea389b3906c96af7e7e71845b56e2e26173110aed36da8c1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060os.name == \u0022nt\u0022 and _descriptor_final_path(fd) != frozen_marker\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e27f04f8e14d6dfafcad173277a52cde09459b9c82518c035a863b746c10d8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060os.name == \u0022nt\u0022 and terminated and line.endswith(b\u0022\\r\u0022)\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd18d3d4007a6a8f4051bade1a0f5712e653c20b09aaebca951f2de18ca3ffcf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060payload.get(\u0027type\u0027) != \u0027patch_apply_end\u0027 or payload.get(\u0027success\u0027) is not True\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/session-catchup.py, .codebuddy/skills/planning-with-files/scripts/session-catchup.py, .codex/skills/planning-with-files/scripts/session-catchup.py, .continue/skills/planning-with-files/scripts/session-catchup.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"414effa4d31892569e7ff0d219f66a6c1309c04bf8a080c3fa38d3404e458e5e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pin_is_absolute(plan_root_pin) and is_dir(plan_root_pin)\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db2fc11b090c65e3108b91a7a0571ecddad1459c0973dd7ed445f0e2ee8012d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060relative == os.pardir or relative.startswith(os.pardir \u002B os.sep)\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90be6a7366c810cd19c2e31924d3d13c016716872b750862daf85f350dea773"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060root_mode_file and file_has_token(root_mode_file, token)\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"aefab0592810d880bc6fe1a0b06e2880c574fa7ac4d674f00841952a61a1ade2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060root_mode_file and is_file(root_mode_file)\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"958cb09b1495366a7e6f7dc949c62a835ee7c3a245cef69ae730c12752768b80"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060runtime_name == \u0027claude\u0027 and not is_substantial_session(session)\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/session-catchup.py, .codebuddy/skills/planning-with-files/scripts/session-catchup.py, .codex/skills/planning-with-files/scripts/session-catchup.py, .continue/skills/planning-with-files/scripts/session-catchup.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"a391082064f4f05a491e2ba017cce29da55b53bea84fc31333617cd9dee1a75f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.env.get(\u0022PLAN_ID\u0022, \u0022\u0022) or self.env.get(\u0022PWF_PLAN_ROOT\u0022, \u0022\u0022)\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1610}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ecd66e069d1559bf3ba9149237ce61955e02df5e3ffebc0db12c759d3e8fcd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060slug_is_valid(name) and is_file(candidate_dir \u002B \u0022/task_plan.md\u0022)\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad12de16be29470d483cef68667ed1e46a8696484a1b459c098c8ccaffd7fd54"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060slug_is_valid(plan_id) and is_dir(plan_prefix \u002B \u0022.planning/\u0022 \u002B plan_id) and not is_link(plan_prefix \u002B \u0022.planning/\u0022 \u002B plan_id)\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e73c8489f9ee049f0a7c3f377d150dad1fffdc50df0398c520d9bb87fa02bbc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060smart and smart_plan_extract(plan) is not None\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1abde74071f2eb87e6cf940fd4f827676b20c9be65e2eb76d2a48c7cd2c4805"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060spelled and is_file(fs \u002B \u0022/task_plan.md\u0022)\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1608}}}],"partialFingerprints":{"codehealthFindingId/v1":"5853921ad21d3cfe433fec1a8e22c9b9d641d637036c66f9c0e4414f760debd9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060src_hash and dst_hash and src_hash != dst_hash\u0060 appears character-identically in 2 files \u2014 .hermes/skills/planning-with-files/scripts/sync-ide-folders.py, scripts/sync-ide-folders.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/skills/planning-with-files/scripts/sync-ide-folders.py"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79a6f2c1f9535843f7c22af10dc1341050f9247fb69781d3bb30d4c972487db"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stat.S_ISDIR(target_info.st_mode) and not _is_reparse_or_link_stat(target_info)\u0060 appears character-identically in 2 files \u2014 .codex/hooks/context_frame.py, .hermes/plugins/planning-with-files/context_frame.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/hooks/context_frame.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9a676a814fd33ce605cc76342a045143519a51b7c0a27a5c30f7431951a825"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state[\u0022inphase\u0022] and state[\u0022curprog\u0022] and state[\u0022act\u0022] == b\u0022\u0022\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"562948de7c969e860569b0c1dd68229778bd174d872304d26a9b232e17257d1a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060strip_cr and terminated and line.endswith(b\u0022\\r\u0022)\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0838c17b085e81c1db450a840c45075ab590e0a549ac88e07e8a7ef321054a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sys.platform != \u0022darwin\u0022 or not stat.S_ISLNK(info.st_mode)\u0060 appears character-identically in 2 files \u2014 .codex/hooks/context_frame.py, .hermes/plugins/planning-with-files/context_frame.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/hooks/context_frame.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"2248c189742f4c241872659bc6539f9f5c3561e59990ba08d71f052adf4849fa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.startswith(\u0022/\u0022) or re.match(r\u0022^[A-Za-z]:\u0022, value) is not None or value.startswith(\u0022\\\\\\\\\u0022)\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e308df8d097012a55a4765ae43705ca0b135df359f4b6e9c37e13922e54b30b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.startswith(\u0022\\\\\\\\\u0022) or value.startswith(\u0022//\u0022)\u0060 appears character-identically in 15 files \u2014 .agents/skills/planning-with-files/scripts/inject-plan.py, .codebuddy/skills/planning-with-files/scripts/inject-plan.py, .codex/skills/planning-with-files/scripts/inject-plan.py, .cursor/skills/planning-with-files/scripts/inject-plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1e56385aa2c9f99ba7729b22e88a00a7470b65334ab7c8a7df991683879bc8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26d8cf4dc826562f07fb3e755bbae6bbd140f609a4974be417911ef16dd0fd6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1776}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d4aed8036ca80f6b3635798e16f2e3db1c3043781096374e244ccce07ecd2b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zht/scripts/inject-plan.py"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c134d251677660b612130619282666361d4c5f5c30ca34efc6621da6f7b3845"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zht/scripts/inject-plan.py"},"region":{"startLine":1776}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e6958197ed958d91fa91bdcada5d365d8d2ee20e27509aec843a2956768b52"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zh/scripts/inject-plan.py"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaca58dcba08b21d120aac7001c32434d36a2d24d0a77cb1c81c7180dfc1fdf4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zh/scripts/inject-plan.py"},"region":{"startLine":1776}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3dac3ebd8965efd882f05c3b2450c55032ddf0b0d13be62981adf8b7b0c6df"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-es/scripts/inject-plan.py"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd1390073740d6eca354830ac913b5dbe21bdbdc7d04b01865fca5152c6eedff"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-es/scripts/inject-plan.py"},"region":{"startLine":1776}}}],"partialFingerprints":{"codehealthFindingId/v1":"1136f9d34226c68e345da556cd37673a17460340a1b09332dfc00abebcf0e5bc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-de/scripts/inject-plan.py"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f02c2812fb39c703f2f1ab53663633b1902b907412367889d4a8df75592956"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-de/scripts/inject-plan.py"},"region":{"startLine":1776}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6cd693c6ee195b336db50ec8ba0df4637b12009f2443fadee96258e829f3973"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-ar/scripts/inject-plan.py"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"780151557c082c88fe63a2bf23486de9a718c1991a349ac7d5cd179175baee21"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-ar/scripts/inject-plan.py"},"region":{"startLine":1776}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c2551e458b4808aa32372a6a6638d6a89ba366dd5492d30439167683ffd23a"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/planning-with-files/scripts/session-catchup.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3c2cde1abbac7f90f9bffea57b93d927f4dc58f4481e7c4a97cfd52988bf42"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zht/scripts/session-catchup.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c47044f5fe019e58231511a6831b11850e6d8c9f9b1e784d54ecd0f3a717db1"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zh/scripts/session-catchup.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c12d870f87acd4095bea9319d27c349453bade0a0f61a6857c0ad8d33f470c9"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-es/scripts/session-catchup.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"aecaa941df38feefac17fd8747e295da0c5bb95ad4c5171032b597ff44e81fd8"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-de/scripts/session-catchup.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"297da9776b44d2e54b06c629ea06318b956837d7dba5d8e752654ddc0860b862"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-ar/scripts/session-catchup.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc550f67c77e3ab648a3db3c8d13d1aa48d9cfd4d7ee82b5a6a927fe634ece1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060slug_is_valid\u0060 returns \u0060False\u0060 when \u0060UnicodeDecodeError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4b1d24e5a46bec2fee392e5e8be874e79c13936609229a06788afc9a5a2789"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060canonicalize\u0060 returns \u0060\u0027\u0027\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54cbfcf786b9075caeb06788cf57edd7a72766f4b06efcf694d7fd481ff1c7b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060mtime_seconds\u0060 returns \u00600\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc90b6ce8fcf2d461f230ce2bf30d942b8b9b593a107b2e7f9fe3adfb914d66"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_inside\u0060 returns \u0060False\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad084810ffbb9b8abd5334eed02a68ece908f0d7b431a05bca99693c13b80200"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060hook_is_main\u0060 returns \u0060False\u0060 when \u0060(ValueError, UnicodeError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ec5f76b30ca6142d15b0c72e603fa0776522206361b3eafce5ede944d78516"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060main\u0060 swallows every exception into \u0060return 3\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"84798e716a1922c7f93cbbc4e85c0d9d81fc24a996f3b1d03467362d2fae5eb4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060slug_is_valid\u0060 returns \u0060False\u0060 when \u0060UnicodeDecodeError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codebuddy/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"04fcc90a20f9bdb2436accbc0d147a4cc6434fe8c8ab9950ce3d8f81471c391e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060canonicalize\u0060 returns \u0060\u0027\u0027\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codebuddy/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"92fa0f0e03a5c27f7ceb94b7595c761ee6139bf5f3e355726fb24c4556e78fb2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060mtime_seconds\u0060 returns \u00600\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codebuddy/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"570dfcb4e5fb899f0364f261e46311a2a737536f733aded220aefb0d050aa449"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_inside\u0060 returns \u0060False\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codebuddy/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"964b810660dbe30b508e95c6a3df89e9aaedbb525d3f6eab8010eb6f611e990d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060hook_is_main\u0060 returns \u0060False\u0060 when \u0060(ValueError, UnicodeError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codebuddy/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"0991f42e4619b7081406486a758deeb28e22c22fbdf2be895c9192dc0c8d0e6d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060main\u0060 swallows every exception into \u0060return 3\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codebuddy/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f7b321dec340fb48d532dea8b119c52d3bdf20722877a0e6b3dc7fa7f96ff8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060load_payload\u0060 returns \u0060{}\u0060 when \u0060json.JSONDecodeError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/hooks/codex_hook_adapter.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac274bfbbcfc88174dbeedf5c7f9d570f38c851430bf1a20b71047fce48d3350"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060parse_json\u0060 returns \u0060{}\u0060 when \u0060json.JSONDecodeError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/hooks/codex_hook_adapter.py"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1fd5d383b6f1cda44e7c67124a448b777668e024c5ea6878b8abc142da5311e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060slug_is_valid\u0060 returns \u0060False\u0060 when \u0060UnicodeDecodeError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a5598019c2c5a1148f8ced795030628c6b0c60ca64d26e35e91a89b8791579"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060canonicalize\u0060 returns \u0060\u0027\u0027\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"e197d186b387a5630a478e187e60091a88cdd736499593145a85f53f285721f4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060mtime_seconds\u0060 returns \u00600\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7d149bf1a6e5b8b3441dbd0434a404bf20699af48c39f39c2d5046666ddd42"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_inside\u0060 returns \u0060False\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76498877169b8f21c71639dc97c42b74efbb800a36627a542d6548ee73fd863"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060hook_is_main\u0060 returns \u0060False\u0060 when \u0060(ValueError, UnicodeError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee0e78d8eaf2603fce175ab30a1a55c72de941969e83120e8ab36bfaf8f5823"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060main\u0060 swallows every exception into \u0060return 3\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".codex/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ddb9250063d5fa1d78cbbeac0594d1b36851261a69e5f2ffa56178713793a51"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060slug_is_valid\u0060 returns \u0060False\u0060 when \u0060UnicodeDecodeError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".cursor/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1fa87d5366730434dfb3e28f595ab336c73eb2db8eda30bde97e7c4ceb85b3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060canonicalize\u0060 returns \u0060\u0027\u0027\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".cursor/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef9ab5e211fec08c16b3684637efea491897a9d1715c81f9cfa5f27beecddb1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060mtime_seconds\u0060 returns \u00600\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".cursor/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf5d9f92f27de1b1ed6ec9456ae051b6a6631ebdd14cb73892697eaf29569f1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_inside\u0060 returns \u0060False\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".cursor/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4b5cde85ed4d72eb7f113d48735ffe96d112a4b73e99d6cc5c0fa74a405593"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060hook_is_main\u0060 returns \u0060False\u0060 when \u0060(ValueError, UnicodeError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".cursor/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ee09aeeb2591f110bd633c7168804084fdf7272866d4fb7d35b9eb35575804"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060main\u0060 swallows every exception into \u0060return 3\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".cursor/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"635f3a8b33f67639dbd7c27ac56d698e177a912658c500266d95684287498125"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060slug_is_valid\u0060 returns \u0060False\u0060 when \u0060UnicodeDecodeError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".factory/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"8afda62e0e0c94123dd99ddc6af3cdb7acc8aed2f0615dd7d489a7f899a7eec3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060canonicalize\u0060 returns \u0060\u0027\u0027\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".factory/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda44c80fe23e3ba875d4a1cc32d71cf3d814ebb17f5e2f93550eb9120cf11b6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060mtime_seconds\u0060 returns \u00600\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".factory/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d0e0c0e0487ed1b937b95fddbd20deef9fc7d987487269c8e391cd7d9f0e8b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_inside\u0060 returns \u0060False\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".factory/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e4e4387d8591f3e15b3c84bf09b7a2d83b24a2ae359609c06f66427ef1cabc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060hook_is_main\u0060 returns \u0060False\u0060 when \u0060(ValueError, UnicodeError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".factory/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c455a6c2dee3371b9ea11b13d037b73a6ad7be0b296038d30c40abf3a4d13f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060main\u0060 swallows every exception into \u0060return 3\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".factory/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"237d45eb28c96492fb77153d45f89d3fb9ba5b03e5895cf2c3fdd52a0fe04b54"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_launch_dir_hint\u0060 returns \u0060\u0027\u0027\u0060 when \u0060(OSError, RuntimeError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/plugins/planning-with-files/__init__.py"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97ab3a6b9e6f73e67918967135f46b3d50d92c440cc5d84943f0387e4b4c730"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060session_id\u0060 returns \u0060\u0027\u0027\u0060 when \u0060(ImportError, AttributeError, OSError, RuntimeError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/plugins/planning-with-files/session_binding.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd79f80202dcdcabe94433c11ccc0615fceeb4e49fcf3fce70a3620f781bf8b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060slug_is_valid\u0060 returns \u0060False\u0060 when \u0060UnicodeDecodeError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".mastracode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"4351ba8a02b69f023092fc627493ae46ff88703f2c33bec1177a99ad3ad39f89"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060canonicalize\u0060 returns \u0060\u0027\u0027\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".mastracode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b70151a772444e791cc4836d5b87c9d6e28a4dbd847bcc19159007be81562f3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060mtime_seconds\u0060 returns \u00600\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".mastracode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7f86d2e12dca9f9f32f26032fac5fa71d158801ce9cdaef65f03a45903102f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_inside\u0060 returns \u0060False\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".mastracode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7d9947e4d89f8ecfed6d060cb52ab4815cf582a4f000f98ee565386befc4e6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060hook_is_main\u0060 returns \u0060False\u0060 when \u0060(ValueError, UnicodeError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".mastracode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"67639fa842ab804a842bf60d3cb33c8dc20155605445f254cf493173c22f5679"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060main\u0060 swallows every exception into \u0060return 3\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".mastracode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"567bc2333c7da615243f7532e8c9dd05d2205a3ace920b38e338d8802ca8b990"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060slug_is_valid\u0060 returns \u0060False\u0060 when \u0060UnicodeDecodeError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".opencode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00db572bc4ec63d3e55d59a84f427bc296cd0c555ad30af634a6471eb726b47"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060canonicalize\u0060 returns \u0060\u0027\u0027\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".opencode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e69be6bc7787ae9ac4bcc4073be82cd2d94ed3ca6d323595e823b42d34be8d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060mtime_seconds\u0060 returns \u00600\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".opencode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdef17dfa16b10798701859e3b74544bb7a82c2a96f5b82c0de984168ae41ad4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_inside\u0060 returns \u0060False\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".opencode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f16584e307b4838c38236ef72f01a8debf17707204f9765a89ff2990ccdb52"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060hook_is_main\u0060 returns \u0060False\u0060 when \u0060(ValueError, UnicodeError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".opencode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64da08e92f76d5f334ef2e00ce237234e579a6acbb567b69318900b73fd56b5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060main\u0060 swallows every exception into \u0060return 3\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".opencode/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c9950cdb96476958afcc9c7bf5913d17a035f32f21eaf64ec364cf98b8927b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060slug_is_valid\u0060 returns \u0060False\u0060 when \u0060UnicodeDecodeError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".pi/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32021b1364c9a4ca7b51158c67e1d18c54ed8e594f76db1959c90f2d496fc9d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060canonicalize\u0060 returns \u0060\u0027\u0027\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".pi/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"3385bb0f3cb0439081908c6d47ec763165c65318c8995da6e8ceb3ef224d367e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060mtime_seconds\u0060 returns \u00600\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".pi/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c8d3734040fbb57554e44ff0440d4f9d668a480f7102d8759a6a6af0c275f1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_inside\u0060 returns \u0060False\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".pi/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"61944c87e0f395de47d07bee23c4254bb77c66933302b81228ceff38b9dd2820"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060hook_is_main\u0060 returns \u0060False\u0060 when \u0060(ValueError, UnicodeError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".pi/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"969617e7e29a69e470d2d2b3a2e0ee0b9a2826759ba838cf0bd2dd311a0b130b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060main\u0060 swallows every exception into \u0060return 3\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".pi/skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ec2b1d7091fad247d0c91ab8ab7f76df4432c34fd8bae4c3ba74626fc709c0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060slug_is_valid\u0060 returns \u0060False\u0060 when \u0060UnicodeDecodeError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/inject-plan.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fbdeafa39422cbd28f5813b73ece6acc745f52cb450ab2251a8fa06f33d1326"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060canonicalize\u0060 returns \u0060\u0027\u0027\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/inject-plan.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"289bbd1f535cdee7ed6d5a4651cad47678b4c603be777b0598b29f618f1f28dc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060mtime_seconds\u0060 returns \u00600\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/inject-plan.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"3291b1f126497020ae9e126185f7527a416a319fa542f9e8c51ac8cd21e64673"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_inside\u0060 returns \u0060False\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/inject-plan.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd4c48cd19f2f9096360a0e3026287a783362ebf485993d38d3953a66f361a7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060hook_is_main\u0060 returns \u0060False\u0060 when \u0060(ValueError, UnicodeError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/inject-plan.py"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ed230b0b8e5bd00cd2c4ea2c4212fe545645a621ac03ab36d2936181f8e76e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060main\u0060 swallows every exception into \u0060return 3\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/inject-plan.py"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"5676226b6507e2db99b63af9906d79cf1d41b9657954ba07b44766a973f0781d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060slug_is_valid\u0060 returns \u0060False\u0060 when \u0060UnicodeDecodeError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-ar/scripts/inject-plan.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35dd33182c8280b4b8210d8693807e719edccab01ea6e50891828923ab27fa1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060canonicalize\u0060 returns \u0060\u0027\u0027\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-ar/scripts/inject-plan.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5cb71ca89de663d9a1b63c03a4e8e76d09272ef3df00b64acbef395458631f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060mtime_seconds\u0060 returns \u00600\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-ar/scripts/inject-plan.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"67117c3a4570548772cfd8dc8f63c671ee88567503e671a41dcff2c2f759dcf0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_inside\u0060 returns \u0060False\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-ar/scripts/inject-plan.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03aef11c1b77b2404d944e4bf769a28ed814f6a45fa5d1d071b17b296cfb918"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060hook_is_main\u0060 returns \u0060False\u0060 when \u0060(ValueError, UnicodeError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-ar/scripts/inject-plan.py"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee7fcc6bef0695d6e7b66baba698b87f9ae5da53e57e0f353fe63e44bba2f9f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060main\u0060 swallows every exception into \u0060return 3\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-ar/scripts/inject-plan.py"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8687b4f3bcdee7e97115d43db4a0d59bf383395b834fad3f23956683a75424"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060slug_is_valid\u0060 returns \u0060False\u0060 when \u0060UnicodeDecodeError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-de/scripts/inject-plan.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fac2fe7a35f972ba730c05acdd8db1540f879e31d3d70717dc67b2efda1d4ac"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060canonicalize\u0060 returns \u0060\u0027\u0027\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-de/scripts/inject-plan.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f91ba0c45a8c8489c2dc8a0267cc446126e49a1c11f92211f6a4b8619834742"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060mtime_seconds\u0060 returns \u00600\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-de/scripts/inject-plan.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"150ff86942b65f6c757d6662574a9bed7254c7190cea8784322d042464b5ceec"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_inside\u0060 returns \u0060False\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-de/scripts/inject-plan.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"0490503a0808ed2a3f3d04cc5471050585fb0b4ebb87bf8195829f26910bb688"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060hook_is_main\u0060 returns \u0060False\u0060 when \u0060(ValueError, UnicodeError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-de/scripts/inject-plan.py"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc991766175d13ab9bffe9736648b076f8a3887897b45e86110f03226ae6e040"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060main\u0060 swallows every exception into \u0060return 3\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-de/scripts/inject-plan.py"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f39e8e7a363b3aaeeb8807b3da8247cbf407699ade0680ebee8b5951fffc4b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060slug_is_valid\u0060 returns \u0060False\u0060 when \u0060UnicodeDecodeError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-es/scripts/inject-plan.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa28d61ac22d8294546dcd6b879f90af82620762b58d166e7f928cf1c4079a3f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060canonicalize\u0060 returns \u0060\u0027\u0027\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-es/scripts/inject-plan.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"55717505c0c1176998731246aca49fff4d9aef1de7c47a21ca64f09508b92205"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060mtime_seconds\u0060 returns \u00600\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-es/scripts/inject-plan.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc6401af9b636478b6b022cc698f4400ca83ff76f01f94f7f2142c26ad2b127"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_inside\u0060 returns \u0060False\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-es/scripts/inject-plan.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d98d66df65e231580981b5efcf65d012f5d5c23b5f1a0d99c131f7a47fdc7ad"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060hook_is_main\u0060 returns \u0060False\u0060 when \u0060(ValueError, UnicodeError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-es/scripts/inject-plan.py"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"06aeb4692e0edc9c2757dc15b68b35962148d9561f3e0810f54565f37a2f50f6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060main\u0060 swallows every exception into \u0060return 3\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-es/scripts/inject-plan.py"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7fa86c710a4a3ac94656f8ee9e3bd9e05f96eb0c9c377d45dabd431311e0b58"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060slug_is_valid\u0060 returns \u0060False\u0060 when \u0060UnicodeDecodeError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zh/scripts/inject-plan.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"3438564fb5778665a25184ebb7c6f1584b57c5cc7056b1f72b892ffda65c6de9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060canonicalize\u0060 returns \u0060\u0027\u0027\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zh/scripts/inject-plan.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc50e6790cf673a3f28b330691140576074e85f21fe019ba2979a3ac7e053918"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060mtime_seconds\u0060 returns \u00600\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zh/scripts/inject-plan.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"a290ef1db55ed8f4559ac3bee0b1ca8f9b7d23e8ae10dd1c5c129876dc134f8e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_inside\u0060 returns \u0060False\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zh/scripts/inject-plan.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"2847555a1537f1fbfeec2fdf2fd8fdb0e15180d9b19e3ffb43ee62047862c438"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060hook_is_main\u0060 returns \u0060False\u0060 when \u0060(ValueError, UnicodeError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zh/scripts/inject-plan.py"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"772e0ae2ca9c38fd37e520f6c005f2abccbdb200b362c9741cf6404078201325"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060main\u0060 swallows every exception into \u0060return 3\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zh/scripts/inject-plan.py"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae27f1304baf5a1207e6b2170961f3a7d167f2da4a641a4e4f3b442fff88a5f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060slug_is_valid\u0060 returns \u0060False\u0060 when \u0060UnicodeDecodeError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zht/scripts/inject-plan.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6a3eac34db0d33f057d599e20b4392c234355f133112090a88a96243de265d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060canonicalize\u0060 returns \u0060\u0027\u0027\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zht/scripts/inject-plan.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42dc4b18ae3d11d4ba053f3015caba5af56b7179f46c902e32a3e994737640b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060mtime_seconds\u0060 returns \u00600\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zht/scripts/inject-plan.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"73eba591ae9344c9d9532a96c3adfeaa5308ea117317e0b1675f9862bcb8e7a0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_inside\u0060 returns \u0060False\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zht/scripts/inject-plan.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c98df38c42185ab8a8d1978726c45ae73bedf8ca7a79920cdce3d63191b2cc6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060hook_is_main\u0060 returns \u0060False\u0060 when \u0060(ValueError, UnicodeError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zht/scripts/inject-plan.py"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"794cbe29e87e71f562b0ebbf32775a2463e6687992c4908ea00aa4daad3a1212"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060main\u0060 swallows every exception into \u0060return 3\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/i18n/planning-with-files-zht/scripts/inject-plan.py"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee2eff458a5a32e45c99f896b77d8b7f99d9f5575e0551503f8be7e6e208b028"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060slug_is_valid\u0060 returns \u0060False\u0060 when \u0060UnicodeDecodeError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf1828e3101c539f04ffdcf9dfcd3fc7c2b6f5aa567bc8e3cdb0dbbe390649b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060canonicalize\u0060 returns \u0060\u0027\u0027\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a453e75f1d16f05223f45a12784ddda0b6c3c51ba742fdf6ffcba90573f099c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060mtime_seconds\u0060 returns \u00600\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"4acc93f12f152a8f3295cfd92587ba2bf9fc18946f3b78e8c942a18cb3709387"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_inside\u0060 returns \u0060False\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8dc6669d36766c86181a967182b19c3ad61cd9ea520597d9ad93c7779ca4f0a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060hook_is_main\u0060 returns \u0060False\u0060 when \u0060(ValueError, UnicodeError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5229f85e9e0bb1a009132cc29736ab94f676c74b632c25e08ab13107930348"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060main\u0060 swallows every exception into \u0060return 3\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/planning-with-files/scripts/inject-plan.py"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"be17781c03d94699cd77526ecf637e71b2f76c5bf5970496a6c3b4cecaebdc94"}}],"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-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"},{"id":"CWE-95","guid":"400bba4e-483c-5c50-a695-114fa9168003","name":"Improper Neutralization of Directives in Dynamically Evaluated Code (\u0027Eval Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Directives in Dynamically Evaluated Code (\u0027Eval Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/95.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"}]}],"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":50,"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."]}]}