{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"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":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"count.count_nac (cyclomatic 104): count.count_nac has cyclomatic complexity 104 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/count.py"},"region":{"startLine":1801}}}],"partialFingerprints":{"codehealthFindingId/v1":"3223497c6ef2ce1098f0177a9fd7b604b80391b53efffdf7cd714331c8c54e45"}},{"ruleId":"D1","level":"warning","message":{"text":"main.parse_count (cyclomatic 91): main.parse_count has cyclomatic complexity 91 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/main.py"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"db840c9d8aefa232d85f2f962139723c7c78d26e077ef379ce91073aebd1067a"}},{"ruleId":"D1","level":"warning","message":{"text":"count.count (cyclomatic 75): count.count has cyclomatic complexity 75 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/count.py"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51ad3ee36e31923ab41161991ca4930672023b162bda7e472958ffd54e33158"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.do_sum_matrices (cyclomatic 45): utils.do_sum_matrices has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/utils.py"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca48522e1ab67b77e011c16260e7b798f424670787b82f9938c0d1492fa666ea"}},{"ruleId":"D1","level":"warning","message":{"text":"main.parse_ref (cyclomatic 41): main.parse_ref has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/main.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"081066cc08a94c2c3c78c4fb9d59c20ff1b8c63396dd39f11cb6b9d8d2210fbf"}},{"ruleId":"D1","level":"warning","message":{"text":"main.main (cyclomatic 40): main.main has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/main.py"},"region":{"startLine":2068}}}],"partialFingerprints":{"codehealthFindingId/v1":"2523b8dce3fbbbebafd99edad3e20a6c3bc1e5756cb132892888ae691922e46a"}},{"ruleId":"D1","level":"warning","message":{"text":"count.count_velocity (cyclomatic 34): count.count_velocity has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/count.py"},"region":{"startLine":2549}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec4e0d55d03c88badbc39397622b41da114f5ad7fa87c2dd1dc4ada083beebf"}},{"ruleId":"D1","level":"warning","message":{"text":"extract.extract (cyclomatic 33): extract.extract has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/extract.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8572341249e38e614f06cd650e88bda59c6276ed663110234e98d800118158a"}},{"ruleId":"D1","level":"warning","message":{"text":"count.kallisto_bus (cyclomatic 31): count.kallisto_bus has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/count.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"6518e8f76416234a0e33c93b1eda7d5a15addee3a12249e33a1939eeb9691365"}},{"ruleId":"D1","level":"warning","message":{"text":"ref.ref_nac (cyclomatic 30): ref.ref_nac 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":"kb_python/ref.py"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"e311f3a7b3a6c3fcb90c0241f8251bd8184b8bb06b8b8cf49981b613b40aa99a"}},{"ruleId":"D1","level":"warning","message":{"text":"count.bustools_count (cyclomatic 26): count.bustools_count has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/count.py"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbcd6c867c629e6dbd4afd32daa834ef3d4159f93cd1172c553cffe2bbcefa4c"}},{"ruleId":"D1","level":"warning","message":{"text":"sweep.sweep (cyclomatic 22): sweep.sweep 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":"kb_python/sweep.py"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad517a741ed9165c2e354108875fdf8a5d7e1ab438fd6c9c35f1b1ecdc8a49b"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.run_executable (cyclomatic 22): utils.run_executable 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":"kb_python/utils.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b70bbe175e096c03af94d9c691b09d1291c148cad8a4968db42f22003b8c09c"}},{"ruleId":"D1","level":"warning","message":{"text":"ref.ref (cyclomatic 21): ref.ref 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":"kb_python/ref.py"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"d368880e629b883324cc45d269795dc7f32ad9321df26d228986accc39ce7124"}},{"ruleId":"D1","level":"warning","message":{"text":"ref.ref_lamanno (cyclomatic 20): ref.ref_lamanno 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":"kb_python/ref.py"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dca054781bbd527a390454609a3dde61f4a7182c6f6c1948cff5421df0e8f48"}},{"ruleId":"D1","level":"warning","message":{"text":"ref.generate_kite_fasta (cyclomatic 18): ref.generate_kite_fasta 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":"kb_python/ref.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bf327cb63c47d468fca78f3980e44ed66da56f30e9301c60f11a365cf3277f"}},{"ruleId":"D1","level":"warning","message":{"text":"count.count_velocity_smartseq3 (cyclomatic 17): count.count_velocity_smartseq3 has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/count.py"},"region":{"startLine":2981}}}],"partialFingerprints":{"codehealthFindingId/v1":"394e9ba60d785a4f7d20d4bf78091ed51236d3f3fc07af673fdc00b4483cfbda"}},{"ruleId":"D1","level":"warning","message":{"text":"count.kallisto_quant_tcc (cyclomatic 16): count.kallisto_quant_tcc 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":"kb_python/count.py"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a07c864683c4ef27843ad5a49b90425ff66849a4e23b4678910457809c04225"}},{"ruleId":"D1","level":"warning","message":{"text":"main.parse_compile (cyclomatic 16): main.parse_compile 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":"kb_python/main.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc662febb0e13e180212428c50be3523406370bca2290560bb5513e0d92d534"}},{"ruleId":"D2","level":"warning","message":{"text":"count.count_nac (cognitive 242): count.count_nac has cognitive complexity 242 (threshold 15). Drivers by points: if/else 57 (154 pts), ternaries 11 (32 pts), boolean chains 29, loops 10 (27 pts) (nesting depth added 135). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: kb_python/count.py holds 7 of the 23 methods over the threshold \u2014 including the worst \u2014 and 458 of the 918 points over it (50%), 2.1\u00D7 the next-largest file (kb_python/main.py at 215). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/count.py"},"region":{"startLine":1801}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b994f3efb70d96ed304e591685408298cfaa1320aafc2b180bf02f2cb41b41"}},{"ruleId":"D2","level":"warning","message":{"text":"count.count (cognitive 143): count.count has cognitive complexity 143 (threshold 15). Drivers by points: if/else 40 (77 pts), ternaries 16 (44 pts), boolean chains 15, loops 4 (7 pts) (nesting depth added 68). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: kb_python/count.py holds 7 of the 23 methods over the threshold \u2014 including the worst \u2014 and 458 of the 918 points over it (50%), 2.1\u00D7 the next-largest file (kb_python/main.py at 215). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/count.py"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"a806237c452e4b0da304bfd279b3eb6b8242e5165ffbdfe2acc0376cea1959ba"}},{"ruleId":"D2","level":"warning","message":{"text":"main.parse_count (cognitive 138): main.parse_count has cognitive complexity 138 (threshold 15). Drivers by points: if/else 52 (94 pts), boolean chains 29, loops 4 (9 pts), ternaries 1 (4 pts), error handling 1 (2 pts) (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/main.py"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1f6cb3598d845210b959d93248ffee4c5a7f0b17f4a95490e08e7fdc5a8ae8"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.do_sum_matrices (cognitive 63): utils.do_sum_matrices has cognitive complexity 63 (threshold 15). Drivers by points: if/else 22 (42 pts), boolean chains 16, ternaries 2 (4 pts), loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/utils.py"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecacbf88f20677d59f2d3abc9eb4c24dadd1195ab6a2e0efa9d4ad74416c235c"}},{"ruleId":"D2","level":"warning","message":{"text":"ref.ref_nac (cognitive 62): ref.ref_nac has cognitive complexity 62 (threshold 15). Drivers by points: if/else 18 (32 pts), ternaries 5 (16 pts), boolean chains 9, loops 2 (5 pts) (nesting depth added 28). 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":"kb_python/ref.py"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"40211d0ed80d0ea088793a2ea3ab857439e2d75f7e6cd2a9874fdd898e808c3d"}},{"ruleId":"D2","level":"warning","message":{"text":"main.parse_ref (cognitive 61): main.parse_ref has cognitive complexity 61 (threshold 15). Drivers by points: if/else 25 (43 pts), boolean chains 10, loops 3 (6 pts), ternaries 1 (2 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/main.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c36b343de5226b74db7feeb03604c10d25fdeaa1bc628c15bade69b65a1cfcc"}},{"ruleId":"D2","level":"warning","message":{"text":"extract.extract (cognitive 60): extract.extract has cognitive complexity 60 (threshold 15). Drivers by points: if/else 22 (39 pts), boolean chains 11, error handling 2 (5 pts), ternaries 1 (3 pts), loops 1 (2 pts) (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":"kb_python/extract.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b767694e59ad6afa94e8bfb3efae9bb011a08d8c1f4e83cbb119eedbbded279"}},{"ruleId":"D2","level":"warning","message":{"text":"count.count_velocity (cognitive 57): count.count_velocity has cognitive complexity 57 (threshold 15). Drivers by points: if/else 21 (36 pts), ternaries 4 (8 pts), boolean chains 7, loops 3 (6 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: kb_python/count.py holds 7 of the 23 methods over the threshold \u2014 including the worst \u2014 and 458 of the 918 points over it (50%), 2.1\u00D7 the next-largest file (kb_python/main.py at 215). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/count.py"},"region":{"startLine":2549}}}],"partialFingerprints":{"codehealthFindingId/v1":"901a89c7713e2f63b0fb54f10288cfa7e1eb8f9cab368fdbfd68c914f759d802"}},{"ruleId":"D2","level":"warning","message":{"text":"main.main (cognitive 57): main.main has cognitive complexity 57 (threshold 15). Drivers by points: if/else 25 (43 pts), boolean chains 11, ternaries 2, error handling 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":"kb_python/main.py"},"region":{"startLine":2068}}}],"partialFingerprints":{"codehealthFindingId/v1":"1435bb13946fa41a90f1526ad115d25847d23b59c33ef6124cbd07bab3052915"}},{"ruleId":"D2","level":"warning","message":{"text":"count.kallisto_bus (cognitive 35): count.kallisto_bus has cognitive complexity 35 (threshold 15). Drivers by points: if/else 25 (30 pts), boolean chains 3, 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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This file is where this pass\u0027s cognitive complexity CONCENTRATES: kb_python/count.py holds 7 of the 23 methods over the threshold \u2014 including the worst \u2014 and 458 of the 918 points over it (50%), 2.1\u00D7 the next-largest file (kb_python/main.py at 215). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/count.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e62d8e14c855de9b823730236d33c513bcb0ed9bd182f56067403a78b87a85"}},{"ruleId":"D2","level":"warning","message":{"text":"count.bustools_count (cognitive 33): count.bustools_count has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 12 (21 pts), if/else 10 (11 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: kb_python/count.py holds 7 of the 23 methods over the threshold \u2014 including the worst \u2014 and 458 of the 918 points over it (50%), 2.1\u00D7 the next-largest file (kb_python/main.py at 215). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/count.py"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc69f477014fe21a3096005f61cfb0bcc07d0e8d5c89f90c66ed71ed0a202e13"}},{"ruleId":"D2","level":"warning","message":{"text":"ref.generate_kite_fasta (cognitive 33): ref.generate_kite_fasta has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 8 (14 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/ref.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ffd4c0ddd28d094c7e6671d3139f7a093e651bebd3830bf3683cf7ba64fd70"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.run_executable (cognitive 33): utils.run_executable has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 4, loops 2 (4 pts), error handling 1 (3 pts), 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":"kb_python/utils.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd170de372e59808fc3f34d1b3c271dcb964f38e455fe8a925875dc22518abe"}},{"ruleId":"D2","level":"warning","message":{"text":"count.count_velocity_smartseq3 (cognitive 32): count.count_velocity_smartseq3 has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (18 pts), ternaries 3 (8 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: kb_python/count.py holds 7 of the 23 methods over the threshold \u2014 including the worst \u2014 and 458 of the 918 points over it (50%), 2.1\u00D7 the next-largest file (kb_python/main.py at 215). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/count.py"},"region":{"startLine":2981}}}],"partialFingerprints":{"codehealthFindingId/v1":"211b79633f77fdb2e4de2404a1735507f264885e8c6eb47ec4f017a4c05370fc"}},{"ruleId":"D2","level":"warning","message":{"text":"ref.ref_lamanno (cognitive 32): ref.ref_lamanno has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (15 pts), ternaries 4 (8 pts), boolean chains 7, loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/ref.py"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2fe091826b6e2e18123c0d3bf4d721a821a401bd8104a037590625448294126"}},{"ruleId":"D2","level":"warning","message":{"text":"sweep.sweep (cognitive 32): sweep.sweep has cognitive complexity 32 (threshold 15). Drivers by points: if/else 19 (29 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/sweep.py"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"055fa252fc5d791f062bace8d09c63935928f77f62c3da2bcb9b2690e43704fe"}},{"ruleId":"D2","level":"warning","message":{"text":"ref.ref (cognitive 30): ref.ref has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 6, ternaries 3 (4 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/ref.py"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba4bb620a03409bb2b60a213f150e486964027816a5ef43c3ba6c518eb6dfae"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.obtain_gene_names (cognitive 24): utils.obtain_gene_names has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 3 (4 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":"kb_python/utils.py"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3794f7bacdb90806bcbc2938d4e4343d06230baabfb01093b32591a402c4e2"}},{"ruleId":"D2","level":"warning","message":{"text":"count.filter_with_bustools (cognitive 21): count.filter_with_bustools has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 2 (6 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: kb_python/count.py holds 7 of the 23 methods over the threshold \u2014 including the worst \u2014 and 458 of the 918 points over it (50%), 2.1\u00D7 the next-largest file (kb_python/main.py at 215). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/count.py"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d830c414e4d90257e131a9e8ce60e77b350c2d75029a2922b4d32ec2ef858b"}},{"ruleId":"D2","level":"warning","message":{"text":"ref.download_reference (cognitive 21): ref.download_reference has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/ref.py"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"00795ba60e1093a4366b1935adb161af282d9fa8bbfd4509c5702ff12fd78fde"}},{"ruleId":"D2","level":"warning","message":{"text":"sweep.read_celltypes (cognitive 20): sweep.read_celltypes has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, error handling 1 (3 pts), ternaries 2 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/sweep.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"a306ea3e9d411aed8f3cc5319eb3e138e0d73ffd50bb1de06194b5872112e016"}},{"ruleId":"D2","level":"warning","message":{"text":"main.parse_compile (cognitive 18): main.parse_compile has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 6 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/main.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"05986c7bfe6a4955d4adcbe5db090e4c5d673ccd2369ae2c939dcd11d96af461"}},{"ruleId":"D2","level":"warning","message":{"text":"main.setup_ref_args (cognitive 16): main.setup_ref_args has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 6, if/else 3 (6 pts), ternaries 3, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/main.py"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f09f00ae1728e2754c83ee710e0c5430a38e9f90232e27179313da391b81b1b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: kb_python/count.py: FileTooLong \u2014 2226 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1726 over it, 4.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/count.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ebda110c30f8f72f7baf7e06b94049d1fbf523c8171b56989a281f9496b63c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: kb_python/main.py: FileTooLong \u2014 1696 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1196 over it, 3.39\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":"kb_python/main.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"242a321e015dccf4155211f098adffe0f7bd41da5fce1b184d033a7e474ff58e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: kb_python/ref.py: FileTooLong \u2014 828 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 328 over it, 1.66\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/ref.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39ff872397ad22a1f15d2ae951a03323f0fbe05d0140d6189d580c26af1a5ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: kb_python/utils.py: FileTooLong \u2014 524 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 24 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/utils.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24604955c491db7cf1885673c2fe70a601ee981c6c8dd2446611f55a7780848"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (106 shared lines): kb_python/ref.py:869-1129 | kb_python/ref.py:1151-1336 \u2014 These two members are variants of one another: 106 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/ref.py"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f033f7502fb1592c732d1c53d832596c569e586375658a56a9df6ab4d56b90"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): kb_python/count.py:1265-1797 | kb_python/count.py:1855-2545 | kb_python/count.py:2580-2977 | kb_python/count.py:3001-3254 \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":"kb_python/count.py"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"962202ed98e21e507c115b0071110e92eaaf1a0b12e3c5ad761ea664d175bfb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): kb_python/compile.py:114-157 | kb_python/compile.py:166-202 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/compile.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd32b12fbf276c94b63b5765e5e5c8d2818000358118cb7a9b8b1706c38b76ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): kb_python/count.py:339-359 | kb_python/count.py:371-399 | kb_python/count.py:439-465 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 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":"kb_python/count.py"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aef92a25508a53cf5db87c103d0465937f8e5d1a9f32f4083ec98d33e5dd802"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): kb_python/report.py:71-92 | kb_python/report.py:96-117 | kb_python/report.py:121-144 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/report.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e5fbd13054a465c14169fef3c7e927c26f17b04b97efb90bafcf30de52ff9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): kb_python/dry/utils.py:66-75 | kb_python/utils.py:316-333 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/dry/utils.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf06aee51cd83136489a0583dfd384b352a267a5fdf29f2f39c0c589846fdfdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (95\u201396 lines \u00D7 2): kb_python/count.py:1265-1360 | kb_python/count.py:1855-1949 \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":"kb_python/count.py"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"15dbeedcbb9db67eed8f4983b86cafbe4335f36c53e939d3807444f4775edf7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (59\u201361 lines \u00D7 2): kb_python/count.py:1366-1426 | kb_python/count.py:1954-2012 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060kb_python/count.py:1366\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/count.py"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e580b6ce6a2c320bcd983926f4c3fbb062b1c6ebedfcfbab111690e25a744a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39\u201343 lines \u00D7 2): kb_python/ref.py:582-620 | kb_python/ref.py:869-911 \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":"kb_python/ref.py"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f3bf52295a96a07e58e4a59fe6eb3a87ff0e3073c9c8c2f1c0704976c85e41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39\u201340 lines \u00D7 2): kb_python/count.py:1555-1594 | kb_python/count.py:2105-2143 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060kb_python/count.py:1555\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/count.py"},"region":{"startLine":1555}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6a901853c8d8f8a0a5745f882908ad69f284cd6cd0412b99d1faf7278e73df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): kb_python/count.py:2456-2487 | kb_python/count.py:2906-2937 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060kb_python/count.py:2456\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":"kb_python/count.py"},"region":{"startLine":2456}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d860cb3dad68ad4142f289605f7e9fa3c4965b59c391a27c28c1dfb5fa7f3c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201329 lines \u00D7 2): kb_python/count.py:1483-1511 | kb_python/count.py:2041-2068 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060kb_python/count.py:1483\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":"kb_python/count.py"},"region":{"startLine":1483}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c2f5f6ddb2be1dd90b3d5eb836cc91029073f011d89c1f1767ffdabe92645c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): kb_python/ref.py:1101-1129 | kb_python/ref.py:1308-1336 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060kb_python/ref.py:1101\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/ref.py"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74c45dc0cf3ae37cdd1d3370e15fa9802998fad5ffc1d85bc3517b230160629"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): kb_python/config.py:233-260 | kb_python/config.py:264-291 \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":"kb_python/config.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae125828a943d40eb9a78aff8f29fe9c2ca8a96c47eeaa0994933c427b655ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): kb_python/count.py:2212-2236 | kb_python/count.py:2402-2425 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060kb_python/count.py:2212\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":"kb_python/count.py"},"region":{"startLine":2212}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3b011405b23ea17f4cadae33bdf8d48cf37ce6c1beeb42357d4b6ccb5989a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): kb_python/main.py:993-1016 | kb_python/main.py:1226-1250 \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":"kb_python/main.py"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2110728c4d5b44f4683917a58e4c2064903547e3bd04e63df75319fcb8c509"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): kb_python/ref.py:952-974 | kb_python/ref.py:1201-1222 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060kb_python/ref.py:952\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/ref.py"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"147a022c824a1a262337f5be5941a70c8affd8a5d1389a18006aa8d937b0751e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 3): kb_python/main.py:1171-1190 | kb_python/main.py:1578-1596 | kb_python/main.py:1833-1851 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/main.py"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"304f6894ebf02ec77935a24148be174590f02b9c1a1ba3e5cff6536c958c5854"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): kb_python/count.py:779-797 | kb_python/count.py:871-890 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060kb_python/count.py:779\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060kb_python/count.py:892\u0060 calls \u0060info\u0060, \u0060sum_anndatas\u0060, \u0060overlay_anndatas\u0060 and \u0060kb_python/count.py:798\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":"kb_python/count.py"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd5dd6db527910f244a083f025e666bf49871a04b3ea36bef3ee1756151c12f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): kb_python/count.py:2083-2101 | kb_python/count.py:3134-3151 \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":"kb_python/count.py"},"region":{"startLine":2083}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a4aa9c7e0bfc8b37a4d0ece51afa10db3cb179b487bc6c5d7755ba76779768"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): kb_python/ref.py:1016-1035 | kb_python/ref.py:1257-1275 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060kb_python/ref.py:1016\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/ref.py"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8922cda2cdc761992596e6736d341d7150edd44caa849178206271ae20e38b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 3): kb_python/count.py:1364-1381 | kb_python/count.py:1952-1968 | kb_python/count.py:2647-2664 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060kb_python/count.py:1364\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060kb_python/count.py:1949\u0060 calls \u0060upper\u0060, \u0060join\u0060 and \u0060kb_python/count.py:2646\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":"kb_python/count.py"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"3701fa9a0e9ff815c55b07e420749cced9c40072cff7fbddd41ee796c4400fee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): kb_python/count.py:1536-1553 | kb_python/count.py:2086-2103 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060kb_python/count.py:1536\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":"kb_python/count.py"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"2764702676c26f18554ee2e85ebfddbc297871c97ce65aa4ee6c7f85ecf87f36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): kb_python/main.py:1018-1035 | kb_python/main.py:1253-1270 \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":"kb_python/main.py"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2a4f53984995258e0718d76088b4d50ad8889facddde52d0e7b66f1c963282"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 3): kb_python/count.py:1477-1493 | kb_python/count.py:2035-2050 | kb_python/count.py:3100-3115 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060kb_python/count.py:1477\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060kb_python/count.py:1497\u0060 calls \u0060upper\u0060 and \u0060kb_python/count.py:3118\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":"kb_python/count.py"},"region":{"startLine":1477}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9e6768dd42da6e0400ce86759ca612ecdc1046e5067abb79083ec436553ab8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): kb_python/count.py:2255-2271 | kb_python/count.py:3214-3228 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060kb_python/count.py:2255\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":"kb_python/count.py"},"region":{"startLine":2255}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1cdae510fe13ef483ba0f849fa084a0d88cba5fb9790457ee643ede386faf99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): kb_python/count.py:2275-2290 | kb_python/count.py:3227-3243 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060kb_python/count.py:2275\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":"kb_python/count.py"},"region":{"startLine":2275}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f76d1080c7aad35bd2b4ccab67726dd63411ee165c6c1e9bccd7cdd0155c390"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): kb_python/count.py:2459-2475 | kb_python/count.py:2807-2822 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060kb_python/count.py:2459\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":"kb_python/count.py"},"region":{"startLine":2459}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f335efc49be8711cddb94691e0a862619edccfdf281bbe5f5bad4ee858a3427"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): kb_python/count.py:2665-2681 | kb_python/count.py:3063-3079 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060kb_python/count.py:2665\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":"kb_python/count.py"},"region":{"startLine":2665}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ff18d65b8c1e6a794d022da37994cdca9bd559bafab05db6ef033195f4b6c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): kb_python/count.py:2699-2715 | kb_python/count.py:3094-3108 \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":"kb_python/count.py"},"region":{"startLine":2699}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62fb67ea26ab84bcc8af0fa92704c4cb8fd9a4cdfdce86b9678e323a3e7fd57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): kb_python/count.py:2164-2179 | kb_python/count.py:2353-2368 \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":"kb_python/count.py"},"region":{"startLine":2164}}}],"partialFingerprints":{"codehealthFindingId/v1":"9726c0c1c5bc086ad2bee2bacf0479d7876ba67b7483b8437c35491afc4d5797"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): kb_python/count.py:2313-2328 | kb_python/count.py:2829-2844 \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":"kb_python/count.py"},"region":{"startLine":2313}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a0dacf24665a92c17abadbd11471b9bf567dbc4b4a1f11e85537c02a7544e8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 3): kb_python/count.py:2458-2472 | kb_python/count.py:2807-2819 | kb_python/count.py:2909-2923 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060kb_python/count.py:2458\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":"kb_python/count.py"},"region":{"startLine":2458}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61b42bba2e483bd401d592b38a84f5c742f7655b9f5fa1650f95728875f144c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): kb_python/count.py:2011-2025 | kb_python/count.py:2683-2697 \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":"kb_python/count.py"},"region":{"startLine":2011}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7d12d5220f856d6a249d256050386213de24638be219fb59e9dd380bfe6daf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): kb_python/ref.py:997-1010 | kb_python/ref.py:1238-1252 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060kb_python/ref.py:997\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/ref.py"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7dab2c75b13db2edf238dc9a3e2fd7cff77d68076463af17fc02d62b9dc89da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): kb_python/ref.py:611-624 | kb_python/ref.py:902-915 | kb_python/ref.py:1177-1190 \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 before the matched lines, \u0060kb_python/ref.py:610\u0060 calls \u0060get_dlist_fasta\u0060 and \u0060kb_python/ref.py:1175\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":"kb_python/ref.py"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dbd1bbcf6aa6b9dddcbaa1739df3e2519e1900a873cc387b555255a63313efe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): kb_python/count.py:1515-1528 | kb_python/count.py:2069-2082 \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":"kb_python/count.py"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a235fe0072fb7d6833587e40a2a9b2039541c34c071c7cb525e22676842fd1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): kb_python/count.py:797-809 | kb_python/count.py:894-904 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060kb_python/count.py:797\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/count.py"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb49f56793909384379cd406a73d97eb80f7e3bc344ca0b4f89415879583b486"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): kb_python/count.py:1439-1451 | kb_python/count.py:2026-2037 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060kb_python/count.py:1439\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/count.py"},"region":{"startLine":1439}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebca4150aa99bbfb436a3e925964ee19fae0c8fe256b23b3a7aa70630979cd92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): kb_python/count.py:1596-1608 | kb_python/count.py:2145-2156 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060kb_python/count.py:1596\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":"kb_python/count.py"},"region":{"startLine":1596}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eaef15f8101c49a08f027e48aa5e5aca793aca45b12ea16d41f1f46a9ddd7c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): kb_python/count.py:1785-1797 | kb_python/count.py:2533-2545 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060kb_python/count.py:1785\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/count.py"},"region":{"startLine":1785}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6866fbe8033e9a7ded46acfadc1fe68788989969d9d325d0a0435c79182ec5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): kb_python/main.py:641-652 | kb_python/main.py:770-781 \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":"kb_python/main.py"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b0697bef35e766bbbdcfd5e17a13780600e49aa21297151a60b224069d227c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): kb_python/ref.py:643-652 | kb_python/ref.py:1195-1206 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060kb_python/ref.py:643\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/ref.py"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"9573c3eb2547fe32933ac36643eb65d37ac741a827964581d2a18cdd11165306"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): kb_python/count.py:2184-2194 | kb_python/count.py:2369-2383 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060kb_python/count.py:2184\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/count.py"},"region":{"startLine":2184}}}],"partialFingerprints":{"codehealthFindingId/v1":"b801d1962524cdc8f76d4473adb04e4ec3b075299ca4c688799ca2a642188e6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): kb_python/utils.py:579-589 | kb_python/utils.py:656-666 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060kb_python/utils.py:579\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/utils.py"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4e6703a6c5f90f3dfa7b2d0bf653ef7091c42f418ebd17864a1bab8a7afdbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): kb_python/compile.py:233-241 | kb_python/compile.py:255-263 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060kb_python/compile.py:233\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/compile.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ca5fde9db3aefc67963e8e7f063d0430a40aeef8866649141f201a2b192405"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): kb_python/ref.py:922-929 | kb_python/ref.py:1194-1201 \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":"kb_python/ref.py"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1ecf4450659dd729b355c0f7b40efd67ac016fd62606a525192816d8cf0c12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): kb_python/compile.py:244-250 | kb_python/compile.py:266-272 \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":"kb_python/compile.py"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e49776ef3e20639c4e87d4bff90e0883f6ede4a91cd1d43aaadc6156dfa3ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): kb_python/count.py:2731-2737 | kb_python/count.py:2844-2853 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060kb_python/count.py:2731\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/count.py"},"region":{"startLine":2731}}}],"partialFingerprints":{"codehealthFindingId/v1":"6173fd7ae6f24ec34b4950ea3f6b35f33771c76a1b0b4d7ef78dbce1b3d0b269"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): kb_python/extract.py:148-154 | kb_python/extract.py:417-423 \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":"kb_python/extract.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"424c26401c78d32b6ea179ebf0efbcb590e8babe6e571b1a1da5659d00331f7a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: kb_python/count.py: 39.7% line coverage (366/921)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/count.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c32be72de7729623878978ffee6908c5cf7ea5f9a36621f6eec99b052beeceb"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: kb_python/extract.py: 0.0% line coverage (0/176)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/extract.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e42623cafe0dff6c5762a5f8bffb732d38be4d569c3d6681deb31dca0022959"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: kb_python/main.py: 10.1% line coverage (57/567)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/main.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50bc6f485041687ea557e774a4a768ee5aca83ff1e62396cfcb3aa847ebc83be"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: setup.py: 0.0% line coverage (0/6)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"setup.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"438f0bdce8e8ba6e181e92d9a76cceb66bd86def2a774b9aa82b0f3e5949039d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: kb_python/sweep.py: kb_python/sweep.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in sweep.sweep at line 222. 1 of those changes was a fix/bug commit, and the other 3 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 17:14:28 -08:00\u0027 --until=\u00272026-11-10 17:14:28 -08:00\u0027 --full-history --no-merges -- kb_python/sweep.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":"kb_python/sweep.py"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05242b8865726b3757e6cf2deab347c0cdae738429031cec08fcb11917a532c"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 1 significant file(s) lose their only recent owner: kb_python/sweep.py. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"964bac7a221115686b0592c0dbbcb4dccfd09b99c3d54f0b2dab8d99129002ea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: REMOVE THIS WHEN KALLISTO IS UPDATED \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/count.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c76887ca5b53da793fdad9d7021a696a3604dba1182900083d6bd01cea8420"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Fix this in kallisto? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/count.py"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9dff33d6e019e99bce4c3060253e2268a83a86ad49aee3a28a4ab480e176351"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove these \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/utils.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"31db79fef891a30311696b5f38bda592720f30ba83f9540143112fde2ec29048"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060setup.py\u0060 makes this repository a deployable product (line 30)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"setup.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"592d3b527192dcc635e0d3620b5ab85e733e86a8c73dc2514871cd852d17c732"}},{"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":"0d3dcad6a99ae5bd1bf42b26e9dedd48d494c7668865a1cfe26befe455c590a6"},"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":"9545660e6add0322e3f7b23092a9bdb2b9ecacff6395f93e694cf9dc97bdaaa2"},"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":"915c8f9e39fe076a969ae8ce991507d22cd6025715823437f5af2f7477b9bbc8"},"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":"ee6da1b051ddff31eece62e737e90827fa671274985f5a26bd0f59d7c044006f"},"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":"f1e1192c47a921b2ff67aa0fdfcba02b9247ddb8ce6d0a069e043a2c0948c6f7"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"18002ce689306f6cc0698b66614b2dd00ebde281b47dc7bd58149eb0d8468990"},"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":"101907159e3bb7d8afe7fa3e34f7c2a5a9da4668d93ae9cd3e6f1dd4ae43516b"},"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":"ab8d83539c5ebe567cb6deae98d392d6617f9ea4001a34a9a21fb3f393c0be8f"},"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":"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":"cf4c81c46820e9a42e91c54bc2f6614b13bcfad97a395143d1a0c5872a78ccad"},"properties":{"dependency":{"package":"scikit-learn","version":"0.21.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2020-107"],"severity":"critical","relation":"direct","declaredRange":"0.21.3","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":"ca1145ebbbeeddbbeffb1891a1d054b2436af6f26e2f7631664fec245f9d537f"},"properties":{"dependency":{"package":"pytest","version":"8.2.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-1845"],"severity":"medium","fixedVersion":"9.0.3","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":"9a03ee5ac13f261e10a74a89bf5a32f35a98cab4f99e92d21a55b6c7d997dd2d"},"properties":{"dependency":{"package":"nbconvert","version":"5.6.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","relation":"direct","declaredRange":"5.6.0","reachability":{"kind":"production","file":"kb_python/report.py","line":8}}}},{"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":"695ff4c3f5e796fa085e334211e9f7020681f46a94c8ed2f8a65e1cf7b4233c1"},"properties":{"dependency":{"package":"biopython","version":"1.8","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-1221"],"severity":"medium","relation":"direct","declaredRange":"1.8","reachability":{"kind":"unknown"}}}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 8 of 13 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 13 of the 18 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: kb_python/extract.py, kb_python/compile.py, kb_python/report.py, kb_python/config.py, kb_python/validate.py, kb_python/stats.py, kb_python/dry/utils.py, kb_python/constants.py. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/extract.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6867ea833fc745e2f577cfe47ad754289a45d5050ae8f11da8c9765f9b946bf"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a934842c204f5decc9b3e4df2eb61b0ce7f419076f9c56004d4bb1b15f428e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/compile.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c546a892874847c75e8e2380ba65690299f5181572054ced348fb20e4168dc"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/report.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f9af1faba966345888ecf2d3f81462546da10a371071c2a71353ecf0f8ce6e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/validate.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"625a1d18b8d2e0800feee1720607fe6b68e1fb6a14db2faf3a409dce7652d47c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/stats.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96997a7cfc5433973dce9807679a9c16ae81a0973c5faa2dd72fdec9ff532272"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/dry/utils.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5a92339ece296d9d5ab4d6ab9aa22555484fee936f409b11b6479a7e23b7cb"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/constants.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e70571b7a0be7183f151ad6c6c5fc85a8c73d2be533368c27d2ce5af91a700"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90ef8645d5d250a2cdd6c4ddecf434c2439a3eaf0b71b0b76b3e93b4d1bb9e49"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"65d87ec21c1ecf43a0424ab644272e64330044f506a9f75bd32965b5f8696841"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fc5445989f2ed1a6cdd8ba1d81af8788542d376cfec71d00d96fee7fbe6ee193"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"M2","level":"note","message":{"text":"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":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"P12","level":"warning","message":{"text":"Coverage collected but not gated: CI collects a coverage report but no step enforces a minimum \u2014 coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool\u0027s minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository\u0027s CI files AND its coverage configuration \u2014 the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited \u2014 matched against the threshold settings this check knows by name. A floor set in your coverage service\u0027s web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7f63c06044cf998d9a0698692df30d8873e29bc9b0c98ee829255017c1193d33"}},{"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":[],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060dev-requirements.txt\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":"dev-requirements.txt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49def04c7d109f0746bd849c1d13e5f5690ed3a5de8900591513dd7ec127626"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 176 is called with an argument built by \u0060\u0022\u2026\u0022.join(np.array(ecs_mm).astype(str))\u0060 (line 177), whose cost grows with the collection it walks. Python evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no \u0060isEnabledFor(logging.DEBUG)\u0060 test, no debug flag, no \u0060lambda\u0060 the logger calls only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/extract.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"074b05bd1a6d27ef6da7897fa6aeffe489edc02e543257723922ecc4320443cc"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 134 is called with an argument built by \u0060\u0022\u2026\u0022.join(c)\u0060 (line 134), whose cost grows with the collection it walks. Python evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no \u0060isEnabledFor(logging.DEBUG)\u0060 test, no debug flag, no \u0060lambda\u0060 the logger calls only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/utils.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"d232117dccde68fc38c15ae21e8520e6776e2daa1342f11ea658b671fffc3707"}},{"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":"kb_python/main.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5600b914341bb55bbe65ee852056060e9bbdb5a0f49262e83e9bc0b8649990"}},{"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":"kb_python/main.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b8c523ffedc5a42ad1b0f476629e7e9103fd86add14d6b926715d7a2815dae"}},{"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":"kb_python/main.py"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0975eab9ee7b60127a48808b10b14868a1514934f700fbb1d6e43cd41d59e91"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 499 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/main.py"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cebd32dc13995b1ad68a4f3d86ee5b3e4c7aa5b89934c48beb8a0b404367999"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 2214 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.debug(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/main.py"},"region":{"startLine":2214}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f987f7481e410a137165c8f75ee4c2cc2f92300f462c15c7cc370f38e5becc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 2215 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.debug(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/main.py"},"region":{"startLine":2215}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf520591f7b94ba93f5a058223793bd422880ab7c72f2dc40be6fd72b44db01"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 2231 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.debug(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/main.py"},"region":{"startLine":2231}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0c35abdeec85a9a4e128b744cacb98a20f952da130ff4a38949c2a6a770814"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 2245 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.debug(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kb_python/main.py"},"region":{"startLine":2245}}}],"partialFingerprints":{"codehealthFindingId/v1":"8193609d2cded9039ded7b8ea6388cd96dbc3001f4a907f5f6b4054efb21dcbd"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-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-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"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":20,"secretScannerRunsExcluded":0}},"redactionTokens":["A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."]}]}